Name
Abstract | ||
|---|---|---|
. Retrieving multiple cases is supposed to be an adequate retrievalstrategy for guiding partial-order planners because of the recognizedflexibility of these planners to interleave steps in the plans. Casesare combined by merging them. In this paper, we will examine two differentkinds of merging cases in the context of partial-order planning. Wewill see that merging cases can be very difficult if the cases are mergedeagerly. On the other hand, if cases are merged by avoiding redundant... |
Year | DOI | Venue |
|---|---|---|
1997 | 10.1007/3-540-63912-8_96 | ECP |
Keywords | Field | DocType |
case study,partial-order planner,partial order | Computer science,Planner,Theoretical computer science,Artificial intelligence,Merge (version control),Case-based reasoning,Partially ordered set,Manufacturing process,Distributed computing | Conference |
ISBN | Citations | PageRank |
3-540-63912-8 | 5 | 0.45 |
References | Authors | |
18 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hector Muñoz-Avila | 1 | 522 | 44.02 |
| Frank Weberskirch | 2 | 43 | 3.85 |