Sciweavers

1698 search results - page 44 / 340
» Growing Complex Games
Sort
View
STOC
2006
ACM
132views Algorithms» more  STOC 2006»
15 years 10 months ago
Near-optimal algorithms for unique games
Unique games are constraint satisfaction problems that can be viewed as a generalization of Max-Cut to a larger domain size. The Unique Games Conjecture states that it is hard to ...
Moses Charikar, Konstantin Makarychev, Yury Makary...
EUROPAR
2009
Springer
15 years 4 months ago
Searching for Concurrent Design Patterns in Video Games
The transition to multicore architectures has dramatically underscored the necessity for parallelism in software. In particular, while new gaming consoles are by and large multicor...
Micah J. Best, Alexandra Fedorova, Ryan Dickie, An...
AAAI
2000
14 years 11 months ago
Human-Level AI's Killer Application: Interactive Computer Games
Although one of the fundamental goals of AI is to understand and develop intelligent systems that have all of the capabilities of humans, there is little active research directly ...
John E. Laird, Michael van Lent
WINE
2009
Springer
184views Economy» more  WINE 2009»
15 years 4 months ago
Competitive Routing over Time
Congestion games are a fundamental and widely studied model for selfish allocation problems like routing and load balancing. An intrinsic property of these games is that players ...
Martin Hoefer, Vahab S. Mirrokni, Heiko Rögli...
ACL
2011
14 years 1 months ago
Learning to Win by Reading Manuals in a Monte-Carlo Framework
This paper presents a novel approach for leveraging automatically extracted textual knowledge to improve the performance of control applications such as games. Our ultimate goal i...
S. R. K. Branavan, David Silver, Regina Barzilay