182 search results - page 6 / 37 » Infinite Possibilities |
FOSSACS
2010
Springer
13 years 10 months ago
2010
Springer
We study variants of regular infinite games where the strict alternation of moves between the two players is subject to modifications. The second player may postpone a move for a f...
STOC
2002
ACM
14 years 7 months ago
2002
ACM
A randomized algorithm is given that solves the wait-free consensus problem for a shared-memory model with infinitely many processes. The algorithm is based on a weak shared coin ...
ATAL
2010
Springer
13 years 8 months ago
2010
Springer
This paper deals with fair assignment problems in decision contexts involving multiple agents. In such problems, each agent has its own evaluation of costs and we want to find a f...
MST
2006
13 years 7 months ago
2006
We consider the transition graphs of regular ground tree (or term) rewriting systems. The vertex set of such a graph is a (possibly infinite) set of trees. Thus, with a finite tree...
BMVC
1998
13 years 8 months ago
1998
Autocalibration is a difficult problem. Not only is its computation very noisesensitive, but there also exist many critical motions that prevent the estimation of some of the came...