Instruct: Given a paper title, retrieve paper titles that are cited by the given paper.
Query: Anytime Heuristic Search
Heuristic search viewed as path finding in a graph
Heuristic Approaches to Solve Traveling Salesman Problem
Adding local exploration to greedy best-first search in satisficing planning
Adding Heuristics to Conflict-Based Search for Multi-Agent Path Finding.
Adaptive Parallel Iterative Deepening Search
Fast Local Search and Guided Local Search and Their Application to British Telecom's Workforce Scheduling Problem
Design, Evaluation and Analysis of Combinatorial Optimization Heuristic Algorithms
Lexicographic Breadth First search: A survey
OPUS: An Efficient Admissible Algorithm for Unordered Search
Suboptimal variants of the conflict-based search algorithm for the multi-agent pathfinding problem
Constraint-Directed Search: A Case Study of Job-Shop Scheduling
Replicable Parallel Branch and Bound Search
increasing tree search efficiency for constraint satisfaction problems .
The ABDADA distributed minimax search algorithm
the close enough traveling salesman problem : a discussion of several heuristics .
Effective learning hyper-heuristics for the course timetabling problem
A Comparison of Search Strategies for Geometric Branch and Bound Algorithms
Improved Alpha-Beta Pruning of Heuristic Search in Game-Playing Tree
An effective implementation of the linkernighan traveling salesman heuristic
Solving traveling salesman problems via artificial intelligent search techniques
ontolt : a protg plug - in for ontology extraction from text .
Beyond the G-spot: clitourethrovaginal complex anatomy in female orgasm
HYPERBILIRUBINEMIA IN THE NEWBORN
An Introduction to Least Commitment Planning
6D pose estimation using an improved method based on point pair features