1698 search results - page 35 / 340 » Growing Complex Games |
APLAS
2008
ACM
14 years 11 months ago
2008
ACM
Abstract. We study the problem of generating a test sequence that achieves maximal coverage for a reactive system under test. We formulate the problem as a repeated game between th...
72
Voted
CAV
2007
Springer
15 years 3 months ago
2007
Springer
Three-color parity games capture the disjunction of a B¨uchi and a co-B¨uchi condition. The most efficient known algorithm for these games is the progress measures algorithm by ...
ACMACE
2005
ACM
15 years 3 months ago
2005
ACM
Outdoor multi-player games are an increasingly popular application area for ubiquitous computing, supporting experimentation both with new technologies and new user experiences. T...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
Abstract. We consider approximating the minmax value of a multiplayer game in strategic form. Tightening recent bounds by Borgs et al., we observe that approximating the value with...
158
Voted
LCC
1994
15 years 1 months ago
1994
The descriptive complexity of a problem is the complexity of describing the problem in some logical formalism. One of the few techniques for proving separation results in descripti...