Sciweavers

270 search results - page 30 / 54
» Exploiting Problem Structure for Solution Counting
Sort
View
AAAI
2012
11 years 10 months ago
Lagrangian Relaxation Techniques for Scalable Spatial Conservation Planning
We address the problem of spatial conservation planning in which the goal is to maximize the expected spread of cascades of an endangered species by strategically purchasing land ...
Akshat Kumar, XiaoJian Wu, Shlomo Zilberstein
UAI
1997
13 years 9 months ago
Correlated Action Effects in Decision Theoretic Regression
Much recent research in decision theoretic planning has adopted Markov decision processes (MDPs) as the model of choice, and has attempted to make their solution more tractable by...
Craig Boutilier
ICRA
2010
IEEE
163views Robotics» more  ICRA 2010»
13 years 6 months ago
Hierarchical optimization on manifolds for online 2D and 3D mapping
Abstract— In this paper, we present a new hierarchical optimization solution to the graph-based simultaneous localization and mapping (SLAM) problem. During online mapping, the a...
Giorgio Grisetti, Rainer Kümmerle, Cyrill Sta...
MICCAI
2007
Springer
14 years 8 months ago
Automatic Fetal Measurements in Ultrasound Using Constrained Probabilistic Boosting Tree
Abstract. Automatic delineation and robust measurement of fetal anatomical structures in 2D ultrasound images is a challenging task due to the complexity of the object appearance, ...
Gustavo Carneiro, Bogdan Georgescu, Sara Good, Dor...
AI
2003
Springer
14 years 29 days ago
A Graph Based Backtracking Algorithm for Solving General CSPs
Many AI tasks can be formalized as constraint satisfaction problems (CSPs), which involve finding values for variables subject to constraints. While solving a CSP is an NP-complet...
Wanlin Pang, Scott D. Goodwin