105 search results - page 19 / 21 » Linear Time Algorithm for Weak Parity Games |
WADS
1997
Springer
13 years 12 months ago
1997
Springer
A fundamental task for an autonomous robot is to plan its own motions. Exact approaches to the solution of this motion planning problem suffer from high worst-case running times. ...
ATAL
2005
Springer
14 years 1 months ago
2005
Springer
This paper presents an agent strategy for complex bilateral negotiations over many issues with inter-dependent valuations. We use ideas inspired by graph theory and probabilistic ...
CDC
2009
IEEE
14 years 14 days ago
2009
IEEE
— The nullspace method is a powerful framework to solve the synthesis problem of fault detection filters in the most general setting. It is also well suited to address the least...
IPPS
2009
IEEE
14 years 2 months ago
2009
IEEE
We are interested in this paper to study scheduling problems in systems where many users compete to perform their respective jobs on shared parallel resources. Each user has speci...
INFOCOM
2009
IEEE
14 years 2 months ago
2009
IEEE
—Motivated by streaming applications with stringent delay constraints, we consider the design of online network coding algorithms with timely delivery guarantees. Assuming that t...