800 search results - page 88 / 160 » On the Complexity of Parity Games |
SSPR
2010
Springer
13 years 7 months ago
2010
Springer
We propose a fast population game dynamics, motivated by the analogy with infection and immunization processes within a population of “players,” for finding dominant sets, a p...
TACAS
2009
Springer
14 years 3 months ago
2009
Springer
CEDAR (Counter Example Driven Antichain Refinement) is a new symbolic algorithm for computing weakest strategies for safety games of imperfect information. The algorithm computes ...
IV
2007
IEEE
14 years 3 months ago
2007
IEEE
This paper reports on a project federally funded by the Australian CRC for Interaction Design (ACID). It investigates the use of a 3D game engine as a landscape metaphor for hosti...
ESAW
2006
Springer
14 years 24 days ago
2006
Springer
Abstract. We study the problem of checking the competence of communicative agents operating in a global society in order to receive and offer electronic services. Such a society wi...
EWCBR
2006
Springer
14 years 24 days ago
2006
Springer
Abstract. The problem of defining robot behaviors to completely address a large and complex set of situations is very challenging. We present an approach for robot's action se...