Sciweavers

179 search results - page 11 / 36
» An LP-Based Heuristic for Optimal Planning
Sort
View
AIPS
2009
13 years 9 months ago
Ant Search Strategies For Planning Optimization
In this paper a planning framework based on Ant Colony Optimization techniques is presented. It is well known that finding optimal solutions to planning problems is a very hard co...
Marco Baioletti, Alfredo Milani, Valentina Poggion...
EDBT
2012
ACM
247views Database» more  EDBT 2012»
11 years 11 months ago
Heuristics-based query optimisation for SPARQL
Query optimization in RDF Stores is a challenging problem as SPARQL queries typically contain many more joins than equivalent relational plans, and hence lead to a large join orde...
Petros Tsialiamanis, Lefteris Sidirourgos, Irini F...
ICDE
2007
IEEE
113views Database» more  ICDE 2007»
14 years 10 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
ATAL
2000
Springer
14 years 1 months ago
Performance of Coordinating Concurrent Hierarchical Planning Agents Using Summary Information
Abstract. Recent research has provided methods for coordinating the individually formed concurrent hierarchical plans (CHiPs) of a group of agents in a shared environment. A reason...
Bradley J. Clement, Edmund H. Durfee
UAI
2004
13 years 10 months ago
Heuristic Search Value Iteration for POMDPs
We present a novel POMDP planning algorithm called heuristic search value iteration (HSVI). HSVI is an anytime algorithm that returns a policy and a provable bound on its regret w...
Trey Smith, Reid G. Simmons