Sciweavers

97 search results - page 4 / 20
» Local Strategy Improvement for Parity Game Solving
Sort
View
ISAAC
2009
Springer
169views Algorithms» more  ISAAC 2009»
15 years 4 months ago
The Complexity of Solving Stochastic Games on Graphs
We consider some well-known families of two-player zero-sum perfect-information stochastic games played on finite directed graphs. Generalizing and unifying results of Liggett and...
Daniel Andersson, Peter Bro Miltersen
COGSCI
2004
53views more  COGSCI 2004»
14 years 10 months ago
On the spontaneous discovery of a mathematical relation during problem solving
People spontaneously discover new representations during problem solving. Discovery of a mathematical representation is of special interest, because it shows that the underlying s...
James A. Dixon, Ashley S. Bangert
GECCO
2009
Springer
144views Optimization» more  GECCO 2009»
15 years 4 months ago
Cheating for problem solving: a genetic algorithm with social interactions
We propose a variation of the standard genetic algorithm that incorporates social interaction between the individuals in the population. Our goal is to understand the evolutionary...
Rafael Lahoz-Beltra, Gabriela Ochoa, Uwe Aickelin
VMCAI
2010
Springer
15 years 7 months ago
Improved Model Checking of Hierarchical Systems
We present a unified game-based approach for branching-time model checking of hierarchical systems. Such systems are exponentially more succinct than standard state-transition gra...
Benjamin Aminof, Orna Kupferman, Aniello Murano
IPCO
2010
125views Optimization» more  IPCO 2010»
14 years 11 months ago
A Pumping Algorithm for Ergodic Stochastic Mean Payoff Games with Perfect Information
Abstract. We consider two-person zero-sum stochastic mean payoff games with perfect information, or BWR-games, given by a digraph G = (V = VB VW VR, E), with local rewards r : E R...
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvic...