1578 search results - page 111 / 316 » Direct Routing: Algorithms and Complexity |
143
Voted
CIAC
2010
Springer
15 years 7 months ago
2010
Springer
The study of simple stochastic games (SSGs) was initiated by Condon for analyzing the computational power of randomized space-bounded alternating Turing machines. The game is play...
116
click to vote
WONS
2005
IEEE
15 years 9 months ago
2005
IEEE
Due to the mobility of nodes in Ad hoc networks, network topology is dynamic and unpredictable, which leads to frequent network partitioning. This partitioning disconnects many no...
135
Voted
CORR
2010
Springer
15 years 29 days ago
2010
Springer
We consider deployment problems where a mobile robotic network must optimize its configuration in a distributed way in order to minimize a steady-state cost function that depends ...
266
click to vote
GIS
2004
ACM
16 years 4 months ago
2004
ACM
Online multi-participant virtual-world systems have attracted significant interest from the Internet community but are hindered by their inability to efficiently support interacti...
139
Voted
ICNP
2006
IEEE
15 years 9 months ago
2006
IEEE
Abstract—We propose a solution to improve fairness and increase throughput in wireless networks with location information. Our approach consists of a multipath routing protocol, ...