Three approaches to heuristic search in networks
Journal of the ACM (JACM)
Principles of artificial intelligence
Principles of artificial intelligence
Search Algorithms Under Different Kinds of Heuristics—A Comparative Study
Journal of the ACM (JACM)
Optimizing decision trees through heuristically guided search
Communications of the ACM
Fundamentals of Computer Alori
Fundamentals of Computer Alori
Problem-Solving Methods in Artificial Intelligence
Problem-Solving Methods in Artificial Intelligence
Three approaches to heuristic search in networks
Journal of the ACM (JACM)
Best first search in and/or graphs
CSC '88 Proceedings of the 1988 ACM sixteenth annual conference on Computer science
Heuristic search in networks with modifiable estimate
CSC '87 Proceedings of the 15th annual conference on Computer Science
Search Heuristics for Box Decomposition Methods
Journal of Global Optimization
Using differential techniques to efficiently support transaction time
The VLDB Journal — The International Journal on Very Large Data Bases
Sequential Decision Models for Expert System Optimization
IEEE Transactions on Knowledge and Data Engineering
Distributed and Reactive Query Planning in R-MAGIC: An Agent-Based Multimedia Retrieval System
IEEE Transactions on Knowledge and Data Engineering
Strong planning under partial observability
Artificial Intelligence
RP '09 Proceedings of the 3rd International Workshop on Reachability Problems
Strong planning under partial observability
Artificial Intelligence
Language-Emptiness Checking of Alternating Tree Automata Using Symbolic Reachability Analysis
Electronic Notes in Theoretical Computer Science (ENTCS)
An O(n2) time algorithm for alternating Büchi games
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Survey on assembly sequencing: a combinatorial and geometrical perspective
Journal of Intelligent Manufacturing
| Hi-index | 0.01 |
Two new marking algorithms for AND/OR graphs called CF and CS are presented. For admissible heuristics CS is not needed, and CF is shown to be preferable to the marking algorithms of Martelli and Montanari. When the heuristic is not admissible, the analysis is carried out with the help of the notion of the first and second discriminants of an AND/OR graph. It is proved that in this case CF can be followed by CS to get optimal solutions, provided the sumcost criterion is used and the first discriminant equals the second. Estimates of time and storage requirements are given. Other cost measures, such as maxcost, are also considered, and a number of interesting open problems are enumerated.