Sciweavers

5995 search results - page 320 / 1199
» Algorithmic Game Theory
Sort
View
CISS
2007
IEEE
16 years 1 months 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
ALT
2007
Springer
16 years 3 months ago
On Calibration Error of Randomized Forecasting Algorithms
It has been recently shown that calibration with an error less than ∆ > 0 is almost surely guaranteed with a randomized forecasting algorithm, where forecasts are obtained by...
Vladimir V. V'yugin
ACG
2009
Springer
16 years 1 months ago
A Lock-Free Multithreaded Monte-Carlo Tree Search Algorithm
With the recent success of Monte-Carlo tree search algorithms in Go and other games, and the increasing number of cores in standard CPUs, the efficient parallelization of the sear...
Markus Enzenberger, Martin Müller 0003