| 2008 |
|---|
| 74 | | Richard E. Korf:
Minimizing Disk I/O in Two-Bit Breadth-First Search.
AAAI 2008: 317-324 |
| 73 | EE | Richard E. Korf:
Linear-time disk-based implicit graph search.
J. ACM 55(6): (2008) |
| 2007 |
|---|
| 72 | | P. Alex Dow,
Richard E. Korf:
Best-First Search for Treewidth.
AAAI 2007: 1146-1151 |
| 71 | | Richard E. Korf:
Analyzing the Performance of Pattern Database Heuristics.
AAAI 2007: 1164-1170 |
| 70 | EE | Richard E. Korf,
Ariel Felner:
Recent Progress in Heuristic Search: A Case Study of the Four-Peg Towers of Hanoi Problem.
IJCAI 2007: 2324-2329 |
| 69 | EE | Alex S. Fukunaga,
Richard E. Korf:
Bin Completion Algorithms for Multicontainer Packing, Knapsack, and Covering Problems.
J. Artif. Intell. Res. (JAIR) 28: 393-429 (2007) |
| 68 | EE | Ariel Felner,
Richard E. Korf,
Ram Meshulam,
Robert C. Holte:
Compressed Pattern Databases.
J. Artif. Intell. Res. (JAIR) 30: 213-247 (2007) |
| 2005 |
|---|
| 67 | | Richard E. Korf,
Peter Schultze:
Large-Scale Parallel Breadth-First Search.
AAAI 2005: 1380-1385 |
| 66 | EE | Alex S. Fukunaga,
Richard E. Korf:
Bin-Completion Algorithms for Multicontainer Packing and Covering Problems.
IJCAI 2005: 117-124 |
| 65 | EE | Richard E. Korf,
Weixiong Zhang,
Ignacio Thayer,
Heath Hohwald:
Frontier search.
J. ACM 52(5): 715-748 (2005) |
| 2004 |
|---|
| 64 | | Ariel Felner,
Ram Meshulam,
Robert C. Holte,
Richard E. Korf:
Compressing Pattern Databases.
AAAI 2004: 638-643 |
| 63 | | Richard E. Korf:
Best-First Frontier Search with Delayed Duplicate Detection.
AAAI 2004: 650-657 |
| 62 | | Richard E. Korf:
Optimal Rectangle Packing: New Results.
ICAPS 2004: 142-149 |
| 61 | EE | Ariel Felner,
Richard E. Korf,
Sarit Hanan:
Additive Pattern Database Heuristics.
J. Artif. Intell. Res. (JAIR) 22: 279-318 (2004) |
| 2003 |
|---|
| 60 | | Richard E. Korf:
Optimal Rectangle Packing: Initial Results.
ICAPS 2003: 287-295 |
| 59 | | Heath Hohwald,
Ignacio Thayer,
Richard E. Korf:
Comparing Best-First Search and Dynamic Programming for Optimal Multiple Sequence Alignment.
IJCAI 2003: 1239-1245 |
| 58 | | Richard E. Korf:
An Improved Algorithm for Optimal Bin Packing.
IJCAI 2003: 1252-1258 |
| 57 | | Richard E. Korf:
Delayed Duplicate Detection: Extended Abstract.
IJCAI 2003: 1539-1541 |
| 56 | | Ariel Felner,
Sarit Kraus,
Richard E. Korf:
KBFS: K-Best-First Search.
Ann. Math. Artif. Intell. 39(1-2): 19-39 (2003) |
| 2002 |
|---|
| 55 | | Richard E. Korf:
A New Algorithm for Optimal Bin Packing.
AAAI/IAAI 2002: 731-726 |
| 54 | EE | Richard E. Korf,
Ariel Felner:
Disjoint pattern database heuristics.
Artif. Intell. 134(1-2): 9-22 (2002) |
| 2001 |
|---|
| 53 | EE | Weixiong Zhang,
Rina Dechter,
Richard E. Korf:
Heuristic search in artificial intelligence.
Artif. Intell. 129(1-2): 1-4 (2001) |
| 52 | EE | Richard E. Korf,
Michael Reid,
Stefan Edelkamp:
Time complexity of iterative-deepening-A*.
Artif. Intell. 129(1-2): 199-218 (2001) |
| 2000 |
|---|
| 51 | | Richard E. Korf:
Recent Progress in the Design and Analysis of Admissible Heuristic Functions.
AAAI/IAAI 2000: 1165-1170 |
| 50 | | Nathan R. Sturtevant,
Richard E. Korf:
On Pruning Techniques for Multi-Player Games.
AAAI/IAAI 2000: 201-207 |
| 49 | | Richard E. Korf,
Weixiong Zhang:
Divide-and-Conquer Frontier Search Applied to Optimal Sequence Alignment.
AAAI/IAAI 2000: 910-916 |
| 48 | EE | Richard E. Korf:
Recent Progress in the Design and Analysis of Admissible Heuristic Functions.
SARA 2000: 45-55 |
| 1999 |
|---|
| 47 | | Richard E. Korf:
A Divide and Conquer Bidirectional Search: First Results.
IJCAI 1999: 1184-1191 |
| 1998 |
|---|
| 46 | | Stefan Edelkamp,
Richard E. Korf:
The Branching Factor of Regular Search Spaces.
AAAI/IAAI 1998: 299-304 |
| 45 | | Richard E. Korf,
Michael Reid:
Complexity Analysis of Admissible Heuristic Search.
AAAI/IAAI 1998: 305-310 |
| 44 | EE | Richard E. Korf:
A Complete Anytime Algorithm for Number Partitioning.
Artif. Intell. 106(2): 181-203 (1998) |
| 1997 |
|---|
| 43 | | Richard E. Korf:
Finding Optimal Solutions to Rubik's Cube Using Pattern Databases.
AAAI/IAAI 1997: 700-705 |
| 42 | | Richard E. Korf:
Does Deep Blue use AI?
Deep Blue Versus Kasparov: The Significance for Artificial Intelligence 1997: 1-2 |
| 1996 |
|---|
| 41 | | Richard E. Korf:
Improved Limited Discrepancy Search.
AAAI/IAAI, Vol. 1 1996: 286-291 |
| 40 | | Richard E. Korf,
Larry A. Taylor:
Finding Optimal Solutions to the Twenty-Four Puzzle.
AAAI/IAAI, Vol. 2 1996: 1202-1207 |
| 39 | EE | Weixiong Zhang,
Richard E. Korf:
A Study of Complexity Transitions on the Asymmetric Traveling Salesman Problem.
Artif. Intell. 81(1-2): 223-239 (1996) |
| 38 | EE | Richard E. Korf,
David Maxwell Chickering:
Best-First Minimax Search.
Artif. Intell. 84(1-2): 299-337 (1996) |
| 1995 |
|---|
| 37 | | Richard E. Korf:
From Approximate to Optimal Solutions: A Case Study of Number Partitioning.
IJCAI 1995: 266-272 |
| 36 | | Richard E. Korf:
Space-Efficient Search Algorithms.
ACM Comput. Surv. 27(3): 337-339 (1995) |
| 35 | EE | Weixiong Zhang,
Richard E. Korf:
Performance of Linear-Space Search Algorithms.
Artif. Intell. 79(2): 241-292 (1995) |
| 34 | EE | Toru Ishida,
Richard E. Korf:
Moving-Target Search: A Real-Time Search for Changing Goals.
IEEE Trans. Pattern Anal. Mach. Intell. 17(6): 609-619 (1995) |
| 1994 |
|---|
| 33 | | Richard E. Korf,
David Maxwell Chickering:
Best-First Minimax Search: Othello Results.
AAAI 1994: 1365-1370 |
| 32 | | Joseph C. Pemberton,
Richard E. Korf:
Incremental Search Algorithms for Real-time Decision Making.
AIPS 1994: 140-145 |
| 31 | | Weixiong Zhang,
Richard E. Korf:
Parallel Heap Operations on an EREW PRAM.
J. Parallel Distrib. Comput. 20(2): 248-255 (1994) |
| 1993 |
|---|
| 30 | | Larry A. Taylor,
Richard E. Korf:
Pruning Duplicate Nodes in Depth-First Search.
AAAI 1993: 756-761 |
| 29 | | Weixiong Zhang,
Richard E. Korf:
Depth-First vs. Best-First Search: New Results.
AAAI 1993: 769-775 |
| 28 | | Curt Powley,
Chris Ferguson,
Richard E. Korf:
Depth-First Heuristic Search on a SIMD Machine.
Artif. Intell. 60(2): 199-242 (1993) |
| 27 | | Richard E. Korf:
Linear-Space Best-First Search.
Artif. Intell. 62(1): 41-78 (1993) |
| 26 | EE | Benjamin W. Wah,
Thomas S. Huang,
Aravind K. Joshi,
Dan I. Moldovan,
Yiannis Aloimonos,
Ruzena Bajcsy,
Dana H. Ballard,
Doug DeGroot,
Kenneth DeJong,
Charles R. Dyer,
Scott E. Fahlman,
Ralph Grishman,
Lynette Hirschman,
Richard E. Korf,
Stephen E. Levinson,
Daniel P. Miranker,
N. H. Morgan,
Sergei Nirenburg,
Tomaso Poggio,
Edward M. Riseman,
Craig Stanfil,
Salvatore J. Stolfo,
Steven L. Tanimoto,
Charles C. Weems:
Report on Workshop on High Performance Computing and Communications for Grand Challenge Applications: Computer Vision, Speech and Natural Language Processing, and Artificial Intelligence.
IEEE Trans. Knowl. Data Eng. 5(1): 138-154 (1993) |
| 1992 |
|---|
| 25 | | Richard E. Korf:
Linear-Space Best-First Search: Summary of Results.
AAAI 1992: 533-538 |
| 24 | | Weixiong Zhang,
Richard E. Korf:
An Average-Case Analysis of Branch-and-Bound with Applications: Summary of Results.
AAAI 1992: 545-550 |
| 23 | | Weixiong Zhang,
Richard E. Korf:
Parallel Heap Operations on EREW PRAM: Summary of Results.
IPPS 1992: 315-318 |
| 1991 |
|---|
| 22 | | Nageshwara Rao Vempaty,
Vipin Kumar,
Richard E. Korf:
Depth-First Versus Best-First Search.
AAAI 1991: 434-440 |
| 21 | | Toru Ishida,
Richard E. Korf:
Moving Target Search.
IJCAI 1991: 204-211 |
| 20 | | Richard E. Korf:
Multi-Player Alpha-Beta Pruning.
Artif. Intell. 48(1): 99-111 (1991) |
| 19 | EE | Curt Powley,
Richard E. Korf:
Single-Agent Parallel Window Search.
IEEE Trans. Pattern Anal. Mach. Intell. 13(5): 466-477 (1991) |
| 18 | EE | Richard E. Korf:
Artificial Intelligence as information science.
Inf. Sci. 57-58: 131-134 (1991) |
| 1990 |
|---|
| 17 | | Richard E. Korf:
Real-Time Heuristic Search.
Artif. Intell. 42(2-3): 189-211 (1990) |
| 16 | | Richard E. Korf:
Depth-Limited Search for Real-Time Problem Solving.
Real-Time Systems 2(1-2): 7-24 (1990) |
| 1989 |
|---|
| 15 | | Richard E. Korf:
Generalized Game Trees.
IJCAI 1989: 328-333 |
| 14 | | Curt Powley,
Richard E. Korf:
Single-Agent Parallel Window Search: A Summary of Results.
IJCAI 1989: 36-41 |
| 1988 |
|---|
| 13 | | Chris Ferguson,
Richard E. Korf:
Distributed Tree Search and Its Application to Alpha-Beta Pruning.
AAAI 1988: 128-132 |
| 12 | | Richard E. Korf:
Real-Tme Heuristic Search: New Results.
AAAI 1988: 139-144 |
| 1987 |
|---|
| 11 | | Richard E. Korf:
Real-Time Heuristic Search: First Results.
AAAI 1987: 133-138 |
| 10 | | Bruce Abramson,
Richard E. Korf:
A Model of Two-Player Evaluation Functions.
AAAI 1987: 90-94 |
| 9 | | Richard E. Korf:
Planning as Search: A Quantitative Approach.
Artif. Intell. 33(1): 65-88 (1987) |
| 1986 |
|---|
| 8 | | Jens Christensen,
Richard E. Korf:
A Unified Theory of Heuristic Evaluation Functions and its Application to Learning.
AAAI 1986: 148-152 |
| 1985 |
|---|
| 7 | | Richard E. Korf:
Iterative-Deepening-A*: An Optimal Admissible Tree Search.
IJCAI 1985: 1034-1036 |
| 6 | | Richard E. Korf:
Macro-Operators: A Weak Method for Learning.
Artif. Intell. 26(1): 35-77 (1985) |
| 5 | | Richard E. Korf:
Depth-First Iterative-Deepening: An Optimal Admissible Tree Search.
Artif. Intell. 27(1): 97-109 (1985) |
| 1983 |
|---|
| 4 | | Richard E. Korf:
Operator Decomposability: A New Type of Problem Structure.
AAAI 1983: 206-209 |
| 1982 |
|---|
| 3 | | Richard E. Korf:
A Program That Learns to Solve Rubik's Cube.
AAAI 1982: 164-167 |
| 1981 |
|---|
| 2 | | Richard E. Korf:
Inversion of Applicative Programs.
IJCAI 1981: 1007-1009 |
| 1980 |
|---|
| 1 | | Richard E. Korf:
Toward a Model of Representation Changes.
Artif. Intell. 14(1): 41-78 (1980) |
