Sciweavers

213 search results - page 8 / 43
» Heuristics for Planning with Action Costs
Sort
View
ICDE
2007
IEEE
113views Database» more  ICDE 2007»
14 years 8 months ago
Reducing Order Enforcement Cost in Complex Query Plans
Algorithms that exploit sort orders are widely used to implement joins, grouping, duplicate elimination and other set operations. Query optimizers traditionally deal with sort ord...
Ravindra Guravannavar, S. Sudarshan
AAAI
2000
13 years 8 months ago
Towards Feasible Approach to Plan Checking under Probabilistic Uncertainty: Interval Methods
The main problem of planning is to find a sequence of actions that an agent must perform to achieve a given objective. An important part of planning is checking whether a given pl...
Raul Trejo, Vladik Kreinovich, Chitta Baral
AAAI
2006
13 years 9 months ago
Heuristic Search and Information Visualization Methods for School Redistricting
We describe an application of AI search and information visualization techniques to the problem of school redistricting, in which students are assigned to home schools within a co...
Marie desJardins, Blazej Bulka, Ryan Carr, Andrew ...
JAIR
2007
79views more  JAIR 2007»
13 years 7 months ago
Probabilistic Planning via Heuristic Forward Search and Weighted Model Counting
We present a new algorithm for probabilistic planning with no observability. Our algorithm, called Probabilistic-FF, extends the heuristic forward-search machinery of Conformant-F...
Carmel Domshlak, Jörg Hoffmann
AIPS
2006
13 years 9 months ago
Durative Planning in HTNs
This paper provides techniques for hierarchical task network (HTN) planning with durative actions. HTNs can provide useful heuristic guidance to planners, express goals that canno...
Robert P. Goldman