Pruning duplicate nodes in depth-first search

Proceedings of the National Conference on Artificial Intelligence

Volumn , Issue , 1993, Pages 756-761

  Taylor, Larry A ^a   Korf, Richard E ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; AUTOMATA THEORY; COMPUTATIONAL COMPLEXITY; DATA STORAGE EQUIPMENT; GRAPH THEORY; ONLINE SEARCHING; POLYNOMIALS; RANDOM PROCESSES; STATE SPACE METHODS;

ASYMPTOTIC TIME COMPLEXITY; BEST FIRST SEARCH; DEPTH FIRST SEARCH; EXPONENTIAL COMPLEXITY; EXPONENTIAL MEMORY; FINITE STATE MACHINE; GRID SEARCH SPACE; PRUNING DUPLICATE NODE;

ARTIFICIAL INTELLIGENCE;

EID: 0027708552     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (0)