Sciweavers

1930 search results - page 332 / 386
» Learning to Solve QBF
Sort
View
NIPS
2008
13 years 9 months ago
An Online Algorithm for Maximizing Submodular Functions
We present an algorithm for solving a broad class of online resource allocation . Our online algorithm can be applied in environments where abstract jobs arrive one at a time, and...
Matthew J. Streeter, Daniel Golovin
NIPS
2007
13 years 9 months ago
Optimistic Linear Programming gives Logarithmic Regret for Irreducible MDPs
We present an algorithm called Optimistic Linear Programming (OLP) for learning to optimize average reward in an irreducible but otherwise unknown Markov decision process (MDP). O...
Ambuj Tewari, Peter L. Bartlett
RSS
2007
159views Robotics» more  RSS 2007»
13 years 9 months ago
Gaussian Beam Processes: A Nonparametric Bayesian Measurement Model for Range Finders
— In probabilistic mobile robotics, the development of measurement models plays a crucial role as it directly influences the efficiency and the robustness of the robot’s perf...
Christian Plagemann, Kristian Kersting, Patrick Pf...
AAAI
2006
13 years 9 months ago
Probabilistic Goal Recognition in Interactive Narrative Environments
Recent years have witnessed a growing interest in interactive narrative-centered virtual environments for education, training, and entertainment. Narrative environments dynamicall...
Bradford W. Mott, Sunyoung Lee, James C. Lester
DAGSTUHL
2006
13 years 9 months ago
Many-to-Many Feature Matching in Object Recognition
One of the bottlenecks of current recognition (and graph matching) systems is their assumption of one-to-one feature (node) correspondence. This assumption breaks down in the gener...
Ali Shokoufandeh, Yakov Keselman, M. Fatih Demirci...