Sciweavers

64 search results - page 10 / 13
» Solving Parity Games in Practice
Sort
View
CORR
2008
Springer
125views Education» more  CORR 2008»
14 years 9 months ago
Semidefinite programming for N-Player Games
Abstract. We introduce two min-max problems: the first problem is to minimize the supremum of finitely many rational functions over a compact basic semi-algebraic set whereas the s...
Rida Laraki, Jean B. Lasserre
82
Voted
ICC
2007
IEEE
192views Communications» more  ICC 2007»
15 years 3 months ago
Informed Dynamic Scheduling for Belief-Propagation Decoding of LDPC Codes
— Low-Density Parity-Check (LDPC) codes are usually decoded by running an iterative belief-propagation, or message-passing, algorithm over the factor graph of the code. The tradi...
Andres I. Vila Casado, Miguel Griot, Richard D. We...
120
Voted
STOC
1994
ACM
168views Algorithms» more  STOC 1994»
15 years 1 months ago
Fast algorithms for finding randomized strategies in game trees
Interactions among agents can be conveniently described by game trees. In order to analyze a game, it is important to derive optimal (or equilibrium) strategies for the di erent p...
Daphne Koller, Nimrod Megiddo, Bernhard von Stenge...
74
Voted
CSL
2007
Springer
15 years 3 months ago
Game Characterizations and the PSPACE-Completeness of Tree Resolution Space
The Prover/Delayer game is a combinatorial game that can be used to prove upper and lower bounds on the size of Tree Resolution proofs, and also perfectly characterizes the space ...
Alexander Hertel, Alasdair Urquhart
83
Voted
PKDD
2009
Springer
94views Data Mining» more  PKDD 2009»
15 years 4 months ago
OTTHO: On the Tip of My THOught
In this paper we propose a system to solve a language game, called Guillotine, which requires a player with a strong cultural and linguistic background knowledge. The player obser...
Pierpaolo Basile, Marco Degemmis, Pasquale Lops, G...