Sciweavers

38 search results - page 3 / 8
» Decomposition techniques for policy refinement
Sort
View
ICML
2006
IEEE
14 years 6 months ago
Fast direct policy evaluation using multiscale analysis of Markov diffusion processes
Policy evaluation is a critical step in the approximate solution of large Markov decision processes (MDPs), typically requiring O(|S|3 ) to directly solve the Bellman system of |S...
Mauro Maggioni, Sridhar Mahadevan
TVCG
2012
203views Hardware» more  TVCG 2012»
11 years 8 months ago
Morse Set Classification and Hierarchical Refinement Using Conley Index
—Morse decomposition provides a numerically stable topological representation of vector fields that is crucial for their rigorous interpretation. However, Morse decomposition is ...
Guoning Chen, Qingqing Deng, Andrzej Szymczak, Rob...
CCS
2008
ACM
13 years 7 months ago
User-controllable learning of security and privacy policies
Studies have shown that users have great difficulty specifying their security and privacy policies in a variety of application domains. While machine learning techniques have succ...
Patrick Gage Kelley, Paul Hankes Drielsma, Norman ...
SSDBM
2005
IEEE
128views Database» more  SSDBM 2005»
13 years 11 months ago
Fuzzy Decomposition of Spatially Extended Objects
Modern database applications including computer-aided design, multimedia information systems, medical imaging, molecular biology, or geographical information systems impose new re...
Hans-Peter Kriegel, Martin Pfeifle
ICRA
2010
IEEE
133views Robotics» more  ICRA 2010»
13 years 4 months ago
Variable resolution decomposition for robotic navigation under a POMDP framework
— Partially Observable Markov Decision Processes (POMDPs) offer a powerful mathematical framework for making optimal action choices in noisy and/or uncertain environments, in par...
Robert Kaplow, Amin Atrash, Joelle Pineau