25,161
edits
Changes
no edit summary
'''Richard Earl Korf''',<br/>
an American computer scientist 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]].
In particular, he 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=
* [[Richard Korf]] ('''1997'''). ''Does Deep Blue use AI?'' [[Conferences#AAAI-97|AAAI-97]], Workshop on [[Kasparov versus Deep Blue 1997|Deep Blue vs. Kasparov]] : The Significance for Artificial Intelligence, [http://www.aaai.org/Papers/Workshops/1997/WS-97-04/WS97-04-001.pdf pdf]
* [[Richard Korf]] ('''1997'''). ''Does DEEP BLUE use Artificial Intelligence?'' [[ICGA Journal#20_4|ICCA Journal, Vol. 20, No. 4]] <ref>[https://www.stmintz.com/ccc/index.php?id=14647 Re: ICCA Journal Sinks To A New Low] by [[Amir Ban]], [[CCC]], January 25, 1998</ref>
* [[Stefan Edelkamp]], [[Richard Korf]] ('''1998'''). ''The Branching Factor of Regular Search Spaces''. [[Conferences#AAAI-98|AAAI-98]], [https://pdfs.semanticscholar.org/1a71/184c9432957427399435b8cde7e2d1977955.pdf pdf]
* [[Richard Korf]], [[Michael Reid]] ('''1998'''). ''Complexity Analysis of Admissible Heuristic Search''. [[Conferences#AAAI-98|AAAI-98]], [https://www.aaai.org/Papers/AAAI/1998/AAAI98-043.pdf pdf]
==2000 ...==
* [[Richard Korf]] ('''2000'''). ''Finding Optimal Solution to Rubik’s Cube Using Pattern Databases.'' Games in AI Research (eds. [[Jaap van den Herik]] and [[Hiroyuki Iida]]), [[Maastricht University|Universiteit Maastricht]]
* [[Nathan Sturtevant]], [[Richard Korf]] ('''2000'''). ''On Pruning Techniques for Multi-Player Games.'' [[Conferences#AAAI-2000|AAAI-2000]], [http://webdocs.cs.ualberta.ca/~nathanst/papers/multi_prune.pdf pdf]
* [[Richard Korf]], [[Michael Reid]], [[Stefan Edelkamp]] ('''2001'''). ''Time complexity of iterative-deepening-A*''. [https://en.wikipedia.org/wiki/Artificial_Intelligence_(journal) Artificial Intelligence], Vol. 129, No. 1-2
* [[Richard Korf]], [[Ariel Felner]] ('''2002'''). ''Disjoint Pattern Database Heuristics''. in “Chips Challenging Champions: Games, Computers and Artificial Intelligence”, edited by [[Jonathan Schaeffer]] and [[Jaap van den Herik]]. Elsevier Science
* [[Ariel Felner]], [[Richard Korf]], [[Ram Meshulam]], [[Robert Holte]] ('''2007'''). ''Compressed Pattern Databases''. [https://en.wikipedia.org/wiki/Journal_of_Artificial_Intelligence_Research JAIR], Vol. 30, [http://www.ise.bgu.ac.il/faculty/felner/research/newcompjur.pdf pdf]
