297 search results - page 60 / 60 » Planning Partially for Situated Agents |
FSTTCS
2008
Springer
13 years 5 months ago
2008
Springer
We survey determinacy, definability, and complexity issues of Banach-Mazur games on finite and infinite graphs. Infinite games where two players take turns to move a token thro...
ATAL
2003
Springer
13 years 10 months ago
2003
Springer
In this paper we present a cooperative negotiation protocol that solves a distributed resource allocation problem while conforming to soft real-time constraints in a dynamic envir...