The following pages link to (Q4954178):
Displaying 13 items.
- Domain-independent planning for services in uncertain and dynamic environments (Q286080) (← links)
- State space search nogood learning: online refinement of critical-path dead-end detectors in planning (Q514137) (← links)
- SAT-based planning in complex domains: Concurrency, constraints and nondeterminism (Q814472) (← links)
- Theory and algorithms for plan merging (Q1199918) (← links)
- On the relations between intelligent backtracking and failure-driven explanation-based learning in constraint satisfaction and planning (Q1274559) (← links)
- A unified framework for explanation-based generalization of partially ordered and partially instantiated plans (Q1329370) (← links)
- Planning the project management way: Efficient planning by effective integration of causal and resource reasoning in RealPlan (Q1606337) (← links)
- A graph-based algorithm for the multi-objective optimization of gene regulatory networks (Q1651738) (← links)
- Using genetic programming to learn and improve control knowledge. (Q1852856) (← links)
- A Global Filtration for Satisfying Goals in Mutual Exclusion Networks (Q5302730) (← links)
- Least commitment in Graphplan (Q5958108) (← links)
- Planning graph as the basis for deriving heuristics for plan synthesis by state space and CSP search (Q5958540) (← links)
- Planning as constraint satisfaction: Solving the planning graph by compiling it into CSP (Q5958636) (← links)
