Sciweavers

64 search results - page 7 / 13
» *-Minimax Performance in Backgammon
Sort
View
INFORMATICALT
2010
116views more  INFORMATICALT 2010»
14 years 6 months ago
A Dynamic Network Interdiction Problem
We present a novel dynamic network interdiction model that accounts for interactions between an interdictor deploying resources on arcs in a digraph and an evader traversing the ne...
Brian J. Lunday, Hanif D. Sherali
COLT
2010
Springer
14 years 7 months ago
Open Loop Optimistic Planning
We consider the problem of planning in a stochastic and discounted environment with a limited numerical budget. More precisely, we investigate strategies exploring the set of poss...
Sébastien Bubeck, Rémi Munos
IAT
2003
IEEE
15 years 2 months ago
Integrating Reinforcement Learning, Bidding and Genetic Algorithms
This paper presents a multi-agent reinforcement learning bidding approach (MARLBS) for performing multi-agent reinforcement learning. MARLBS integrates reinforcement learning, bid...
Dehu Qi, Ron Sun
CVPR
2000
IEEE
15 years 11 months ago
Learning in Gibbsian Fields: How Accurate and How Fast Can It Be?
?Gibbsian fields or Markov random fields are widely used in Bayesian image analysis, but learning Gibbs models is computationally expensive. The computational complexity is pronoun...
Song Chun Zhu, Xiuwen Liu
ICIP
2009
IEEE
15 years 10 months ago
Image Deconvolution By Stein Block Thresholding
In this paper, we propose a fast image deconvolution algorithm that combines adaptive block thresholding and Vaguelet-Wavelet Decomposition. The approach consists in first denoisi...