A Graph-Partitioning Based Approach for Parallel Best-First Search 1 Yuu Jinnai 1,2 Center for Advanced Intelligence Project

Source URL: icaps17.icaps-conference.org

Parallel Branch and Bound: Applying an Asynchronous Multi-Pool Approach to Cyclic Best First Search Joshua Gluck, Nartezya Dykes Swarthmore College, Spelman College, and The University of Illinois at Urbana-Champaign

Source URL: www.synergylabs.org

Parallel Randomized Best-First Minimax Search 1 Yaron Shoham 2, Sivan Toledo 3 School of Computer Science, Tel-Aviv University Abstract

Source URL: www.top-5000.nl

Challenges in Selecting Paths for Navigational Queries: Trade-Off of Benefit of Path versus Cost of Plan Mar´ıa-Esther Vidal Louiqa Raschid

Source URL: webdb2004.cs.columbia.edu

• Graph theory
• Information science
• Information retrieval
• Search algorithms
• Routing algorithms
• Combinatorial optimization
• Game artificial intelligence
• A* search algorithm
• Query optimization
• Path
• PubMed
• Best-first search

Jasper: the Art of Exploration in Greedy Best First Search Fan Xie and Martin Müller and Robert Holte Computing Science, University of Alberta Edmonton, Canada {fxie2,mmueller,robert.holte}@ualberta.ca

Source URL: webdocs.cs.ualberta.ca

Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence Adding Local Exploration to Greedy Best-First Search in Satisficing Planning Fan Xie and Martin Müller and Robert Holte Computing Science, Uni

Source URL: webdocs.cs.ualberta.ca

Best-First Rippling Moa Johansson, Alan Bundy and Lucas Dixon 1 School of Informatics

Source URL: homepages.inf.ed.ac.uk

• Automated theorem proving
• Mathematics
• Theoretical computer science
• Search algorithms
• Heuristics
• Rippling
• Logic
• IsaPlanner
• Formal languages
• Logic in computer science
• A* search algorithm
• Mathematical proof

Adding Local Exploration to Greedy Best-First Search in Satisficing Planning Fan Xie and Martin Müller and Robert Holte Computing Science, University of Alberta Edmonton, Canada {fxie2,mmueller,rholte}@ualberta.ca

Source URL: webdocs.cs.ualberta.ca

Worst-Case Solution Quality Analysis When Not Re-Expanding Nodes in Best-First Search Richard Valenzano Nathan R. Sturtevant

Source URL: www.cs.du.edu

A Case Study on the Search Topology of Greedy Best-First Search Master Thesis Natural Science Faculty of the University of Basel Department of Mathematics and Computer Science

Source URL: ai.cs.unibas.ch

• Artificial intelligence
• Innovation
• Mathematics
• Heuristic
• Satisficing
• Best-first search
• Goal node
• A* search algorithm
• Heuristics
• Search algorithms
• Heuristic function