Phase transitions of contingent planning problem
From MaRDI portal
(Redirected from Publication:474510)
Recommendations
- A probabilistic analysis of propositional STRIPS planning
- An empirical study of phase transitions in binary constraint satisfaction problems
- Phase transitions of EXPSPACE-complete problems
- Locating the phase transition in binary constraint satisfaction problems
- AI*IA 2003: Advances in Artificial Intelligence
Cites work
- scientific article; zbMATH DE number 1369843 (Why is no real title available?)
- scientific article; zbMATH DE number 1448978 (Why is no real title available?)
- Analysis of Two Simple Heuristics on a Random Instance ofk-sat
- Approximating the unsatisfiability threshold of random formulas
- Phase transitions of EXPSPACE-complete problems
- Phase transitions of EXPSPACE-complete problems: a further step
- Planning graph heuristics for belief space search
- Random MAX SAT, random MAX CUT, and their phase transitions
- Sharp thresholds of graph properties, and the $k$-sat problem
- Task decomposition on abstract states, for planning under nondeterminism
- The TSP phase transition
- The complexity of theorem-proving procedures
- The fast downward planning system
Cited in
(3)
This page was built for publication: Phase transitions of contingent planning problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q474510)
