Divide-and-conquer bidirectional search: first results

Authors:
Richard E. Korf
Affiliations:
Computer Science Department, University of California, Los Angeles, Los Angeles, CA
Venue:
IJCAI'99 Proceedings of the 16th international joint conference on Artificial intelligence - Volume 2
Year:
1999

Citing 8
Cited 3

Depth-first iterative-deepening: an optimal admissible tree search

Artificial Intelligence
The multiple sequence alignment problem in biology

SIAM Journal on Applied Mathematics
The C programming language

The C programming language
Space-efficient search algorithms

ACM Computing Surveys (CSUR)
Best-first minimax search

Artificial Intelligence
Stochastic node caching for memory-bounded search

AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Enhanced A algorithms for multiple alignments: optimal alignments for several sequences and k-opt approximate alignments for large cases

Theoretical Computer Science - Special issue: Genome informatics
A linear space algorithm for computing maximal common subsequences

Communications of the ACM

Theory and Practice of Time-Space Trade-Offs in Memory Limited Search

KI '01 Proceedings of the Joint German/Austrian Conference on AI: Advances in Artificial Intelligence
Breadth-first heuristic search

Artificial Intelligence
Out-of-core parallel frontier search with mapreduce

HPCS'09 Proceedings of the 23rd international conference on High Performance Computing Systems and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Domain-specific search engines are becoming increasingly popular because they offer increased accuracy and extra features not possible with general, Web-wide search engines. Unfortunately, they are also difficult and time-consuming to maintain. This ...