1414 search results - page 114 / 283 » Cover Time and Broadcast Time |
111
Voted
ALGOSENSORS
2007
Springer
15 years 2 months ago
2007
Springer
We study the problem of localizing and tracking multiple moving targets in wireless sensor networks, from a network design perspective i.e. towards estimating the least possible n...
77
Voted
AHSWN
2008
14 years 10 months ago
2008
In this paper, we present a new efficient strategy for constructing a wireless tree network containing n nodes of diameter while satisfying the QoS requirements such as bandwidth...
87
Voted
SODA
2012
ACM
13 years 19 days ago
2012
ACM
We give a deterministic O(log n)n -time and space algorithm for the Shortest Vector Problem (SVP) of a lattice under any norm, improving on the previous best deterministic nO(n) -...
ICML
2003
IEEE
15 years 11 months ago
2003
IEEE
We present metric?? , a provably near-optimal algorithm for reinforcement learning in Markov decision processes in which there is a natural metric on the state space that allows t...
CEC
2007
IEEE
15 years 4 months ago
2007
IEEE
Abstract—Hybrid methods are very popular for solving problems from combinatorial optimization. In contrast to this the theoretical understanding of the interplay of different opt...