1012 search results - page 69 / 203 » coordination 2007 |
NIPS
2001
15 years 1 months ago
2001
We present a principled and efficient planning algorithm for cooperative multiagent dynamic systems. A striking feature of our method is that the coordination and communication be...
102
click to vote
NIPS
2003
15 years 1 months ago
2003
In order to understand AdaBoost’s dynamics, especially its ability to maximize margins, we derive an associated simplified nonlinear iterated map and analyze its behavior in lo...
123
click to vote
DAGSTUHL
1994
15 years 1 months ago
1994
The main advantage of distributed controlled robots and subsystems is the decentralized task execution by the system components. This way, properties for the design of flexible co...
ADHOC
2006
14 years 12 months ago
2006
ct 9 It is often useful to know the positions of nodes in a network. However, in a large network it is impractical to build a 10 single global map. In this paper, we present a new ...
COMCOM
2007
14 years 12 months ago
2007
Many applications of wireless sensor networks require the sensor nodes to obtain their locations. The main idea in most localization methods has been that some nodes with known co...