Sciweavers

1884 search results - page 47 / 377
» Simple Algorithm for Simple Timed 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
TIDSE
2004
Springer
15 years 3 months ago
Transferring Game Mastering Laws to Interactive Digital Storytelling
The Interactive Dilemma is the inevitable conflict between author’s determinism and interactor’s freedom. There are some approaches that try to tackle it, using strategies and...
Federico Peinado, Pablo Gervás
FOCS
1994
IEEE
15 years 2 months ago
Expander Codes
Sipser and Spielman have introduced a constructive family of asymptotically good linear error-correcting codes--expander codes--together with a simple parallel algorithm that will ...
Michael Sipser, Daniel A. Spielman
NETGAMES
2005
ACM
15 years 3 months ago
Dissecting server-discovery traffic patterns generated by multiplayer first person shooter games
We study the ‘background traffic’ resulting from tens of thousands of networked first person shooter (FPS) clients searching for servers on which to play. Networked, multiplay...
Sebastian Zander, David Kennedy, Grenville J. Armi...
ATAL
2008
Springer
14 years 12 months ago
Coalitional skill games
We consider Coalitional Skill Games (CSGs), a simple model of cooperation among agents. This is a restricted form of coalitional games, where each agent has a set of skills that a...
Yoram Bachrach, Jeffrey S. Rosenschein