| Year |
Citation |
Score |
| 2015 |
Barker JK, Korf RE. Limitations of front-to-end bidirectional heuristic search Proceedings of the National Conference On Artificial Intelligence. 2: 1086-1092. |
0.735 |
|
| 2014 |
Schreiber EL, Korf RE. Cached iterative weakening for optimal multi-way number partitioning Proceedings of the National Conference On Artificial Intelligence. 4: 2738-2744. |
0.787 |
|
| 2013 |
Huang E, Korf RE. Optimal rectangle packing: An absolute placement approach Journal of Artificial Intelligence Research. 46: 47-87. DOI: 10.1007/S10479-008-0463-6 |
0.469 |
|
| 2013 |
Schreiber EL, Korf RE. Improved bin completion for optimal bin packing and number partitioning Ijcai International Joint Conference On Artificial Intelligence. 651-658. |
0.785 |
|
| 2013 |
Korf RE, Schreiber EL. Optimally scheduling small numbers of identical parallel machines Icaps 2013 - Proceedings of the 23rd International Conference On Automated Planning and Scheduling. 144-152. |
0.767 |
|
| 2012 |
Barker JK, Korf RE. Solving dots-and-boxes Proceedings of the National Conference On Artificial Intelligence. 1: 414-419. |
0.707 |
|
| 2012 |
Korf RE. Research challenges in combinatorial search Proceedings of the National Conference On Artificial Intelligence. 3: 2129-2133. |
0.451 |
|
| 2012 |
Barker JK, Korf RE. Solving peg solitaire with bidirectional BFIDA Proceedings of the National Conference On Artificial Intelligence. 1: 420-426. |
0.704 |
|
| 2011 |
Standley T, Korf R. Complete algorithms for cooperative pathfinding problems Ijcai International Joint Conference On Artificial Intelligence. 668-673. DOI: 10.5591/978-1-57735-516-8/IJCAI11-118 |
0.409 |
|
| 2011 |
Korf RE. A hybrid recursive multi-way number partitioning algorithm Ijcai International Joint Conference On Artificial Intelligence. 591-596. DOI: 10.5591/978-1-57735-516-8/IJCAI11-106 |
0.452 |
|
| 2011 |
Huang E, Korf RE. Optimal packing of high-precision rectangles Proceedings of the 4th Annual Symposium On Combinatorial Search, Socs 2011. 195-196. |
0.419 |
|
| 2011 |
Barker JK, Korf RE. Solving 4x5 dots-and-boxes Proceedings of the National Conference On Artificial Intelligence. 2: 1756-1757. |
0.707 |
|
| 2011 |
Schreiber EL, Korf RE. Using partitions and superstrings for lossless compression of pattern databases Proceedings of the National Conference On Artificial Intelligence. 2: 1814-1815. |
0.759 |
|
| 2010 |
Korf RE. Objective functions for multi-way number partitioning Proceedings of the 3rd Annual Symposium On Combinatorial Search, Socs 2010. 71-72. |
0.374 |
|
| 2010 |
Breyer TM, Korf RE. 1.6-Bit pattern databases Proceedings of the National Conference On Artificial Intelligence. 1: 39-44. |
0.748 |
|
| 2010 |
Huang E, Korf RE. Optimal rectangle packing on non-square benchmarks Proceedings of the National Conference On Artificial Intelligence. 1: 83-88. |
0.378 |
|
| 2010 |
Breyer TM, Korf RE. Independent additive heuristics reduce search multiplicatively Proceedings of the National Conference On Artificial Intelligence. 1: 33-38. |
0.775 |
|
| 2009 |
Huang E, Korf RE. New improvements in optimal rectangle packing Ijcai International Joint Conference On Artificial Intelligence. 511-516. |
0.43 |
|
| 2009 |
Dow PA, Korf RE. Duplicate avoidance in depth-first search with applications to treewidth Ijcai International Joint Conference On Artificial Intelligence. 480-485. |
0.745 |
|
| 2009 |
Korf RE. Multi-way number partitioning Ijcai International Joint Conference On Artificial Intelligence. 538-543. |
0.439 |
|
| 2008 |
Korf RE. Linear-time disk-based implicit graph search Journal of the Acm. 55. DOI: 10.1145/1455248.1455250 |
0.393 |
|
| 2008 |
Korf RE. Minimizing disk I/O in two-bit breadth-first search Proceedings of the National Conference On Artificial Intelligence. 1: 317-324. |
0.478 |
|
| 2008 |
Breyer TM, Korf RE. Recent results from analyzing the performance of heuristic search Aaai Workshop - Technical Report. 24-31. |
0.772 |
|
| 2008 |
Dow PA, Korf RE. Best-first search with a maximum edge cost function 10th International Symposium On Artificial Intelligence and Mathematics, Isaim 2008. 8P. |
0.71 |
|
| 2007 |
Felner A, Korf RE, Meshulam R, Holte R. Compressed pattern databases Journal of Artificial Intelligence Research. 30: 213-247. DOI: 10.1613/Jair.2241 |
0.415 |
|
| 2007 |
Fukunaga AS, Korf RE. Bin completion algorithms for multicontainer packing, knapsack, and covering problems Journal of Artificial Intelligence Research. 28: 393-429. DOI: 10.1613/Jair.2106 |
0.787 |
|
| 2007 |
Korf RE, Felner A. Recent progress in heuristic search: A case study of the four-peg towers of Hanoi problem Ijcai International Joint Conference On Artificial Intelligence. 2324-2329. |
0.338 |
|
| 2007 |
Korf RE. Analyzing the performance of pattern database heuristics Proceedings of the National Conference On Artificial Intelligence. 2: 1164-1170. |
0.383 |
|
| 2007 |
Alex Dow P, Korf RE. Best-first search for treewidth Proceedings of the National Conference On Artificial Intelligence. 2: 1146-1151. |
0.457 |
|
| 2005 |
Korf RE, Zhang W, Thayer I, Hohwald H. Frontier search Journal of the Acm. 52: 715-748. DOI: 10.1145/1089023.1089024 |
0.602 |
|
| 2005 |
Fukunaga AS, Korf RE. Bin-completion algorithms for multicontainer packing and covering problems Ijcai International Joint Conference On Artificial Intelligence. 117-124. |
0.783 |
|
| 2005 |
Korf RE, Schultze P. Large-scale parallel breadth-first search Proceedings of the National Conference On Artificial Intelligence. 3: 1380-1385. |
0.42 |
|
| 2004 |
Feiner A, Korf RE, Hanan S. Additive pattern database heuristics Journal of Artificial Intelligence Research. 22: 279-318. |
0.44 |
|
| 2004 |
Korf RE. Best-first frontier search with delayed duplicate detection Proceedings of the National Conference On Artificial Intelligence. 650-657. |
0.351 |
|
| 2004 |
Feiner A, Meshulam R, Holte RC, Korf RE. Compressing pattern databases Proceedings of the National Conference On Artificial Intelligence. 638-643. |
0.316 |
|
| 2004 |
Korf RE. Optimal rectangle packing: New results Proceedings of the 14th International Conference On Automated Planning and Scheduling, Icaps 2004. 142-149. |
0.417 |
|
| 2003 |
Felner A, Kraus S, Korf RE. KBFS: K-Best-First Search Annals of Mathematics and Artificial Intelligence. 39: 19-39. DOI: 10.1023/A:1024452529781 |
0.408 |
|
| 2003 |
Korf RE. An improved algorithm for optimal bin packing Ijcai International Joint Conference On Artificial Intelligence. 1252-1258. |
0.475 |
|
| 2003 |
Hohwald H, Thayer I, Korf RE. Comparing best-first search and dynamic programming for optimal multiple sequence alignment Ijcai International Joint Conference On Artificial Intelligence. 1239-1245. |
0.317 |
|
| 2002 |
Korf RE, Felner A. Disjoint pattern database heuristics Artificial Intelligence. 134: 9-22. DOI: 10.1016/S0004-3702(01)00092-3 |
0.393 |
|
| 2002 |
Korf RE. A new algorithm for optimal bin packing Proceedings of the National Conference On Artificial Intelligence. 731-736. |
0.422 |
|
| 2001 |
Zhang W, Dechter R, Korf RE. Heuristic search in artificial intelligence Artificial Intelligence. 129: 1-4. DOI: 10.1016/S0004-3702(01)00111-4 |
0.483 |
|
| 2001 |
Korf RE, Reid M, Edelkamp S. Time complexity of iterative-deepening-A* Artificial Intelligence. 129: 199-218. DOI: 10.1016/S0004-3702(01)00094-7 |
0.368 |
|
| 2000 |
Korf RE. Recent progress in the design and analysis of admissible heuristic functions Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science). 1864: 45-55. |
0.385 |
|
| 1999 |
Korf RE. Divide-and-conquer bidirectional search: First results Ijcai International Joint Conference On Artificial Intelligence. 2: 1184-1189. |
0.406 |
|
| 1998 |
Korf RE. A complete anytime algorithm for number partitioning Artificial Intelligence. 106: 181-203. |
0.447 |
|
| 1998 |
Edelkamp S, Korf RE. Branching factor of regular search spaces Proceedings of the National Conference On Artificial Intelligence. 299-304. |
0.437 |
|
| 1998 |
Korf RE, Reid M. Complexity analysis of admissible heuristic search Proceedings of the National Conference On Artificial Intelligence. 305-310. |
0.452 |
|
| 1997 |
Korf RE. Finding optimal solutions to Rubik's cube using pattern databases Proceedings of the National Conference On Artificial Intelligence. 700-705. |
0.358 |
|
| 1996 |
Korf RE. Improved limited discrepancy search Proceedings of the National Conference On Artificial Intelligence. 1: 286-291. |
0.347 |
|
| 1996 |
Korf RE, Taylor LA. Finding optimal solutions to the Twenty-Four Puzzle Proceedings of the National Conference On Artificial Intelligence. 2: 1202-1207. |
0.377 |
|
| 1995 |
Ishida T, Korf RE. Moving-Target Search: A Real-Time Search for Changing Goals Ieee Transactions On Pattern Analysis and Machine Intelligence. 17: 609-619. DOI: 10.1109/34.387507 |
0.385 |
|
| 1995 |
Zhang W, Korf RE. Performance of linear-space search algorithms Artificial Intelligence. 79: 241-292. DOI: 10.1016/0004-3702(94)00047-6 |
0.518 |
|
| 1995 |
Korf RE. Heuristic evaluation functions in artificial intelligence search algorithms Minds and Machines. 5: 489-498. DOI: 10.1007/BF00974979 |
0.446 |
|
| 1994 |
Korf RE, Chickering DM. Best-first minimax search: Othello results Proceedings of the National Conference On Artificial Intelligence. 2: 1365-1370. |
0.321 |
|
| 1993 |
Korf RE. Linear-space best-first search Artificial Intelligence. 62: 41-78. DOI: 10.1016/0004-3702(93)90045-D |
0.371 |
|
| 1993 |
Powley C, Ferguson C, Korf RE. Depth-first heuristic search on a SIMD machine Artificial Intelligence. 60: 199-242. DOI: 10.1016/0004-3702(93)90002-S |
0.31 |
|
| 1993 |
Taylor LA, Korf RE. Pruning duplicate nodes in depth-first search Proceedings of the National Conference On Artificial Intelligence. 756-761. |
0.37 |
|
| 1993 |
Zhang W, Korf RE. Depth-first vs. best-first search: new results Proceedings of the National Conference On Artificial Intelligence. 769-775. |
0.407 |
|
| 1992 |
Pemberton JC, Korf RE. Incremental path planning on graphs with cycles . 179-188. |
0.429 |
|
| 1992 |
Korf RE. Linear-space best-first search: summary of results Proceedings Tenth National Conference On Artificial Intelligence. 533-538. |
0.323 |
|
| 1991 |
Powley C, Korf RE. Single-Agent Parallel Window Search Ieee Transactions On Pattern Analysis and Machine Intelligence. 13: 466-477. DOI: 10.1109/34.134045 |
0.351 |
|
| 1990 |
Korf RE. Real-time heuristic search Artificial Intelligence. 42: 189-211. DOI: 10.1016/0004-3702(90)90054-4 |
0.448 |
|
| 1990 |
Korf RE. Depth-limited search for real-time problem solving Real-Time Systems. 2: 7-24. DOI: 10.1007/BF01840464 |
0.38 |
|
| 1987 |
Korf RE. Planning as search: A quantitative approach Artificial Intelligence. 33: 65-88. DOI: 10.1016/0004-3702(87)90051-8 |
0.313 |
|
| 1985 |
Korf RE. Depth-first iterative-deepening. An optimal admissible tree search Artificial Intelligence. 27: 97-109. DOI: 10.1016/0004-3702(85)90084-0 |
0.41 |
|
| Show low-probability matches. |