Performance measurement and analysis of certain search algorithms.
- Author:
- John Gary Gaschnig
Abstract
No abstract available.
Cited By
- Swan J Harmonic analysis and resynthesis of Sliding-Tile Puzzle heuristics 2017 IEEE Congress on Evolutionary Computation (CEC), (516-524)
- (2019). Subdimensional expansion for multirobot path planning, Artificial Intelligence, 219:C, (1-24), Online publication date: 1-Feb-2015.
- Lelis L, Zilles S and Holte R (2013). Predicting the size of IDA*'s search tree, Artificial Intelligence, 196, (53-76), Online publication date: 1-Mar-2013.
- Alviano M, Dodaro C and Ricca F Comparing Alternative Solutions for Unfounded Set Propagation in ASP Proceeding of the XIIIth International Conference on AI*IA 2013: Advances in Artificial Intelligence - Volume 8249, (1-12)
- Alviano M, Dodaro C, Faber W, Leone N and Ricca F WASP Proceedings of the 12th International Conference on Logic Programming and Nonmonotonic Reasoning - Volume 8148, (54-66)
- Farsiniamarj N and Haarslev V (2010). Practical reasoning with qualified number restrictions: A hybrid Abox calculus for the description logic š¯’®ā„‹š¯’¬, AI Communications, 23:2-3, (205-240), Online publication date: 1-Apr-2010.
- Korf R Artificial intelligence search algorithms Algorithms and theory of computation handbook, (22-22)
- King J and Likhachev M Efficient cost computation in cost map planning for non-circular robots Proceedings of the 2009 IEEE/RSJ international conference on Intelligent robots and systems, (3924-3930)
- Likhachev M, Ferguson D, Gordon G, Stentz A and Thrun S (2008). Anytime search in dynamic graphs, Artificial Intelligence, 172:14, (1613-1643), Online publication date: 1-Sep-2008.
- Likhachev M and Stentz A R* search Proceedings of the 23rd national conference on Artificial intelligence - Volume 1, (344-350)
- Mohamed A, Yusoff M, Mutalib S and Rahman S Modified branch and bound algorithm Proceedings of the 8th Conference on 8th WSEAS International Conference on Evolutionary Computing - Volume 8, (274-279)
- Hansen E and Zhou R (2007). Anytime heuristic search, Journal of Artificial Intelligence Research, 28:1, (267-297), Online publication date: 1-Jan-2007.
- Goldman R, Pelican M and Musliner D Guiding planner backjumping using verifier traces Proceedings of the Fourteenth International Conference on International Conference on Automated Planning and Scheduling, (279-286)
- Felner A, Kraus S and Korf R (2019). KBFS, Annals of Mathematics and Artificial Intelligence, 39:1-2, (19-39), Online publication date: 1-Sep-2003.
- Chiu C, Chou C, Lee J, Leung H and Leung Y (2019). A Constraint-Based Interactive Train Rescheduling Tool, Constraints, 7:2, (167-198), Online publication date: 1-Apr-2002.
- Lynce I and Marques-Silva J The effect of Nogood recording in DPLL-CBJ SAT algorithms Proceedings of the 2002 Joint ERCIM/CologNet international conference on Constraint solving and constraint logic programming, (144-158)
- Liu J, Jing H and Tang Y (2019). Multi-agent oriented constraint satisfaction, Artificial Intelligence, 136:1, (101-144), Online publication date: 15-Feb-2002.
- Cheng B, Choi K, Lee J and Wu J (1999). Increasing Constraint Propagation by Redundant Modeling, Constraints, 4:2, (167-192), Online publication date: 1-May-1999.
- Stergiou K and Walsh T The difference all-difference makes Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1, (414-419)
- Marques-Silva J and Sakallah K (1999). GRASP, IEEE Transactions on Computers, 48:5, (506-521), Online publication date: 1-May-1999.
- Baker A The hazards of fancy backtracking Proceedings of the Twelfth AAAI National Conference on Artificial Intelligence, (288-293)
- Frost D and Dechter R Dead-end driven learning Proceedings of the Twelfth AAAI National Conference on Artificial Intelligence, (294-300)
- Frost D and Dechter R In search of the best constraint satisfaction search Proceedings of the Twelfth AAAI National Conference on Artificial Intelligence, (301-306)
- Pesch E, Drexl A and Kolen A (1994). Modellbasierte Inferenz in CHARME, OR Spectrum, 16:3, (193-202), Online publication date: 1-Sep-1994.
- Gu J, Huang X and Du B (1994). A quantitative solution to Constraint Satisfaction Problem (CSP), New Generation Computing, 13:1, (99-115), Online publication date: 1-Dec-1994.
Kaindl H and Ziegeler H (2019). HIS, ACM SIGWEB Newsletter, 1:1, (1-7), Online publication date: 1-Mar-1992.- Schiex T Possibilistic constraint satisfaction problems or "How to handle soft constraints ?" Proceedings of the Eighth international conference on Uncertainty in artificial intelligence, (268-275)
- Kaindl H, Shams R and Horacek H (2019). Minimax Search Algorithms With and Without Aspiration Windows, IEEE Transactions on Pattern Analysis and Machine Intelligence, 13:12, (1225-1235), Online publication date: 1-Dec-1991.
- Sosic R and Gu J (1991). 3,000,000 Queens in less than one minute, ACM SIGART Bulletin, 2:2, (22-24), Online publication date: 1-Feb-1991.
- Kaindl H and Snaprud M Hypertext and structured object representation Proceedings of the third annual ACM conference on Hypertext, (345-358)
- Sosic R and Gu J (1990). A polynomial time algorithm for the N-Queens problem, ACM SIGART Bulletin, 1:3, (7-11), Online publication date: 1-Oct-1990.
- Sudkamp T and Shanahan R Analysis of heurisitc search models Proceedings of the 15th annual conference on Computer Science, (7-15)
- Abramson B and Yung M Construction through decomposition Proceedings of 1986 ACM Fall joint computer conference, (620-628)
Recommendations
Efficient, high-performance algorithms for N-Best search
HLT '90: Proceedings of the workshop on Speech and Natural LanguageWe present two efficient search algorithms for real-time spoken language systems. The first called the Word-Dependent N-Best algorithm is an improved algorithm for finding the top <i>N</i> sentence hypotheses. The new algorithm is shown to perform as ...
Unidirectional and Bidirectional Search Algorithms
Four classifications of artificial intelligence search techniques are discussed: unidirectional uniprocessor, bidirectional uniprocessor, unidirectional multiprocessor, and bidirectional multiprocessor search techniques. Wave-shaping PBA* (WS-PBA*) and ...