Pages that link to "Item:Q1199918"
From MaRDI portal
The following pages link to Theory and algorithms for plan merging (Q1199918):
Displaying 13 items.
- The multiple sequence sets: Problem and heuristic algorithms (Q411226) (← links)
- On the approximation of longest common nonsupersequences and shortest common nonsubsequences (Q673078) (← links)
- Improved heuristics and a genetic algorithm for finding short supersequences (Q1384223) (← links)
- Approximate planning (Q1855231) (← links)
- A beam search for the shortest common supersequence problem guided by an approximate expected length calculation (Q2163793) (← links)
- The multi-spreader crane scheduling problem: partitions and supersequences (Q2217473) (← links)
- Backdoors to planning (Q2321271) (← links)
- Minimum cost multi-product flow lines (Q2480199) (← links)
- Hybridizations of Metaheuristics With Branch & Bound Derivates (Q2950520) (← links)
- On the approximation of shortest common supersequences and longest common subsequences (Q4632426) (← links)
- Integrating planning and learning: the PRODIGY architecture (Q4834396) (← links)
- Average-case analysis via incompressibility (Q5055919) (← links)
- Finding optimal plans for multiple teams of robots through a mediator: A logic-based approach (Q5398314) (← links)
