4377 search results - page 839 / 876 » Mass problems and randomness |
FAABS
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. The task addressed here is a dynamic search through a bounded region, while avoiding multiple large obstacles, such as buildings. In the case of limited sensors and commu...
GECCO
2004
Springer
15 years 3 months ago
2004
Springer
Using a directed mutation can improve the efficiency of processing many optimization problems. The first mutation operators of this kind proposed by Hildebrand [1], however, suffer...
ICALP
2004
Springer
15 years 3 months ago
2004
Springer
We define a natural notion of efficiency for approximate nearest-neighbor (ANN) search in general n-point metric spaces, namely the existence of a randomized algorithm which answ...
IPSN
2004
Springer
15 years 3 months ago
2004
Springer
We study network capacity limits and optimal routing algorithms for regular sensor networks, namely, square and torus grid sensor networks, in both, the static case (no node failu...
IPSN
2004
Springer
15 years 3 months ago
2004
Springer
Due to constraints in cost, power, and communication, losses often arise in large sensor networks. The sensor can be modeled as an output of a linear stochastic system with random...