Sciweavers

3455 search results - page 102 / 691
» Generalized Game Trees
Sort
View
CG
2008
Springer
15 years 6 months ago
A Parallel Monte-Carlo Tree Search Algorithm
Monte-Carlo tree search is a powerful paradigm for the game of Go. We present a parallel Master-Slave algorithm for Monte-Carlo tree search. We experimented the algorithm on a netw...
Tristan Cazenave, Nicolas Jouandeau
QUESTA
2010
89views more  QUESTA 2010»
15 years 2 months ago
Asymptotically optimal importance sampling for Jackson networks with a tree topology
Consider a stable open Jackson Network with a tree topology. Customers arrive at the single root of the tree. The system is stable in the sense that the average service rate at ea...
Ali Devin Sezer
CAV
2003
Springer
160views Hardware» more  CAV 2003»
15 years 9 months ago
Fast Mu-Calculus Model Checking when Tree-Width Is Bounded
We show that the model checking problem for µ-calculus on graphs of bounded tree-width can be solved in time linear in the size of the system. The result is presented by first sh...
Jan Obdrzálek
CORR
2010
Springer
164views Education» more  CORR 2010»
15 years 3 months ago
Approximate Nash Equilibria under Stability Conditions
Finding approximate Nash equilibria in n × n bimatrix games is currently one of the main open problems in algorithmic game theory. Motivated in part by the lack of progress on wo...
Maria-Florina Balcan, Mark Braverman
CHI
2010
ACM
15 years 11 months ago
Let's play chinese characters: mobile learning approaches via culturally inspired group games
In many developing countries such as India and China, low educational levels often hinder economic empowerment. In this paper, we argue that mobile learning games can play an impo...
Feng Tian, Fei Lv, Jingtao Wang, Hongan Wang, Wenc...