Sciweavers

914 search results - page 77 / 183
» The Computational Complexity of Probabilistic Planning
Sort
View
AAAI
2010
14 years 7 days ago
Search-Based Path Planning with Homotopy Class Constraints
Goal-directed path planning is one of the basic and widely studied problems in the field of mobile robotics. Homotopy classes of trajectories, arising due to the presence of obsta...
Subhrajit Bhattacharya
ML
2002
ACM
143views Machine Learning» more  ML 2002»
13 years 10 months ago
A Sparse Sampling Algorithm for Near-Optimal Planning in Large Markov Decision Processes
An issue that is critical for the application of Markov decision processes MDPs to realistic problems is how the complexity of planning scales with the size of the MDP. In stochas...
Michael J. Kearns, Yishay Mansour, Andrew Y. Ng
CNSM
2010
13 years 5 months ago
Capacity planning and power management to exploit sustainable energy
This paper describes an approach for designing a power management plan that matches the supply of power with the demand for power in data centers. Power may come from the grid, fro...
Daniel Gmach, Jerry Rolia, Cullen Bash, Yuan Chen,...
SAC
2005
ACM
14 years 4 months ago
A complex biological database querying method
Many biological information systems rely on relational database management systems (RDBMS) to manage high-throughput biological data. While keeping these data well archived, organ...
Jake Yue Chen, John V. Carlis, Ning Gao
DAGSTUHL
2010
14 years 7 days ago
Model-Based Visualization for Intervention Planning
Computer support for intervention planning is a two-stage process: In a first stage, the relevant segmentation target structures are identified and delineated. In a second stage, ...
Bernhard Preim