2957 search results - page 322 / 592 » The Complexity of Polynomial-Time Approximation |
144
click to vote
IROS
2006
IEEE
16 years 19 days ago
2006
IEEE
— Motivated by an error-recovery locomotion problem, we propose a control technique for a complex mechanical system by decomposing the system dynamics into a collection of simpli...
157
click to vote
SIGECOM
2005
ACM
16 years 5 days ago
2005
ACM
We study two problems, that of computing social optimum and that of finding fair allocations, in the congestion game model of Milchtaich[8] Although we show that the general prob...
150
click to vote
ICALP
2005
Springer
16 years 4 days ago
2005
Springer
We define an algorithmic paradigm, the stack model, that captures many primal-dual and local-ratio algorithms for approximating covering and packing problems. The stack model is ...
172
click to vote
RSFDGRC
2005
Springer
16 years 3 days ago
2005
Springer
We discuss the problems of spatio-temporal reasoning in the context of hierarchical information maps and approximate reasoning networks (AR networks). Hierarchical information maps...
190
click to vote
AMEC
2004
Springer
16 years 18 hour ago
2004
Springer
In this paper we describe an analysis of two double auction markets— the clearing house auction and the continuous double auction. The complexity of these institutions is such th...