25,161
edits
Changes
no edit summary
'''Richard Earl Korf''',<br/>
an American computer scientist and professor at the [https://en.wikipedia.org/wiki/University_of_California,_Los_Angeles University of California, Los Angeles]. He received his B.S. from [[Massachusetts Institute of Technology|MIT]] in 1977, and his M.S. and Ph.D. from [[Carnegie Mellon University]] in 1980 and 1983. His research is in the areas of [https://en.wikipedia.org/wiki/Problem_solving problem-solving], heuristic [[Search|search]], and [[Planning|planning]] in [[Artificial Intelligence|artificial intelligence]]<ref>[http://www.cs.ucla.edu/%7Ekorf/ Richard Korf's Home Page]</ref>. In particular, he Richard Korf researched and published on [[Best-First|best-first]] versus [[Depth-First|depth-first]] search algorithms, and emphasized depth-first [[Iterative Deepening|iterative deepening]], as in [https://en.wikipedia.org/wiki/Iterative_deepening_A* IDA*] versus [https://en.wikipedia.org/wiki/A*_search_algorithm A*].
=Selected Publications=
<ref>[https://dblp.uni-trier.de/pers/hd/k/Korf:Richard_E= dblp: Richard E. Korf]</ref> <ref>[http://web.cs.ucla.edu/~korf/publications.html R. Korf's Selected Publications]</ref> <ref>[http://ilk.uvt.nl/icga/journal/docs/References.pdf [ICGA Journal#RefDB|ICGA Reference Database] (pdf)]</ref>
==1984 ...==
* [[Richard Korf]] ('''1984'''). ''The Complexity of Brute Force Search''. Technical Report, Department of Computer Science, [[Columbia University]] <ref>quoted by [[Hans Berliner]] and , [[Gordon Goetsch]] ('''1985'''). ''A Study of Search Methods : The Effect of Constraint Satisfaction and Adventurousness''. [httphttps://dliwww.iiitijcai.ac.inorg/ijcaiProceedings/IJCAI-85-VOL22/PDFPapers/083.pdf pdf], </ref> <ref>Paper is mentioned by [[#JudeaPearl|Richard Korf]] at [[http://dli.iiit.ac.in/ijcai/IJCAI-85-VOL2/PDF/083.pdf pdfJudea Pearl#Symposium|Judea Pearl Symposium]], 2010</ref>
* [[Richard Korf]] ('''1985'''). ''Depth-first Iterative-Deepening: An Optimal Admissible Tree Search''. [http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.91.288&rep=rep1&type=pdf pdf]
* [[Richard Korf]] ('''1985'''). ''Learning to solve problems by searching for macro-operators.'' Pitman.
* [[Nageshwara Rao Vempaty]], [[Vipin Kumar]], [[Richard Korf]] ('''1991'''). ''Depth-First vs Best-First Search''. [[Conferences#AAAI-91|AAAI-91]], [https://www.aaai.org/Papers/AAAI/1991/AAAI91-067.pdf pdf]
* [[Richard Korf]] ('''1993'''). ''Linear-Space Best-First Search.'' [https://en.wikipedia.org/wiki/Artificial_Intelligence_%28journal%29 Artificial Intelligence], Vol. 62, No. 1, [http://www.aaai.org/Papers/AAAI/1992/AAAI92-082.pdf pdf]
* [[Richard Korf]], [[Max Chickering]] ('''1993'''). ''[http://www.aaai.org/Library/Symposia/Fall/1993/fs93-02-006.php Best-first Minimax Search: First Results].'' [[Conferences#AAAI-93|AAAI-93]], [https://pdfs.semanticscholar.org/4458/6f00b101bda8697bfec740d4c631867979f6.pdf pdf]
* [[Mathematician#WZhang|Weixiong Zhang]], [[Richard Korf]] ('''1993'''). ''[http://dl.acm.org/citation.cfm?id=1867385 Depth-first vs. best-first search: New results]''. [[Conferences#AAAI-93|AAAI-93]]
* [[Richard Korf]], [[Max Chickering]] ('''1994'''). ''[http://www.aaai.org/Library/AAAI/1994/aaai94-210.php Best-first minimax search: Othello results].'' [[Conferences#AAAI-94|AAAI-94]], [http://www.aaai.org/Papers/AAAI/1994/AAAI94-210.pdf pdf]
* [https://genealogy.math.ndsu.nodak.edu/id.php?id=70509 Richard Korf - The Mathematics Genealogy Project]
* [http://www.cs.cmu.edu/%7Eaiseminar/past/aiseminar97.html#Richard%20Korf Carnegie Mellon UniversityDepartment of Computer Science - AI Seminar 97/98 Schedule]
* <span id="JudeaPearl"></span>Rich Korf at [[Judea Pearl#Symposium|Judea Pearl Symposium]], 2010, [https://en.wikipedia.org/wiki/YouTube YouTube] Video
: {{#evu:https://www.youtube.com/watch?v=EnX8cQPiB1M|alignment=left|valignment=top}}
