Sciweavers

800 search results - page 48 / 160
» On the Complexity of Parity Games
Sort
View
FUN
2010
Springer
251views Algorithms» more  FUN 2010»
14 years 2 months ago
UNO Is Hard, Even for a Single Player
UNOR is one of the world-wide well-known and popular card games. We investigate UNO from the viewpoint of combinatorial algorithmic game theory by giving some simple and concise ma...
Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara,...
CARDIS
2006
Springer
109views Hardware» more  CARDIS 2006»
14 years 1 months ago
A Smart Card-Based Mental Poker System
On-line casinos have experienced a great expansion since the generalized use of Internet started. There exist in the literature several proposals of systems allowing secure remote ...
Jordi Castellà-Roca, Josep Domingo-Ferrer, ...
ICGA
2006
128views Optimization» more  ICGA 2006»
13 years 9 months ago
Never-Ending Moves in Bao
Bao is a member of the large family of mancala games. It is generally considered to be the most complex mancala game with respect to the number of game rules (Townshend, 1986; De ...
Tom Kronenburg, H. H. L. M. Donkers, Alex J. de Vo...
ETRA
2006
ACM
114views Biometrics» more  ETRA 2006»
14 years 3 months ago
Visual attention in 3D video games
Understanding players’ visual attention patterns within an interactive 3D game environment is an important research area that can improve game level design and graphics. Several...
Su Yan, Magy Seif El-Nasr
ACTA
2002
111views more  ACTA 2002»
13 years 9 months ago
Adding a path connectedness operator to FO+poly (linear)
In the constraint database community, FO+poly and FO+linear have been proposed as foundations for spatial database query languages. One of the strengths of this approach is that t...
Chris Giannella, Dirk Van Gucht