Search

Search Results

• Adapting a Rapidly-Exploring Random Tree for Automated Planning

  Vidal Alcázar, Manuela Veloso, Daniel Borrajo

  2-9

  2011-07-15

• Position Paper: Dijkstra's Algorithm versus Uniform Cost Search or a Case Against Dijkstra's Algorithm

  Ariel Felner

  47-51

  2011-07-15

• Search-Based Planning with Provable Suboptimality Bounds for Continuous State Spaces

  Juan Gonzalez, Maxim Likhachev

  60-67

  2011-07-15

• State-Set Search

  Bo Pang, Robert Holte

  125-133

  2011-07-15

• A Novel Technique for Compressing Pattern Databases in the Pancake Sorting Problems

  Morteza Keshtkaran, Roohollah Taghizadeh, Koorush Ziarati

  68-75

  2011-07-15

• Automatic Move Pruning in General Single-Player Games

  Neil Burch, Robert Holte

  31-38

  2011-07-15

• All PSPACE-Complete Planning Problems Are Equal but Some Are More Equal than Others

  Christer Backstrom, Peter Jonsson

  10-17

  2011-07-15

• Anytime AND/OR Depth-First Search for Combinatorial Optimization

  Lars Otten, Rina Dechter

  117-124

  2011-07-15

• A Preliminary Evaluation of Machine Learning in Algorithm Selection for Search Problems

  Lars Kotthoff, Ian Gent, Ian Miguel

  84-91

  2011-07-15

• Edge Partitioning in Parallel Structured Duplicate Detection

  Rong Zhou, Tim Schmidt, Eric Hansen, Minh Do, Serdar Uckun

  137-138

  2010-08-25

• A Comparison of Greedy Search Algorithms

  Christopher Wilt, Jordan Thayer, Wheeler Ruml

  129-136

  2010-08-25

• Anytime Heuristic Search: Frameworks and Algorithms

  Jordan Thayer, Wheeler Ruml

  121-128

  2010-08-25

• Computing Equivalent Transformations for Combinatorial Optimization by Branch-and-Bound Search

  Eric Hsu, Sheila McIlraith

  111-112

  2010-08-25

• The Logic of Benchmarking: A Case Against State-of-the-Art Performance

  Wheeler Ruml

  142-143

  2010-08-25

• Cost Based Search Considered Harmful

  William Cushing, J. Benton, Subbarao Kambhampati

  140-141

  2010-08-25

• Potential Search: A New Greedy Anytime Heuristic Search

  Roni Stern, Rami Puzis, Ariel Felner

  119-120

  2010-08-25

• Landmark Heuristics for the Pancake Problem

  Malte Helmert

  109-110

  2010-08-25

• Searching for a k-Clique in Unknown Graphs

  Roni Stern, Meir Kalech, Ariel Felner

  83-89

  2010-08-25

• Real-Time Search in Dynamic Worlds

  David Bond, Niels Widger, Wheeler Ruml, Xiaoxun Sun

  16-22

  2010-08-25

• Finding Acceptable Solutions Faster Using Inadmissible Information

  Jordan Thayer, Wheeler Ruml

  98-99

  2010-08-25

• Objective Functions for Multi-Way Number Partitioning

  Richard Korf

  71-72

  2010-08-25

• Adding Diversity to Classical Heuristic Planning

  Carlos Linares López, Daniel Borrajo

  73-80

  2010-08-25

• Layer-Abstraction for Symbolically Solving General Two-Player Games

  Peter Kissmann, Stefan Edelkamp

  63-70

  2010-08-25

• Portal-Based True-Distance Heuristics for Path Finding

  Meir Goldenberg, Ariel Felner, Nathan Sturtevant, Jonathan Schaeffer

  39-45

  2010-08-25

• Directed Plateau Search for MAX-k-SAT

  Andrew Sutton, Adele Howe, L. Whitley

  90-97

  2010-08-25