Richard E. Korf

According to our database1, Richard E. Korf
  • authored at least 108 papers between 1980 and 2016.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2016
Comparing Search Algorithms Using Sorting and Hashing on Disk and in Memory.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

2015
Limitations of Front-To-End Bidirectional Heuristic Search.
Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

2014
Optimal Rectangle Packing: An Absolute Placement Approach.
CoRR, 2014

The Fifth Annual Symposium on Combinatorial Search.
AI Commun., 2014

How Do You Know Your Search Algorithm and Code Are Correct?
Proceedings of the Seventh Annual Symposium on Combinatorial Search, 2014

Optimal Sequential Multi-Way Number Partitioning.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2014

Cached Iterative Weakening for Optimal Multi-Way Number Partitioning.
Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

2013
Optimal Rectangle Packing: An Absolute Placement Approach.
J. Artif. Intell. Res., 2013

Improved Bin Completion for Optimal Bin Packing and Number Partitioning.
Proceedings of the IJCAI 2013, 2013

Optimally Scheduling Small Numbers of Identical Parallel Machines.
Proceedings of the Twenty-Third International Conference on Automated Planning and Scheduling, 2013

2012
Research Challenges in Combinatorial Search.
Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

Solving Dots-And-Boxes.
Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

Solving Peg Solitaire with Bidirectional BFIDA.
Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

2011
Bin Completion Algorithms for Multicontainer Packing, Knapsack, and Covering Problems
CoRR, 2011

Additive Pattern Database Heuristics
CoRR, 2011

Optimal Packing of High-Precision Rectangles.
Proceedings of the Fourth Annual Symposium on Combinatorial Search, 2011

Complete Algorithms for Cooperative Pathfinding Problems.
Proceedings of the IJCAI 2011, 2011

A Hybrid Recursive Multi-Way Number Partitioning Algorithm.
Proceedings of the IJCAI 2011, 2011

Using Partitions and Superstrings for Lossless Compression of Pattern Databases.
Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, 2011

Optimal Packing of High-Precision Rectangles.
Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, 2011

Solving 4x5 Dots-And-Boxes.
Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, 2011

2010
Optimal rectangle packing.
Annals OR, 2010

Objective Functions for Multi-Way Number Partitioning.
Proceedings of the Third Annual Symposium on Combinatorial Search, 2010

Optimal Rectangle Packing on Non-Square Benchmarks.
Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, 2010

1.6-Bit Pattern Databases.
Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, 2010

Independent Additive Heuristics Reduce Search Multiplicatively.
Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, 2010

2009
Multi-Way Number Partitioning.
Proceedings of the IJCAI 2009, 2009

New Improvements in Optimal Rectangle Packing.
Proceedings of the IJCAI 2009, 2009

Duplicate Avoidance in Depth-First Search with Applications to Treewidth.
Proceedings of the IJCAI 2009, 2009

2008
Linear-time disk-based implicit graph search.
J. ACM, 2008

Best-First Search with Maximum Edge Cost Functions.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2008

Minimizing Disk I/O in Two-Bit Breadth-First Search.
Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, 2008

2007
Bin Completion Algorithms for Multicontainer Packing, Knapsack, and Covering Problems.
J. Artif. Intell. Res., 2007

Compressed Pattern Databases.
J. Artif. Intell. Res., 2007

Recent Progress in Heuristic Search: A Case Study of the Four-Peg Towers of Hanoi Problem.
Proceedings of the IJCAI 2007, 2007

Analyzing the Performance of Pattern Database Heuristics.
Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, 2007

Best-First Search for Treewidth.
Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, 2007

2005
Frontier search.
J. ACM, 2005

Bin-Completion Algorithms for Multicontainer Packing and Covering Problems.
Proceedings of the IJCAI-05, Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, Edinburgh, Scotland, UK, July 30, 2005

Large-Scale Parallel Breadth-First Search.
Proceedings of the Proceedings, 2005

2004
Additive Pattern Database Heuristics.
J. Artif. Intell. Res., 2004

