Sciweavers

328 search results - page 19 / 66
» Using Meta-reasoning to Improve the Performance of Case-Base...
Sort
View
AIPS
2004
13 years 9 months ago
A Lookahead Strategy for Heuristic Search Planning
The planning as heuristic search framework, initiated by the planners ASP from Bonet, Loerincs and Geffner, and HSP from Bonet and Geffner, lead to some of the most performant pla...
Vincent Vidal
EWCBR
2008
Springer
13 years 9 months ago
Forgetting Reinforced Cases
To meet time constraints, a CBR system must control the time spent searching in the case base for a solution. In this paper, we presents the results of a case study comparing the p...
Houcine Romdhane, Luc Lamontagne
ICRA
2010
IEEE
142views Robotics» more  ICRA 2010»
13 years 6 months ago
Toward automated tissue retraction in robot-assisted surgery
—Robotic surgical assistants are enhancing physician performance, enabling physicians to perform more delicate and precise minimally invasive surgery. However, these devices are ...
Sachin Patil, Ron Alterovitz
AAAI
1994
13 years 9 months ago
Learning Explanation-Based Search Control Rules for Partial Order Planning
This paper presents snlp+ebl, the first implementation of explanation based learning techniques for a partial order planner. We describe the basic learning framework of snlp+ebl, ...
Suresh Katukam, Subbarao Kambhampati
IJCAI
2003
13 years 9 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