1698 search results - page 104 / 340 » Growing Complex Games |
132
click to vote
FSTTCS
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. This paper proposes a new algorithm that improves the complexity bound for solving parity games. Our approach combines McNaughton’s iterated fixed point algorithm with...
113
click to vote
TACAS
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. The automatic synthesis of programs from their specifications has been a dream of many researchers for decades. If we restrict to open finite-state reactive systems, th...
147
click to vote
IPTPS
2004
Springer
15 years 9 months ago
2004
Springer
In P2P systems, users often have many choices of peers from whom to download their data. Each user cares primarily about its own response time, which depends on how many other use...
137
Voted
AIIDE
2008
15 years 6 months ago
2008
As massively multi-player gaming environments become more detailed, developing agents to populate these virtual worlds as capable non-player characters poses an increasingly compl...
187
click to vote
EWCBR
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. Case-based planning (CBP) is based on reusing past successful plans for solving new problems. CBP is particularly useful in environments where the large amount of time re...