Optimal Rectangle Packing: New Results.
Proceedings of the Fourteenth International Conference on Automated Planning and Scheduling (ICAPS 2004), 2004

Best-First Frontier Search with Delayed Duplicate Detection.
Proceedings of the Nineteenth National Conference on Artificial Intelligence, 2004

Compressing Pattern Databases.
Proceedings of the Nineteenth National Conference on Artificial Intelligence, 2004

2003
KBFS: K-Best-First Search.
Ann. Math. Artif. Intell., 2003

Delayed Duplicate Detection: Extended Abstract.
Proceedings of the IJCAI-03, 2003

An Improved Algorithm for Optimal Bin Packing.
Proceedings of the IJCAI-03, 2003

Comparing Best-First Search and Dynamic Programming for Optimal Multiple Sequence Alignment.
Proceedings of the IJCAI-03, 2003

Optimal Rectangle Packing: Initial Results.
Proceedings of the Thirteenth International Conference on Automated Planning and Scheduling (ICAPS 2003), 2003

2002
Disjoint pattern database heuristics.
Artif. Intell., 2002

A New Algorithm for Optimal Bin Packing.
Proceedings of the Eighteenth National Conference on Artificial Intelligence and Fourteenth Conference on Innovative Applications of Artificial Intelligence, July 28, 2002

2001
Heuristic search in artificial intelligence.
Artif. Intell., 2001

Time complexity of iterative-deepening-A*.
Artif. Intell., 2001

2000
Recent Progress in the Design and Analysis of Admissible Heuristic Functions.
Proceedings of the Abstraction, 2000

On Pruning Techniques for Multi-Player Games.
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on on Innovative Applications of Artificial Intelligence, July 30, 2000

Divide-and-Conquer Frontier Search Applied to Optimal Sequence Alignment.
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on on Innovative Applications of Artificial Intelligence, July 30, 2000

Recent Progress in the Design and Analysis of Admissible Heuristic Functions.
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on on Innovative Applications of Artificial Intelligence, July 30, 2000

1999
A Divide and Conquer Bidirectional Search: First Results.
Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, 1999

1998
A Complete Anytime Algorithm for Number Partitioning.
Artif. Intell., 1998

Complexity Analysis of Admissible Heuristic Search.
Proceedings of the Fifteenth National Conference on Artificial Intelligence and Tenth Innovative Applications of Artificial Intelligence Conference, 1998

The Branching Factor of Regular Search Spaces.
Proceedings of the Fifteenth National Conference on Artificial Intelligence and Tenth Innovative Applications of Artificial Intelligence Conference, 1998

1997
Does Deep Blue use Artificial Intelligence?
ICGA Journal, 1997

Does Deep Blue use AI?
Proceedings of the Deep Blue Versus Kasparov: The Significance for Artificial Intelligence, 1997

Finding Optimal Solutions to Rubik's Cube Using Pattern Databases.
Proceedings of the Fourteenth National Conference on Artificial Intelligence and Ninth Innovative Applications of Artificial Intelligence Conference, 1997

1996
Best-First Minimax Search.
ICGA Journal, 1996

A Study of Complexity Transitions on the Asymmetric Traveling Salesman Problem.
Artif. Intell., 1996

Best-First Minimax Search.
Artif. Intell., 1996

Finding Optimal Solutions to the Twenty-Four Puzzle.
Proceedings of the Thirteenth National Conference on Artificial Intelligence and Eighth Innovative Applications of Artificial Intelligence Conference, 1996

Improved Limited Discrepancy Search.
Proceedings of the Thirteenth National Conference on Artificial Intelligence and Eighth Innovative Applications of Artificial Intelligence Conference, 1996

1995
Moving-Target Search: A Real-Time Search for Changing Goals.
IEEE Trans. Pattern Anal. Mach. Intell., 1995

Heuristic evaluation functions in artificial intelligence search algorithms.
Minds and Machines, 1995

Space-Efficient Search Algorithms.
ACM Comput. Surv., 1995

Performance of Linear-Space Search Algorithms.
Artif. Intell., 1995

