Heuristic Search

Image IDA Clique Diagnosis Computational biology Abstraction Configuration space Heuristic algorithms Communication protocol Model-checking Discretization General game playing Localization, Consistency Breadth-first Search Complexity theory Causal graph Multiplayer game Digital map Game tree search Boolean Satisfiability Locality Automated theorem proving Computability theory Coverage Backtracking Hill climbing Cuckoo hashing Bin packing Map matching Geocoding Markov decision process Local search Genetic algorithm BDD Motion Planning Heap Biological Network Hash table Dijkstra's Algorithm Hash function Pairwise alignment Depth first search Action planning 1-level bucket 2-level bucket additive pattern database Admissible Heuristic agent-centered search alpha-beta pruning AND/OR graph AO* search AND-OR (minimax) search anytime repairing A* admissible pruning beam search backjumping bidirectional front-to-front search approximate search best-first game tree search bidirectional front-to-end search bitstate hashing asymptotic resource consumption bounds consistency bidirectional symbolic breadth-first search Binary Decision Diagram bitvector GPU search bidirectional search biological metabolic pathway biological signal transduction pathway arc consistency beam-stack search Bellman-Ford algorithm assumption-based search bounded pattern database automata encoding backmarking convergence detection and speed-up cost-optimal symbolic breadth-first search conditional plans container pruning compressed pattern database cutting corners derived predicate delayed duplicate detection depth-first branch-and-bound breadth-first heuristic search compact pattern database directed model checking external breadth-first branch-and-bound external enforced hill-climbing external explicit graph depth-first search external pattern databases external value iteration external sorting fast learning and converging search (FALCONS) collapse compression divide-and-conquer breadth-first search frontier search external explicit graph breadth-first search external priority queue external scanning external iterative-deepening search conspiracy search graph partition Graphplan graph transition system goal-directed navigation (in known and unknown terrain) cost algebra consistent heuristic general diagnostic engine Fibonacci heap flash-memory search greedy localization greedy online search depth-slicing divide-and-conquer single-source shortest paths dual pattern database disjoint pattern database edge counting enforced hill-climbing knowledge base anomaly learning real-time A* (LRTA*) LAO* search Evolutionary Search external A* macro problem solving k-best-first search fast h-value updates MAX-k-SAT memory-enhanced test driver limits and possibilities of BDDs minimal lookahead minimax search local search space formula progression fringe search metric planning node counting null window search number partition multi-objective search overconsistent A* parallel best-first search parallel GPU search non-deterministic state space Hirschberg's algorithm on-demand pattern database hierarchical A* parallel external search goal-directed navigation in unknown terrain improved heuristic Independent Set Pairing Heap parallel branch-and-bound greedy mapping incomplete knowledge hash-based duplicate detection hash compaction iterative threshold search local A* incremental hashing incremental heuristic search island search iterative-deepening dynamic programming iterative-deepening search multiple pattern database negmax search nonadmissible pruning Lagrange multiplier parallel IDA* lock-free hashing optimal planning min-max learning real-time A* (min-max LRTA*) parallel depth-first search multiple-goal heuristic search Multiple Sequence Alignment on-line search parallel pattern database