Sciweavers

1599 search results - page 165 / 320
» Algorithms for Parity Games
Sort
View
AIIDE
2006
15 years 8 months ago
Modeling Self-Adapting and Multicultural Non-Player Characters in Artificial Worlds
Modeling the behavior of Non-Player Characters (NPCs) so that they can act properly in an artificial world is a difficult, yet essential task in the development of modern computer...
Samuel Marin
NIPS
2003
15 years 8 months ago
Learning Near-Pareto-Optimal Conventions in Polynomial Time
We study how to learn to play a Pareto-optimal strict Nash equilibrium when there exist multiple equilibria and agents may have different preferences among the equilibria. We focu...
Xiao Feng Wang, Tuomas Sandholm
CISS
2007
IEEE
16 years 28 days ago
Towards Optimal Design of Data Hiding Algorithms Against Nonparametric Adversary Models
Abstract—This paper presents a novel zero-sum watermarking game between a detection algorithm and a data hiding adversary. Contrary to previous research, the detection algorithm ...
Alvaro A. Cárdenas, George V. Moustakides, ...
ATVA
2006
Springer
106views Hardware» more  ATVA 2006»
15 years 10 months ago
Efficient Algorithms for Alternating Pushdown Systems with an Application to the Computation of Certificate Chains
Motivated by recent applications of pushdown systems to computer security problems, we present an efficient algorithm for the reachability problem of alternating pushdown systems. ...
Dejvuth Suwimonteerabuth, Stefan Schwoon, Javier E...
CG
2008
Springer
15 years 8 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