Sciweavers

1410 search results - page 17 / 282
» The Algorithmics of Solitaire-Like Games
Sort
View
144
Voted
CSE
2009
IEEE
16 years 1 months ago
Parallel Computation of Nash Equilibria in N-Player Games
—We propose a parallel algorithm for finding Nash equilibria in n-player noncooperative games. The algorithm is based on enumerating the supports of mixed strategies in parallel...
Jonathan Widger, Daniel Grosu
175
Voted
QEST
2006
IEEE
16 years 11 days ago
Strategy Improvement for Concurrent Reachability Games
A concurrent reachability game is a two-player game played on a graph: at each state, the players simultaneously and independently select moves; the two moves determine jointly a ...
Krishnendu Chatterjee, Luca de Alfaro, Thomas A. H...
168
Voted
HT
2003
ACM
15 years 11 months ago
Paper chase revisited: a real world game meets hypermedia
In this short paper, we present a location aware mobile game which lets users play a paper chase game on a mobile device. By using their physical movement and location in the real...
Susanne Boll, Jens Krösche, Christian Wegener
166
Voted
FDG
2009
ACM
16 years 27 days ago
Motion and scene complexity for streaming video games
This work provides detailed measurements of the motion and scene complexity for a wide variety of video games. Novel algorithms to measure motion and scene complexity are presente...
Mark Claypool
167
Voted
ICCNMC
2005
Springer
15 years 12 months ago
On Mitigating Network Partitioning in Peer-to-Peer Massively Multiplayer Games
Recently, peer-to-peer infrastructure has been proposed to support massively multiplayer games in the literature. However, when underlying network partitions due to network outages...
Yuan He, Yi Zhang, Jiang Guo