Sciweavers

44 search results - page 4 / 9
» From Parity and Payoff Games to Linear Programming
Sort
View
ML
2006
ACM
13 years 9 months ago
Universal parameter optimisation in games based on SPSA
Most game programs have a large number of parameters that are crucial for their performance. While tuning these parameters by hand is rather difficult, efficient and easy to use ge...
Levente Kocsis, Csaba Szepesvári
SPIN
2010
Springer
13 years 7 months ago
Analysing Mu-Calculus Properties of Pushdown Systems
Pushdown systems provide a natural model of software with recursive procedure calls. We provide a tool implementing an algorithm for computing the winning regions of a pushdown par...
Matthew Hague, C.-H. Luke Ong
CAV
2003
Springer
160views Hardware» more  CAV 2003»
14 years 2 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
WCE
2007
13 years 10 months ago
Game Theory Using Genetic Algorithms
—In this paper we used genetic algorithms to1 find the solution of game theory. We proposed new method foe solving game theory and find the optimal strategy for player A or playe...
Ismail A. Ismail, Nabawia A. El Ramly, M. M. El Ka...
CSL
2007
Springer
14 years 3 months ago
From Proofs to Focused Proofs: A Modular Proof of Focalization in Linear Logic
Abstract. Probably the most significant result concerning cut-free sequent calculus proofs in linear logic is the completeness of focused proofs. This completeness theorem has a n...
Dale Miller, Alexis Saurin