1599 search results - page 140 / 320 » Algorithms for Parity Games |
160
click to vote
ATVA
2007
Springer
16 years 22 days ago
2007
Springer
In this paper we consider the problem of controller synthesis for timed games under imperfect information. Novel to our approach is the requirements to strategies: they should be b...
181
click to vote
PPPJ
2003
ACM
15 years 11 months ago
2003
ACM
We report on a continuing study into teaching programming to pre-teens school-children, with some as young as seven years old. As part of the study we aim to test childrens’ alg...
159
click to vote
SEAL
1998
Springer
15 years 10 months ago
1998
Springer
Abstract. Robustness has long been recognised as a critical issue for coevolutionary learning. It has been achieved in a number of cases, though usually in domains which involve so...
182
click to vote
COCO
2008
Springer
15 years 8 months ago
2008
Springer
We study the approximability of predicates on k variables from a domain [q], and give a new sufficient condition for such predicates to be approximation resistant under the Unique...
140
click to vote
ATAL
2010
Springer
15 years 7 months ago
2010
Springer
We investigate planning for self-interested agents in large multi-agent simulations. We present two heuristic algorithms that exploit different domain-specific properties in order...