Heuristics: intelligent search strategies for computer problem solving
Heuristics: intelligent search strategies for computer problem solving
Principles of artificial intelligence
Principles of artificial intelligence
Increasing search efficiency using multiple heuristics
Information Processing Letters
SIAM Journal on Computing
An efficient algorithm for searching implicit AND/OR graphs with cycles
Artificial Intelligence
Optimizing decision trees through heuristically guided search
Communications of the ACM
LAO: a heuristic search algorithm that finds solutions with loops
Artificial Intelligence - Special issue on heuristic search in artificial intelligence
Decomposable negation normal form
Journal of the ACM (JACM)
Introduction to Algorithms
An efficient algorithm for finding the M most probable configurationsin probabilistic expert systems
Statistics and Computing
Finding the k Smallest Spanning Trees
SWAT '90 Proceedings of the 2nd Scandinavian Workshop on Algorithm Theory
VLSI floorplan generation and area optimization using AND-OR graph search
VLSID '95 Proceedings of the 8th International Conference on VLSI Design
Routing algorithms for dynamic, intelligent transportation networks
Routing algorithms for dynamic, intelligent transportation networks
Algorithm Design
Composite Templates for Cloth Modeling and Sketching
CVPR '06 Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1
AND/OR search spaces for graphical models
Artificial Intelligence
Best-First AND/OR Search for 0/1 Integer Programming
CPAIOR '07 Proceedings of the 4th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
AND/OR Multi-valued Decision Diagrams for Constraint Networks
Concurrency, Graphs and Models
Approximate Solution Sampling (and Counting) on AND/OR Spaces
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
An Incremental Graph-based Approach to Automatic Service Composition
SCC '08 Proceedings of the 2008 IEEE International Conference on Services Computing - Volume 1
Automatic Service Composition Based on Enhanced Service Dependency Graph
ICWS '08 Proceedings of the 2008 IEEE International Conference on Web Services
AND/OR Tree Search Algorithm in Web Service Composition
PACIIA '08 Proceedings of the 2008 IEEE Pacific-Asia Workshop on Computational Intelligence and Industrial Application - Volume 02
Automatic Service Composition Using AND/OR Graph
CECANDEEE '08 Proceedings of the 2008 10th IEEE Conference on E-Commerce Technology and the Fifth IEEE Conference on Enterprise Computing, E-Commerce and E-Services
Weighted A∗ search -- unifying view and application
Artificial Intelligence
Memory intensive branch-and-bound search for graphical models
AAAI'06 proceedings of the 21st national conference on Artificial intelligence - Volume 2
DNNF-based belief state estimation
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
AND/OR Branch-and-Bound search for combinatorial optimization in graphical models
Artificial Intelligence
Memory intensive AND/OR search for combinatorial optimization in graphical models
Artificial Intelligence
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 3
Best-first AND/OR search for graphical models
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
Journal of Artificial Intelligence Research
AND/OR multi-valued decision diagrams (AOMDDs) for graphical models
Journal of Artificial Intelligence Research
Compiling knowledge into decomposable negation normal form
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
IJCAI'73 Proceedings of the 3rd international joint conference on Artificial intelligence
Service Data Correlation Modeling and Its Application in Data-Driven Service Composition
IEEE Transactions on Services Computing
A Sophisticated Approach to Composing Services Based on Action Dominance Relation
APSCC '10 Proceedings of the 2010 IEEE Asia-Pacific Services Computing Conference
Bucket and mini-bucket schemes for m best solutions over graphical models
GKR'11 Proceedings of the Second international conference on Graph Structures for Knowledge Representation and Reasoning
Algorithms for generating ordered solutions for explicit AND/OR structures: extended abstract
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Hi-index | 0.00 |
We present algorithms for generating alternative solutions for explicit acyclic AND/OR structures in non-decreasing order of cost. The proposed algorithms use a best first search technique and report the solutions using an implicit representation ordered by cost. In this paper, we present two versions of the search algorithm - (a) an initial version of the best first search algorithm, ASG, which may present one solution more than once while generating the ordered solutions, and (b) another version, LASG, which avoids the construction of the duplicate solutions. The actual solutions can be reconstructed quickly from the implicit compact representation used. We have applied the methods on a few test domains, some of them are synthetic while the others are based on well known problems including the search space of the 5-peg Tower of Hanoi problem, the matrix-chain multiplication problem and the problem of finding secondary structure of RNA. Experimental results show the efficacy of the proposed algorithms over the existing approach. Our proposed algorithms have potential use in various domains ranging from knowledge based frameworks to service composition, where the AND/OR structure is widely used for representing problems.