From Approximate to Optimal Solutions: A Case Study of Number Partitioning.
Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, 1995

1994
Parallel Heap Operations on an EREW PRAM.
J. Parallel Distrib. Comput., 1994

Incremental Search Algorithms for Real-time Decision Making.
Proceedings of the Second International Conference on Artificial Intelligence Planning Systems, 1994

Best-First Minimax Search: Othello Results.
Proceedings of the 12th National Conference on Artificial Intelligence, Seattle, WA, USA, July 31, 1994

1993
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., 1993

Depth-First Heuristic Search on a SIMD Machine.
Artif. Intell., 1993

Linear-Space Best-First Search.
Artif. Intell., 1993

Depth-First vs. Best-First Search: New Results.
Proceedings of the 11th National Conference on Artificial Intelligence. Washington, 1993

Pruning Duplicate Nodes in Depth-First Search.
Proceedings of the 11th National Conference on Artificial Intelligence. Washington, 1993

1992
Parallel Heap Operations on EREW PRAM: Summary of Results.
Proceedings of the 6th International Parallel Processing Symposium, 1992

An Average-Case Analysis of Branch-and-Bound with Applications: Summary of Results.
Proceedings of the 10th National Conference on Artificial Intelligence, 1992

Linear-Space Best-First Search: Summary of Results.
Proceedings of the 10th National Conference on Artificial Intelligence, 1992

1991
Single-Agent Parallel Window Search.
IEEE Trans. Pattern Anal. Mach. Intell., 1991

Artificial Intelligence as information science.
Inf. Sci., 1991

Multi-Player Alpha-Beta Pruning.
Artif. Intell., 1991

Parallel tree search on a SIMD machine.
Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing, 1991

Moving Target Search.
Proceedings of the 12th International Joint Conference on Artificial Intelligence. Sydney, 1991

Depth-First Versus Best-First Search.
Proceedings of the 9th National Conference on Artificial Intelligence, 1991

1990
Depth-Limited Search for Real-Time Problem Solving.
Real-Time Systems, 1990

Real-Time Heuristic Search.
Artif. Intell., 1990

1989
Single-Agent Parallel Window Search: A Summary of Results.
Proceedings of the 11th International Joint Conference on Artificial Intelligence. Detroit, 1989

Generalized Game Trees.
Proceedings of the 11th International Joint Conference on Artificial Intelligence. Detroit, 1989

1988
Real-Tme Heuristic Search: New Results.
Proceedings of the 7th National Conference on Artificial Intelligence, 1988

Distributed Tree Search and Its Application to Alpha-Beta Pruning.
Proceedings of the 7th National Conference on Artificial Intelligence, 1988

1987
Planning as Search: A Quantitative Approach.
Artif. Intell., 1987

Real-Time Heuristic Search: First Results.
Proceedings of the 6th National Conference on Artificial Intelligence. Seattle, 1987

A Model of Two-Player Evaluation Functions.
Proceedings of the 6th National Conference on Artificial Intelligence. Seattle, 1987

1986
A Unified Theory of Heuristic Evaluation Functions and its Application to Learning.
Proceedings of the 5th National Conference on Artificial Intelligence. Philadelphia, 1986

1985
Macro-Operators: A Weak Method for Learning.
Artif. Intell., 1985

Depth-First Iterative-Deepening: An Optimal Admissible Tree Search.
Artif. Intell., 1985

Iterative-Deepening-A*: An Optimal Admissible Tree Search.
Proceedings of the 9th International Joint Conference on Artificial Intelligence. Los Angeles, 1985

1983
Operator Decomposability: A New Type of Problem Structure.
Proceedings of the National Conference on Artificial Intelligence, 1983

1982
A Program That Learns to Solve Rubik's Cube.
Proceedings of the National Conference on Artificial Intelligence, 1982

1981
Inversion of Applicative Programs.
Proceedings of the 7th International Joint Conference on Artificial Intelligence, 1981

1980
Toward a Model of Representation Changes.
Artif. Intell., 1980


  Loading...