Sciweavers

2957 search results - page 511 / 592
» The Complexity of Polynomial-Time Approximation
Sort
View
UAI
1998
13 years 9 months ago
Structured Reachability Analysis for Markov Decision Processes
Recent research in decision theoretic planning has focussedon making the solution of Markov decision processes (MDPs) more feasible. We develop a family of algorithms for structur...
Craig Boutilier, Ronen I. Brafman, Christopher W. ...
TFCV
1994
13 years 9 months ago
Attentive Visual Motion Processing: Computations in the Log-Polar Plane
Attentive vision is characterized by selective sensing in space and time as well as selective processing with respect to a speci c task. Selection in space involves the splitting ...
Konstantinos Daniilidis
NIPS
1992
13 years 9 months ago
Some Solutions to the Missing Feature Problem in Vision
In visual processing the ability to deal with missing and noisy information is crucial. Occlusions and unreliable feature detectors often lead to situations where little or no dir...
Subutai Ahmad, Volker Tresp
ATAL
2010
Springer
13 years 8 months ago
Quasi deterministic POMDPs and DecPOMDPs
In this paper, we study a particular subclass of partially observable models, called quasi-deterministic partially observable Markov decision processes (QDET-POMDPs), characterize...
Camille Besse, Brahim Chaib-draa
ECAI
2010
Springer
13 years 8 months ago
Bayesian Monte Carlo for the Global Optimization of Expensive Functions
In the last decades enormous advances have been made possible for modelling complex (physical) systems by mathematical equations and computer algorithms. To deal with very long run...
Perry Groot, Adriana Birlutiu, Tom Heskes