5169 search results - page 66 / 1034 » Locality approximation using time |
94
Voted
RAS
2006
15 years 2 months ago
2006
Self-reconfigurable robots are built from modules, which are autonomously able to change the way they are connected. Such a robot can, through this self-reconfiguration process, c...
121
click to vote
ROBOCUP
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. Coordination graphs offer a tractable framework for cooperative multiagent decision making by decomposing the global payoff function into a sum of local terms. Each age...
PAKDD
2005
ACM
15 years 8 months ago
2005
ACM
In many modern application ranges high-dimensional feature vectors are used to model complex real-world objects. Often these objects reside on different local sites. In this paper,...
178
Voted
WIOPT
2011
IEEE
14 years 6 months ago
2011
IEEE
—This paper studies the performance of ad hoc networks with local FDMA scheduling using stochastic point processes. In such networks, the Poisson assumption is not justified due...
143
click to vote
WDAG
2010
Springer
15 years 24 days ago
2010
Springer
Abstract. Since in general it is NP-hard to solve the minimum dominating set problem even approximatively, a lot of work has been dedicated to central and distributed approximation...