Sciweavers

317 search results - page 2 / 64
» Improving Planning Performance Using Low-Conflict Relaxed Pl...
Sort
View
ICCBR
2009
Springer
15 years 5 months ago
Using Meta-reasoning to Improve the Performance of Case-Based Planning
Case-based planning (CBP) systems are based on the idea of reusing past successful plans for solving new problems. Previous research has shown the ability of meta-reasoning approac...
Manish Mehta, Santiago Ontañón, Ashw...
IJCAI
2003
14 years 12 months ago
A lookahead strategy for solving large planning problems
Relaxed plans are used in the heuristic search planner FF for computing a numerical heuristic and extracting helpful actions. We present a novel way for extracting information fro...
Vincent Vidal
ICTAI
2005
IEEE
15 years 4 months ago
Subgoal Ordering and Granularity Control for Incremental Planning
In this paper, we study strategies in incremental planning for ordering and grouping subproblems partitioned by the subgoals of a planning problem when each subproblem is solved b...
Chih-Wei Hsu, Yixin Chen
AI
2011
Springer
14 years 5 months ago
State agnostic planning graphs: deterministic, non-deterministic, and probabilistic planning
Planning graphs have been shown to be a rich source of heuristic information for many kinds of planners. In many cases, planners must compute a planning graph for each element of ...
Daniel Bryce, William Cushing, Subbarao Kambhampat...
SIGMOD
2004
ACM
173views Database» more  SIGMOD 2004»
15 years 10 months ago
Relaxed Currency and Consistency: How to Say "Good Enough" in SQL
Despite the widespread and growing use of asynchronous copies to improve scalability, performance and availability, this practice still lacks a firm semantic foundation. Applicati...
Hongfei Guo, Jonathan Goldstein, Per-Åke Lar...