Sciweavers

175 search results - page 20 / 35
» Applying Inexpensive AI Techniques to Computer Games
Sort
View
CONCUR
2009
Springer
15 years 4 months ago
Winning Regions of Pushdown Parity Games: A Saturation Method
We present a new algorithm for computing the winning region of a parity game played over the configuration graph of a pushdown system. Our method gives the first extension of the...
Matthew Hague, C.-H. Luke Ong
64
Voted
CDC
2009
IEEE
166views Control Systems» more  CDC 2009»
15 years 2 months ago
Idempotent method for dynamic games and complexity reduction in min-max expansions
— In recent years, idempotent methods (specifically, max-plus methods) have been developed for solution of nonlinear control problems. It was thought that idempotent linearity o...
William M. McEneaney
DIGRA
2005
Springer
15 years 3 months ago
Games, Montage and the First Person Point of View
Interactive montage combines the elements of play and visual representation. The analysis of four examples of interactive montage in reference to a first person point of view high...
Michael Nitsche
CIG
2005
IEEE
15 years 3 months ago
Nannon: A Nano Backgammon for Machine Learning Research
A newly designed game is introduced, which feels like Backgammon, but has a simplified rule set. Unlike earlier attempts at simplifying the game, Nannon maintains enough features a...
Jordan B. Pollack
106
Voted
SAC
2009
ACM
15 years 2 months ago
Aspect-oriented procedural content engineering for game design
Generally progressive procedural content in the context of 3D scene rendering is expressed as recursive functions where a finer level of detail gets computed on demand. Typical e...
Walter Cazzola, Diego Colombo, Duncan Harrison