메뉴 건너뛰기




Volumn 4612 LNAI, Issue , 2007, Pages 20-34

Partial pattern databases

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; DATA STORAGE EQUIPMENT; HEURISTIC METHODS; SEARCH ENGINES;

EID: 34548101751     PISSN: 03029743     EISSN: 16113349     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-73580-9_5     Document Type: Conference Paper
Times cited : (24)

References (18)
  • 1
    • 0043247547 scopus 로고
    • Efficiently searching the 15-puzzle
    • 94-08, Department of Computing Science, University of Alberta
    • Culberson, J.C., Schaeffer, J.: Efficiently searching the 15-puzzle. Technical Report TR 94-08, Department of Computing Science, University of Alberta (1994)
    • (1994) Technical Report TR
    • Culberson, J.C.1    Schaeffer, J.2
  • 5
    • 26944455119 scopus 로고    scopus 로고
    • Feiner, A., Adler, A.: Solving the 24 puzzle with instance dependent pattern data-bases. In: Zucker, J.-D., Saitta, L. (eds.) SARA 2005. LNCS (LNAI), 3607, pp. 248-260. Springer, Heidelberg (2005)
    • Feiner, A., Adler, A.: Solving the 24 puzzle with instance dependent pattern data-bases. In: Zucker, J.-D., Saitta, L. (eds.) SARA 2005. LNCS (LNAI), vol. 3607, pp. 248-260. Springer, Heidelberg (2005)
  • 7
    • 34548092091 scopus 로고    scopus 로고
    • Ariel Feiner and Nir Ofek. Combining perimeter search and pattern database abstractions. In: Symposium on Abstraction Reformulation and Approximation (SARA) (2007)
    • Ariel Feiner and Nir Ofek. Combining perimeter search and pattern database abstractions. In: Symposium on Abstraction Reformulation and Approximation (SARA) (2007)
  • 9
    • 26944463406 scopus 로고    scopus 로고
    • Holte, R.C., Grajkowski, J., Tanner, B.: Hierarchical heuristic search revisited. In: Zucker, J.-D., Saitta, L. (eds.) SARA 2005. LNCS (LNAI), 3607, pp. 121-133. Springer, Heidelberg (2005)
    • Holte, R.C., Grajkowski, J., Tanner, B.: Hierarchical heuristic search revisited. In: Zucker, J.-D., Saitta, L. (eds.) SARA 2005. LNCS (LNAI), vol. 3607, pp. 121-133. Springer, Heidelberg (2005)
  • 12
    • 0022129301 scopus 로고
    • Depth-first iterative-deepening: An optimal admissible tree search
    • Korf, R.E.: Depth-first iterative-deepening: an optimal admissible tree search. Artifificial Intelligence 27(1), 97-109 (1985)
    • (1985) Artifificial Intelligence , vol.27 , Issue.1 , pp. 97-109
    • Korf, R.E.1
  • 13
    • 84880767000 scopus 로고    scopus 로고
    • Korf, R.E.: Delayed duplicate detection: Extended abstract. In: Gottlob, G., Walsh, T. (eds.) IJCAI, pp. 1539-1541. Morgan Kaufmann, San Francisco (2003)
    • Korf, R.E.: Delayed duplicate detection: Extended abstract. In: Gottlob, G., Walsh, T. (eds.) IJCAI, pp. 1539-1541. Morgan Kaufmann, San Francisco (2003)
  • 14
    • 0029327473 scopus 로고
    • BIDA: An improved perimeter search algorithm
    • Manzini, G.: BIDA: An improved perimeter search algorithm. Artificial Intelligence 75(2), 347-360 (1995)
    • (1995) Artificial Intelligence , vol.75 , Issue.2 , pp. 347-360
    • Manzini, G.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.