Phase transitions of contingent planning problem

DOI10.1155/2013/687578zbMath1299.68034OpenAlexW2169106402WikidataQ59031603 ScholiaQ59031603MaRDI QIDQ474510

Junping Zhou, Minghao Yin, Zhiqiang Ma, Wei-hua Su

Publication date: 24 November 2014

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2013/687578

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial probability (60C05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Task decomposition on abstract states, for planning under nondeterminism
• The TSP phase transition
• PHASE TRANSITIONS OF EXPSPACE-COMPLETE PROBLEMS: A FURTHER STEP
• PHASE TRANSITIONS OF EXPSPACE-COMPLETE PROBLEMS
• Approximating the unsatisfiability threshold of random formulas
• Sharp thresholds of graph properties, and the $k$-sat problem
• Random MAX SAT, random MAX CUT, and their phase transitions
• Analysis of Two Simple Heuristics on a Random Instance ofk-sat
• The complexity of theorem-proving procedures

This page was built for publication: Phase transitions of contingent planning problem