Sciweavers

800 search results - page 84 / 160
» On the Complexity of Parity Games
Sort
View
STOC
2007
ACM
119views Algorithms» more  STOC 2007»
14 years 9 months ago
Balanced max 2-sat might not be the hardest
We show that, assuming the Unique Games Conjecture, it is NPhard to approximate MAX 2-SAT within LLZ + , where 0.9401 < LLZ < 0.9402 is the believed approximation ratio of t...
Per Austrin
ACG
2009
Springer
14 years 3 months ago
Solving Kriegspiel Endings with Brute Force: The Case of KR vs. K
Retrograde analysis is a tool for reconstructing a game tree starting from its leaves; with these techniques one can solve specific subsets of a complex game, achieving optimal pl...
Paolo Ciancarini, Gian Piero Favini
ICML
2003
IEEE
14 years 2 months ago
The Significance of Temporal-Difference Learning in Self-Play Training TD-Rummy versus EVO-rummy
Reinforcement learning has been used for training game playing agents. The value function for a complex game must be approximated with a continuous function because the number of ...
Clifford Kotnik, Jugal K. Kalita
IE
2007
13 years 10 months ago
Two families: dynamical policy models in interactive storytelling
In this paper we introduce a mathematical model of conflict that enhances Richardson’s model of Arms Race accounting for interactive scenarios, such as the ones provided by CRP...
Fabio Zambetta, Adam Nash, Paul Smith
IJCAI
2007
13 years 10 months ago
Argumentation Based Contract Monitoring in Uncertain Domains
Few existing argumentation frameworks are designed to deal with probabilistic knowledge, and none are designed to represent possibilistic knowledge, making them unsuitable for man...
Nir Oren, Timothy J. Norman, Alun D. Preece