209 search results - page 42 / 42 » The Computational Complexity of Weak Saddles |
MOBICOM
2003
ACM
13 years 10 months ago
2003
ACM
In this paper, we consider the transport capacity of ad hoc networks with a random flat topology under the present support of an infinite capacity infrastructure network. Such a...
JAIR
2008
13 years 5 months ago
2008
Shapley's impossibility result indicates that the two-person bargaining problem has no non-trivial ordinal solution with the traditional game-theoretic bargaining model. Alth...
CCR
2002
13 years 5 months ago
2002
In Differentiated Service (DiffServ) networks, the routing algorithms used by the premium class traffic, due to the high priority afforded to that traffic, may have a significant ...
ICRA
2010
IEEE
13 years 3 months ago
2010
IEEE
Abstract— For many tasks in populated environments, robots need to keep track of present and future motion states of people. Most approaches to people tracking make weak assumpti...