391 search results - page 59 / 79 » Comparison-Based Algorithms Are Robust and Randomized Algori... |
129
click to vote
WEA
2007
Springer
15 years 9 months ago
2007
Springer
Many speed-up techniques for route planning in static graphs exist, only few of them are proven to work in a dynamic scenario. Most of them use preprocessed information, which has ...
137
click to vote
IPSN
2003
Springer
15 years 8 months ago
2003
Springer
Abstract. We demonstrate that it is possible to achieve accurate localization and tracking of a target in a randomly placed wireless sensor network composed of inexpensive componen...
134
click to vote
ESOA
2006
15 years 6 months ago
2006
Evolutionary algorithms based on "tags" can be adapted to induce cooperation in selfish environments such as peer-to-peer systems. In this approach, nodes periodically co...
126
click to vote
CEC
2010
IEEE
15 years 2 months ago
2010
IEEE
Abstract— We present a unifying framework for continuous optimization and sampling. This framework is based on Gaussian Adaptation (GaA), a search heuristic developed in the late...
121
click to vote
INFOCOM
2009
IEEE
15 years 9 months ago
2009
IEEE
—The typical state-of-the-art routing algorithms for delay tolerant networks are based on best next hop hill-climbing heuristics in order to achieve throughput and efficiency. T...