Difference between revisions of "Richard Korf"
GerdIsenberg (talk | contribs) |
GerdIsenberg (talk | contribs) |
||
| (5 intermediate revisions by the same user not shown) | |||
| Line 4: | Line 4: | ||
'''Richard Earl Korf''',<br/> | '''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]]. | + | 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, | + | In particular, 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= | =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>[ | + | <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>[[ICGA Journal#RefDB|ICGA Reference Database]]</ref> |
==1984 ...== | ==1984 ...== | ||
| − | * [[Richard Korf]] ('''1984'''). ''The Complexity of Brute Force Search''. Technical Report, Department of Computer Science, [[Columbia University]] <ref>quoted by [[Hans Berliner]] | + | * [[Richard Korf]] ('''1984'''). ''The Complexity of Brute Force Search''. Technical Report, Department of Computer Science, [[Columbia University]] <ref>quoted by [[Hans Berliner]], [[Gordon Goetsch]] ('''1985'''). ''A Study of Search Methods : The Effect of Constraint Satisfaction and Adventurousness''. [https://www.ijcai.org/Proceedings/85-2/Papers/083.pdf pdf]</ref> <ref>Paper is mentioned by [[#JudeaPearl|Richard Korf]] at [[Judea 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'''). ''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. | * [[Richard Korf]] ('''1985'''). ''Learning to solve problems by searching for macro-operators.'' Pitman. | ||
| Line 21: | Line 21: | ||
* [[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] | * [[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]] ('''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]] | + | * [[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]] | * [[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] | * [[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] | ||
| Line 53: | Line 53: | ||
* [https://genealogy.math.ndsu.nodak.edu/id.php?id=70509 Richard Korf - The Mathematics Genealogy Project] | * [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] | * [http://www.cs.cmu.edu/%7Eaiseminar/past/aiseminar97.html#Richard%20Korf Carnegie Mellon UniversityDepartment of Computer Science - AI Seminar 97/98 Schedule] | ||
| − | * Rich Korf at [[Judea Pearl#Symposium|Judea Pearl Symposium]], 2010, [https://en.wikipedia.org/wiki/YouTube YouTube] Video | + | * <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}} | : {{#evu:https://www.youtube.com/watch?v=EnX8cQPiB1M|alignment=left|valignment=top}} | ||
Latest revision as of 17:30, 16 November 2020
Richard Korf [1]
Richard Earl Korf,
an American computer scientist and professor at the University of California, Los Angeles. He received his B.S. from 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 problem-solving, heuristic search, and planning in artificial intelligence [2].
In particular, Richard Korf researched and published on best-first versus depth-first search algorithms, and emphasized depth-first iterative deepening, as in IDA* versus A*.
Contents
Selected Publications
1984 ...
- Richard Korf (1984). The Complexity of Brute Force Search. Technical Report, Department of Computer Science, Columbia University [6] [7]
- Richard Korf (1985). Depth-first Iterative-Deepening: An Optimal Admissible Tree Search. pdf
- Richard Korf (1985). Learning to solve problems by searching for macro-operators. Pitman.
- Richard Korf (1985). Macro-operators: A weak method for learning. Artificial Intelligence, Vol. 26, No. 1
- Jens Christensen, Richard Korf (1986). A Unified Theory of Heuristic Evaluation functions and Its Applications to Learning. AAAI-86, pdf.
- Richard Korf (1987). Planning as Search: A Quantitative Approach. Artificial Intelligence, Vol. 33, pp. 65-88.
- Bruce Abramson, Richard Korf (1987). A Model of Two-Player Evaluation Functions. AAAI-87. pdf
- Chris Ferguson, Richard Korf (1988). Distributed Tree Search and its Application to Alpha-Beta Pruning. AAAI-88, pdf
1990 ...
- Nageshwara Rao Vempaty, Vipin Kumar, Richard Korf (1991). Depth-First vs Best-First Search. AAAI-91, pdf
- Richard Korf (1993). Linear-Space Best-First Search. Artificial Intelligence, Vol. 62, No. 1, pdf
- Richard Korf, Max Chickering (1993). Best-first Minimax Search: First Results. AAAI-93, pdf
- Weixiong Zhang, Richard Korf (1993). Depth-first vs. best-first search: New results. AAAI-93
- Richard Korf, Max Chickering (1994). Best-first minimax search: Othello results. AAAI-94, pdf
- Richard Korf, Max Chickering (1996). Best-first minimax search. Artificial Intelligence, Vol. 84, No 1-2
- Richard Korf (1997). Finding Optimal Solutions to Rubik’s Cube Using Pattern Databases. AAAI-97, pdf
- Richard Korf (1997). Does Deep Blue use AI? AAAI-97, Workshop on Deep Blue vs. Kasparov : The Significance for Artificial Intelligence, pdf
- Richard Korf (1997). Does DEEP BLUE use Artificial Intelligence? ICCA Journal, Vol. 20, No. 4 [8]
- Stefan Edelkamp, Richard Korf (1998). The Branching Factor of Regular Search Spaces. AAAI-98, pdf
- Richard Korf, Michael Reid (1998). Complexity Analysis of Admissible Heuristic Search. AAAI-98, 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), Universiteit Maastricht
- Nathan Sturtevant, Richard Korf (2000). On Pruning Techniques for Multi-Player Games. AAAI-2000, pdf
- Richard Korf, Michael Reid, Stefan Edelkamp (2001). Time complexity of iterative-deepening-A*. 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. JAIR, Vol. 30, pdf
- Richard Korf, Ariel Felner (2007). Recent Progress in Heuristic Search: A Case Study of the Four-Peg Towers of Hanoi Problem. IJCAI-07
- Richard Korf (2008). Minimizing Disk I/O in Two-Bit Breadth-First Search. AAAI-2008, pdf
2010 ...
- Joseph K. Barker, Richard Korf (2011). Solving 4x5 Dots-And-Boxes. AAAI-2011, pdf
- Joseph K. Barker, Richard Korf (2012). Solving Peg Solitaire with Bidirectional BFIDA. AAAI-2012
- Joseph K. Barker, Richard Korf (2012). Solving Dots-And-Boxes. AAAI-2012
- Richard Korf (2012). Research Challenges in Combinatorial Search. AAAI-2012
- Richard Korf (2014). How Do You Know Your Search Algorithm and Code Are Correct? SOCS 2014, pdf
- Richard Korf (2016). Comparing Search Algorithms Using Sorting and Hashing on Disk and in Memory. IJCAI 2016, pdf
External Links
- Richard Korf's Home Page
- Richard E. Korf - Google Scholar Citations
- Richard Korf - The Mathematics Genealogy Project
- Carnegie Mellon UniversityDepartment of Computer Science - AI Seminar 97/98 Schedule
- Rich Korf at Judea Pearl Symposium, 2010, YouTube Video
References
- ↑ UCLA Class Instructor(s)
- ↑ Richard Korf's Home Page
- ↑ dblp: Richard E. Korf
- ↑ R. Korf's Selected Publications
- ↑ ICGA Reference Database
- ↑ quoted by Hans Berliner, Gordon Goetsch (1985). A Study of Search Methods : The Effect of Constraint Satisfaction and Adventurousness. pdf
- ↑ Paper is mentioned by Richard Korf at Judea Pearl Symposium, 2010
- ↑ Re: ICCA Journal Sinks To A New Low by Amir Ban, CCC, January 25, 1998
