Iterative state-space reduction for flexible computation

DOI10.1016/S0004-3702(00)00066-7MaRDI QIDQ5940821zbMATH OpenFDO

Authors Weixiong Zhang

Publication date 20 August 2001

Published in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0004-3702(00)00066-7

zbMATH Keywords

Boolean satisfiabilitydepth-first branch-and-boundflexible computationheuristic searchstate-space reductiontraveling Salesman

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• scientific article; zbMATH DE number 1343145
• State space reduction using partial order techniques
• State space reduction of linear processes using control flow reconstruction
• Efficient representation of state spaces for some dynamic models
• Model Checking Software
• scientific article; zbMATH DE number 4179235
• Model reduction by state space projection.

Cites work

• A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation
• A Computing Procedure for Quantification Theory
• An upper bound on the time complexity of iterative-deepening-\(A^*\)
• Approximating probabilistic inference in Bayesian belief networks is NP- hard
• Deliberation scheduling for problem solving in time-constrained environments
• Depth-first iterative-deepening: An optimal admissible tree search
• Epsilon-transformation: exploiting phase transitions to solve combinatorial optimization problems
• scientific article; zbMATH DE number 3898613 (Why is no real title available?)
• scientific article; zbMATH DE number 3908167 (Why is no real title available?)
• scientific article; zbMATH DE number 3989103 (Why is no real title available?)
• scientific article; zbMATH DE number 15993 (Why is no real title available?)
• scientific article; zbMATH DE number 67459 (Why is no real title available?)
• scientific article; zbMATH DE number 67483 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 3793772 (Why is no real title available?)
• scientific article; zbMATH DE number 871931 (Why is no real title available?)
• scientific article; zbMATH DE number 3190745 (Why is no real title available?)
• Optimal composition of real-time systems
• Performance of linear-space search algorithms
• Real-time heuristic search
• Searching for an optimal path in a tree with random costs
• Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman Problem
• The traveling-salesman problem and minimum spanning trees: Part II
• Using branch-and-bound algorithms to obtain suboptimal solutions

This page was built for publication: Iterative state-space reduction for flexible computation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5940821)