Sciweavers

5138 search results - page 368 / 1028
» Randomized Algorithms for 3-SAT
Sort
View
AIPS
2007
15 years 9 months ago
A Fast Incremental Algorithm for Maintaining Dispatchability of Partially Controllable Plans
Autonomous systems operating in real-world environments must be able to plan, schedule, and execute missions while robustly adapting to uncertainty and disturbances. Previous work...
Julie A. Shah, John Stedl, Brian C. Williams, Paul...
192
Voted
AINA
2008
IEEE
15 years 8 months ago
UTAPS: An Underlying Topology-Aware Peer Selection Algorithm in BitTorrent
BitTorrent is one of the most well known peer-topeer file sharing applications, accounting for a significant proportion of Internet traffic. Current BitTorrent system builds its o...
Wei Li, Shanzhi Chen, Tao Yu
ICGA
1997
134views Optimization» more  ICGA 1997»
15 years 8 months ago
Local Search Genetic Algorithm for Optimization of Highly Reliable Communications Networks
This paper presents a genetic algorithm (GA) with specialized encoding, initialization and local search genetic operators to optimize communication network topologies. This NPhard...
Berna Dengiz, Fulya Altiparmak, Alice E. Smith
ISMB
1997
15 years 8 months ago
A Fast Heuristic Algorithm for a Probe Mapping Problem
Anewheuristic algorithm is presented for mapping probes to locations along the genome,given noisy pairwise distance data as input. Themodel consideredis quite general: Theinput co...
Brendan Mumey
CORR
2008
Springer
97views Education» more  CORR 2008»
15 years 6 months ago
Efficient Algorithms and Routing Protocols for Handling Transient Single Node Failures
Single node failures represent more than 85% of all node failures in the today's large communication networks such as the Internet [10]. Also, these node failures are usually...
Amit M. Bhosle, Teofilo F. Gonzalez