12659 search results - page 238 / 2532 » The distributed breakout algorithms |
186
click to vote
DATE
2005
IEEE
2005
IEEE
LORD: A Localized, Reactive and Distributed Protocol for Node Scheduling in Wireless Sensor Networks
15 years 8 months ago
The lifetime of wireless sensor networks can be increased by minimizing the number of active nodes that provide complete coverage, while switching off the rest. In this paper, we ...
182
click to vote
AAAI
2006
15 years 8 months ago
2006
We define TTD-MDPs, a novel class of Markov decision processes where the traditional goal of an agent is changed from finding an optimal trajectory through a state space to realiz...
177
click to vote
TMC
2008
15 years 6 months ago
2008
We consider a scenario in which a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing a...
190
click to vote
ESA
2005
Springer
16 years 6 days ago
2005
Springer
We compare two algorithms for sorting out-of-core data on a distributed-memory cluster. One algorithm, Csort, is a 3-pass oblivious algorithm. The other, Dsort, makes three passes...
196
click to vote
ATAL
2010
Springer
15 years 7 months ago
2010
Springer
Many applications in multiagent learning are essentially convex optimization problems in which agents have only limited communication and partial information about the function be...