Sciweavers

1698 search results - page 84 / 340
» Growing Complex Games
Sort
View
292
Voted
DIMACS
1996
15 years 5 months ago
Easier Ways to Win Logical Games
in Structure'95. 14] R. Fagin. Easier ways to win logical games. In Proc. DIMACS Workshop on Descriptive Complexity and Finite Models, AMS 1997. 15] R. Fagin, L. Stockmeyer, M...
Ronald Fagin
158
Voted
ICPR
2006
IEEE
16 years 4 months ago
Bayesian Imitation of Human Behavior in Interactive Computer Games
Modern interactive computer games provide the ability to objectively record complex human behavior, offering a variety of interesting challenges to the pattern-recognition communi...
Bernard Gorman, Christian Bauckhage, Christian Thu...
CHI
2004
ACM
16 years 4 months ago
Social interaction in 'there'
Persistent online environments, such as multi-player games, exhibit a complex social organisation. These environments often feature large social groupings and elaborate cooperativ...
Barry Brown, Marek Bell
130
Voted
STOC
2007
ACM
119views Algorithms» more  STOC 2007»
16 years 4 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
125
Voted
ACG
2009
Springer
15 years 10 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