𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Multiobjective, preference-based search in acyclic OR-graphs

✍ Scribed by Chelsea C. White III; Bradley S. Stewart; Robert L. Carraway

Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
468 KB
Volume
56
Category
Article
ISSN
0377-2217

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Multiobjective Heuristic Search in AND/O
Multiobjective Heuristic Search in AND/OR Graphs
✍ Pallab Dasgupta; P.P. Chakrabarti; S.C. DeSarkar πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 249 KB

The multiobjective search model is a framework for solving multi-criteria optimization problems using heuristic search techniques. In this framework, the different non-commensurate optimization criteria are mapped into distinct dimensions of a vector valued cost structure and partial order search te

The incremental maintenance of a Depth-F
The incremental maintenance of a Depth-First-Search tree in directed acyclic graphs
✍ Paolo G. Franciosa; Giorgio Gambosi; Umberto Nanni πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 748 KB

We propose an incremental algorithm to maintain a DFS-forest in a directed acyclic graph under a sequence of arc insertions in 0( nm) worst case total time, where n is the number of nodes and m is the number of arcs after the insertions. This compares favorably with the time required to recompute DF