scientific article; zbMATH DE number 1448981
From MaRDI portal
Publication:4954178
zbMath0940.68100MaRDI QIDQ4954178
No author found.
Publication date: 18 May 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (13)
A unified framework for explanation-based generalization of partially ordered and partially instantiated plans ⋮ Domain-independent planning for services in uncertain and dynamic environments ⋮ A Global Filtration for Satisfying Goals in Mutual Exclusion Networks ⋮ A graph-based algorithm for the multi-objective optimization of gene regulatory networks ⋮ State space search nogood learning: online refinement of critical-path dead-end detectors in planning ⋮ Theory and algorithms for plan merging ⋮ Least commitment in Graphplan ⋮ Planning graph as the basis for deriving heuristics for plan synthesis by state space and CSP search ⋮ Planning as constraint satisfaction: Solving the planning graph by compiling it into CSP ⋮ On the relations between intelligent backtracking and failure-driven explanation-based learning in constraint satisfaction and planning ⋮ Using genetic programming to learn and improve control knowledge. ⋮ Planning the project management way: Efficient planning by effective integration of causal and resource reasoning in RealPlan ⋮ SAT-based planning in complex domains: Concurrency, constraints and nondeterminism
Uses Software
This page was built for publication:
