14548 search results - page 2877 / 2910 » The Optimal Path-Matching Problem |
APNOMS
2006
Springer
14 years 16 days ago
2006
Springer
Abstract. Recently, researchers have explored to provide a queue management scheme with differentiated loss guarantees for the future Internet. The Bounded Random Drop (BRD), known...
CG
2004
Springer
14 years 16 days ago
2004
Springer
Abstract. There are two complementary approaches to playing sums of combinatorial games. They can be characterized as local analysis and global search. Algorithms from combinatoria...
ATAL
2006
Springer
14 years 15 days ago
2006
Springer
Learning to converge to an efficient, i.e., Pareto-optimal Nash equilibrium of the repeated game is an open problem in multiagent learning. Our goal is to facilitate the learning ...
ATAL
2006
Springer
14 years 15 days ago
2006
Springer
We address the problem of navigating from an initial node to a goal node by a group of agents in an unknown physical environment. In such environments mobile agents must physicall...
COCO
2004
Springer
14 years 15 days ago
2004
Springer
Abstract: Although a quantum state requires exponentially many classical bits to describe, the laws of quantum mechanics impose severe restrictions on how that state can be accesse...