Problem Solving by Search
作者： Crina Grosan , Ajith Abraham
DOI: 10.1007/978-3-642-21004-4_2
关键词: Computer science 、 Guided Local Search 、 Linear search problem 、 Action (philosophy) 、 Computational problem 、 Goal node 、 Incremental heuristic search 、 Mathematical optimization 、 Sequence 、 Counting problem
摘要: An important aspect of intelligence is goal-based problem solving. Several problems can be formulated as finding a sequence actions that lead to desirable goal. Each action changes the state and aim find states from initial final (goal) state.
springer.com
sci-hub.st 参考文章(44)
Richard E. Korf, Iterative-deepening-A: an optimal admissible tree search international joint conference on artificial intelligence. pp. 1034- 1036 ,(1985)
Stuart Russell, Efficient memory-bounded search methods european conference on artificial intelligence. pp. 1- 5 ,(1992)
Stuart J. Russell, Tree-structured bias national conference on artificial intelligence. pp. 641- 645 ,(1988)
Richard E. Korf, Nageshwara Rao Vempaty, Vipin Kumar, Depth-first vs best-first search national conference on artificial intelligence. pp. 434- 440 ,(1991)
Ira Pohl, The avoidance of (relative) catastrophe, heuristic competence, genuine dynamic weighting and computational issues in heuristic problem solving international joint conference on artificial intelligence. pp. 12- 17 ,(1973)
Richard E. Korf, Optimal Path-Finding Algorithms Search in Artificial Intelligence. pp. 223- 267 ,(1988) , 10.1007/978-1-4613-8788-6_7
John H. Holland, Adaptation in natural and artificial systems ,(1992)
John R. Koza, Genetic Programming II: Automatic Discovery of Reusable Programs ,(1994)
Stuart Russell, Eric H. Wefald, Do the Right Thing The MIT Press. ,(2003) , 10.7551/MITPRESS/2474.001.0001
Eugen Netto, Lehrbuch der Combinatorik ,(1958)