The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for phrase Iterative-Deepening-A* (changed automatically) with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1985-2014 (13)
Publication types (Num. hits)
article(7) inproceedings(6)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 6 occurrences of 6 keywords

Results
Found 13 publication records. Showing 13 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
54Curt Powley, Richard E. Korf Single-Agent Parallel Window Search. Search on Bibsonomy IEEE Trans. Pattern Anal. Mach. Intell. The full citation details ... 1991 DBLP  DOI  BibTeX  RDF parallel window search, single-agent problems, Iterative-Deepening-A*, node ordering, parallel algorithms, computational complexity, optimisation, iterative methods, time complexity, search problems
28Carlos Mencía, María R. Sierra, Ramiro Varela Intensified iterative deepening A* with application to job shop scheduling. Search on Bibsonomy J. Intell. Manuf. The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
28David C. Uthus, Patricia J. Riddle, Hans W. Guesgen Solving the Traveling Tournament Problem with Iterative-Deepening A. Search on Bibsonomy ICAPS The full citation details ... 2013 DBLP  BibTeX  RDF
28David C. Uthus, Patricia J. Riddle, Hans W. Guesgen Solving the traveling tournament problem with iterative-deepening A∗. Search on Bibsonomy J. Sched. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
28Wenbin Zhu, Hu Qin, Andrew Lim 0001, Huidong Zhang Iterative Deepening A* Algorithms for the Container Relocation Problem. Search on Bibsonomy IEEE Trans Autom. Sci. Eng. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
28Levi Lelis, Sandra Zilles, Robert C. Holte Time Complexity of Iterative-Deepening A*: The Informativeness Pathology (Abstract). Search on Bibsonomy AAAI The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
28Richard E. Korf, Michael Reid, Stefan Edelkamp Time complexity of iterative-deepening-A*. Search on Bibsonomy Artif. Intell. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
28Roland Olsson 0001 Execution of Logic Programs by Iterative Deepening A* SLD-Tree Search. Search on Bibsonomy BIT The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
28Brian G. Patrick, Mohammed Almulla, Monroe M. Newborn An Upper Bound on the Time Complexity of Iterative-Deepening-A. Search on Bibsonomy Ann. Math. Artif. Intell. The full citation details ... 1992 DBLP  DOI  BibTeX  RDF
28V. Nageshwara Rao, Vipin Kumar 0001, K. Ramesh 0001 A Parallel Implementation of Iterative-Deepening-A*. Search on Bibsonomy AAAI The full citation details ... 1987 DBLP  BibTeX  RDF
28Richard E. Korf Iterative-Deepening-A*: An Optimal Admissible Tree Search. Search on Bibsonomy IJCAI The full citation details ... 1985 DBLP  BibTeX  RDF
18Peter Yap Grid-Based Path-Finding. Search on Bibsonomy AI The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
18Curt Powley, Chris Ferguson, Richard E. Korf Parallel tree search on a SIMD machine. Search on Bibsonomy SPDP The full citation details ... 1991 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #13 of 13 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license