108 search results - page 10 / 22 » Valuing search and communication in partially-observable coo... |
MOBICOM
2004
ACM
14 years 25 days ago
2004
ACM
In this paper we consider the problem of searching for a node or an object (i.e., piece of data, file, etc.) in a large network. Applications of this problem include searching fo...
ATAL
2006
Springer
13 years 11 months ago
2006
Springer
We present a new polynomial-space algorithm for solving Distributed Constraint Optimization problems (DCOP). The algorithm, called NCBB, is branch and bound search with modificati...
FOCS
2006
IEEE
14 years 1 months ago
2006
IEEE
We convert cell-probe lower bounds for polynomial space into stronger lower bounds for near-linear space. Our technique applies to any lower bound proved through the richness meth...
CEEMAS
2005
Springer
14 years 28 days ago
2005
Springer
Underwater survey by a team of autonomous robots brings couple of problems caused mainly by the communication restrictions due to the nature of environment. Communication range and...
AGENTS
2001
Springer
13 years 12 months ago
2001
Springer
In this paper, we study a simple means for coordinating teams of simple agents. In particular, we study ant robots and how they can cover terrain once or repeatedly by leaving mar...