1291 search results - page 49 / 259 » Computing the multiplicity structure in solving polynomial s... |
LICS
2009
IEEE
14 years 2 months ago
2009
IEEE
This paper presents a new lower bound for the discrete strategy improvement algorithm for solving parity games due to V¨oge and Jurdzi´nski. First, we informally show which stru...
ISPA
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. With the help of distributed hash tables, the structured peerto-peer system has a short routing path and good extensibility. However, the mismatch between the overlay and...
PUK
2000
13 years 9 months ago
2000
Progressive processing plans allow systems to tradeoff computational resources against the quality of service by specifying alternative ways in which to accomplish each step. When ...
HPDC
1999
IEEE
13 years 12 months ago
1999
IEEE
We are developing a system for collaborative research and development for a distributed group of researchers at different institutions around the world. In a new paradigm for coll...
RAS
1998
13 years 7 months ago
1998
We present a new approach to the multi-robot path planning problem, where a number of robots are to change their positions through feasible motions in the same static environment....