Sciweavers

36 search results - page 7 / 8
» Using Linear Programming for Bayesian Exploration in Markov ...
Sort
View
ALDT
2009
Springer
142views Algorithms» more  ALDT 2009»
14 years 1 months ago
Finding Best k Policies
Abstract. An optimal probabilistic-planning algorithm solves a problem, usually modeled by a Markov decision process, by finding its optimal policy. In this paper, we study the k ...
Peng Dai, Judy Goldsmith
AUTOMATICA
2007
124views more  AUTOMATICA 2007»
13 years 6 months ago
Motion planning in uncertain environments with vision-like sensors
In this work we present a methodology for intelligent path planning in an uncertain environment using vision like sensors, i.e., sensors that allow the sensing of the environment ...
Suman Chakravorty, John L. Junkins
IJCAI
2003
13 years 7 months ago
Generalizing Plans to New Environments in Relational MDPs
A longstanding goal in planning research is the ability to generalize plans developed for some set of environments to a new but similar environment, with minimal or no replanning....
Carlos Guestrin, Daphne Koller, Chris Gearhart, Ne...
ICPR
2006
IEEE
14 years 7 months ago
Learning Policies for Efficiently Identifying Objects of Many Classes
Viola and Jones (VJ) cascade classification methods have proven to be very successful in detecting objects belonging to a single class -- e.g., faces. This paper addresses the mor...
Ahmed M. Elgammal, Ramana Isukapalli, Russell Grei...
INFOCOM
2009
IEEE
14 years 1 months ago
Delay-Optimal Opportunistic Scheduling and Approximations: The Log Rule
—This paper considers the design of opportunistic packet schedulers for users sharing a time-varying wireless channel from the performance and the robustness points of view. Firs...
Bilal Sadiq, Seung Jun Baek, Gustavo de Veciana