1245 search results - page 136 / 249 » Playing with Conway's problem |
CG
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. There are two complementary approaches to playing sums of combinatorial games. They can be characterized as local analysis and global search. Algorithms from combinatoria...
ATAL
2006
Springer
14 years 2 months ago
2006
Springer
Learning to converge to an efficient, i.e., Pareto-optimal Nash equilibrium of the repeated game is an open problem in multiagent learning. Our goal is to facilitate the learning ...
NIPS
2000
13 years 11 months ago
2000
Source separation, or computational auditory scene analysis, attempts to extract individual acoustic objects from input which contains a mixture of sounds from different sources, ...
AIIDE
2009
13 years 11 months ago
2009
In most modern video games, content (e.g. models, levels, weapons, etc.) shipped with the game is static and unchanging, or at best, randomized within a narrow set of parameters. ...
POPL
2003
ACM
14 years 10 months ago
2003
ACM
Given a program and two variables p and q, the goal of points-to analysis is to check if p can point to q in some execution of the program. This well-studied problem plays a cruci...