Sciweavers

1410 search results - page 117 / 282
» The Algorithmics of Solitaire-Like Games
Sort
View
TACAS
2007
Springer
116views Algorithms» more  TACAS 2007»
15 years 5 months ago
Model Checking on Trees with Path Equivalences
For specifying and verifying branching-time requirements, a reactive system is traditionally modeled as a labeled tree, where a path in the tree encodes a possible execution of the...
Rajeev Alur, Pavol Cerný, Swarat Chaudhuri
LATIN
2004
Springer
15 years 4 months ago
Embracing the Giant Component
Consider a game in which edges of a graph are provided a pair at a time, and the player selects one edge from each pair, attempting to construct a graph with a component as large ...
Abraham Flaxman, David Gamarnik, Gregory B. Sorkin
ECCV
2010
Springer
15 years 4 months ago
Visual Recognition With Humans in the Loop
We present an interactive, hybrid human-computer method for object classification. The method applies to classes of objects that are recognizable by people with appropriate expert...
FUN
2010
Springer
279views Algorithms» more  FUN 2010»
14 years 9 months ago
Cracking Bank PINs by Playing Mastermind
The bank director was pretty upset noticing Joe, the system administrator, spending his spare time playing Mastermind, an old useless game of the 70ies. He had fought the instinct ...
Riccardo Focardi, Flaminia L. Luccio
108
Voted
CIAC
2010
Springer
259views Algorithms» more  CIAC 2010»
15 years 3 months ago
On Strategy Improvement Algorithms for Simple Stochastic Games
The study of simple stochastic games (SSGs) was initiated by Condon for analyzing the computational power of randomized space-bounded alternating Turing machines. The game is play...
Rahul Tripathi, Elena Valkanova, V. S. Anil Kumar