Pages that link to "Item:Q1199914"
From MaRDI portal
The following pages link to On the complexity of blocks-world planning (Q1199914):
Displaying 24 items.
- Loading, unloading and premarshalling of stacks in storage areas: survey and classification (Q297241) (← links)
- Container relocation problem with time windows for container departure (Q323023) (← links)
- History-dependent scheduling: models and algorithms for scheduling with general precedence and sequence dependence (Q342093) (← links)
- On the abstraction method for the container relocation problem (Q342301) (← links)
- A biased random-key genetic algorithm for the container pre-marshalling problem (Q342512) (← links)
- A mathematical formulation and complexity considerations for the blocks relocation problem (Q439616) (← links)
- Complexity results for standard benchmark domains in planning (Q814425) (← links)
- On the computational complexity of temporal projection, planning, and plan validation (Q1321058) (← links)
- An exact algorithm for the unrestricted block relocation problem (Q1652624) (← links)
- Solving real-world sized container pre-marshalling problems with an iterative deepening branch-and-bound algorithm (Q1694329) (← links)
- On SAT instance classes and a method for reliable performance experiments with SAT solvers (Q1777389) (← links)
- Complexity, decidability and undecidability results for domain-independent planning (Q1855230) (← links)
- Using temporal logics to express search control knowledge for planning (Q1978242) (← links)
- On distinguishing sets of structures by first-order sentences of minimal quantifier rank (Q2333677) (← links)
- A complete parameterized complexity analysis of bounded planning (Q2353405) (← links)
- A new mixed integer program and extended look-ahead heuristic algorithm for the block relocation problem (Q2356214) (← links)
- A multi-heuristic approach for solving the pre-marshalling problem (Q2358177) (← links)
- Model-lite planning: case-based vs. model-based approaches (Q2407874) (← links)
- On the nature and role of modal truth criteria in planning (Q2674199) (← links)
- MULTI-AGENT COOPERATION VIA REASONING ABOUT THE BEHAVIOR OF OTHERS (Q3224342) (← links)
- Blocks World revisited (Q5940781) (← links)
- Ofelimos: combinatorial optimization via proof-of-useful-work. A provably secure blockchain protocol (Q6104339) (← links)
- Hybrid planning for challenging construction problems: an answer set programming approach (Q6161492) (← links)
- On the complexity of the storyplan problem (Q6172205) (← links)
