Sciweavers

21 search results - page 1 / 5
» Selective Approaches for Solving Weak Games
Sort
View
ATVA
2006
Springer
114views Hardware» more  ATVA 2006»
13 years 8 months ago
Selective Approaches for Solving Weak Games
Abstract. Model-checking alternating-time properties has recently attracted much interest in the verification of distributed protocols. While checking the validity of a specificati...
Malte Helmert, Robert Mattmüller, Sven Schewe
EOR
2008
88views more  EOR 2008»
13 years 4 months ago
Selection of a correlated equilibrium in Markov stopping games
This paper deals with an extension of the concept of correlated strategies to Markov stopping games. The Nash equilibrium approach to solving nonzero-sum stopping games may give m...
David M. Ramsey, Krzysztof Szajowski
CVPR
2010
IEEE
13 years 9 months ago
Visual Tracking via Weakly Supervised Learning from Multiple Imperfect Oracles
Long-term persistent tracking in ever-changing environments is a challenging task, which often requires addressing difficult object appearance update problems. To solve them, most...
Bineng Zhong, Hongxun Yao, Sheng Chen, Xiaotong Yu...
CVPR
2007
IEEE
14 years 6 months ago
Mumford-Shah Meets Stereo: Integration of Weak Depth Hypotheses
Recent results on stereo indicate that an accurate segmentation is crucial for obtaining faithful depth maps. Variational methods have successfully been applied to both image segm...
Thomas Pock, Christopher Zach, Horst Bischof
AAAI
2010
13 years 6 months ago
Understanding the Success of Perfect Information Monte Carlo Sampling in Game Tree Search
Perfect Information Monte Carlo (PIMC) search is a practical technique for playing imperfect information games that are too large to be optimally solved. Although PIMC search has ...
Jeffrey Richard Long, Nathan R. Sturtevant, Michae...