메뉴 건너뛰기




Volumn 2, Issue , 2007, Pages 1211-1216

Inconsistent heuristics

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; OPTIMAL CONTROL SYSTEMS;

EID: 36348994827     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (37)

References (14)
  • 2
    • 9444247515 scopus 로고    scopus 로고
    • Feiner, A.; Meshulam, R.; Holte, R.; and Korf, R. 2004. Compressing pattern databases. In AAAI, 638-643.
    • Feiner, A.; Meshulam, R.; Holte, R.; and Korf, R. 2004. Compressing pattern databases. In AAAI, 638-643.
  • 4
    • 33750633519 scopus 로고    scopus 로고
    • Maximizing over multiple pattern databases speeds up heuristic search
    • Holte, R. C.; Feiner, A.; Newton, J.; Meshulam, R.; and Furcy, D. 2006. Maximizing over multiple pattern databases speeds up heuristic search. Artificial Intelligence 170:1123-1136.
    • (2006) Artificial Intelligence , vol.170 , pp. 1123-1136
    • Holte, R.C.1    Feiner, A.2    Newton, J.3    Meshulam, R.4    Furcy, D.5
  • 5
    • 0036147811 scopus 로고    scopus 로고
    • Disjoint pattern database heuristics
    • Korf, R. E., and Feiner, A. 2002. Disjoint pattern database heuristics. Artificial Intelligence 134:9-22.
    • (2002) Artificial Intelligence , vol.134 , pp. 9-22
    • Korf, R.E.1    Feiner, A.2
  • 7
    • 0031361254 scopus 로고    scopus 로고
    • Finding optimal solutions to Rubik's Cube using pattern databases
    • Korf, R. E. 1997. Finding optimal solutions to Rubik's Cube using pattern databases. In AAAI, 700-705.
    • (1997) AAAI , pp. 700-705
    • Korf, R.E.1
  • 8
    • 0002880188 scopus 로고    scopus 로고
    • Recent progress in the design and analysis of admissible heuristic functions
    • Korf, R. E. 2000. Recent progress in the design and analysis of admissible heuristic functions. In AAAI, 1165-1170.
    • (2000) AAAI , pp. 1165-1170
    • Korf, R.E.1
  • 9
    • 84890263216 scopus 로고    scopus 로고
    • A generalized framework for lifelong planning a*
    • Likhachev, M., and Koenig, S. 2005. A generalized framework for lifelong planning a*. In ICAPS, 99-108.
    • (2005) ICAPS , pp. 99-108
    • Likhachev, M.1    Koenig, S.2
  • 10
    • 0017458236 scopus 로고
    • On the complexity of admissible search algorithms
    • Martelli, A. 1977. On the complexity of admissible search algorithms. Artificial Intelligence 8:1-13.
    • (1977) Artificial Intelligence , vol.8 , pp. 1-13
    • Martelli, A.1
  • 11
    • 0004899145 scopus 로고
    • A heuristic search algorithm with modifiable estimate
    • Mero, L. 1984. A heuristic search algorithm with modifiable estimate. Artificial Intelligence 23:13-27.
    • (1984) Artificial Intelligence , vol.23 , pp. 13-27
    • Mero, L.1
  • 13
    • 36348995481 scopus 로고    scopus 로고
    • Towards real-time search with inadmissible heuristics
    • Shimbo, M., and Isida, T. 2000. Towards real-time search with inadmissible heuristics. In ECAI, 609-613.
    • (2000) ECAI , pp. 609-613
    • Shimbo, M.1    Isida, T.2
  • 14
    • 33750693379 scopus 로고    scopus 로고
    • Dual search in permutation state spaces
    • Zahavi, U.; Feiner, A.; Holte, R.; and Schaeffer, J. 2006. Dual search in permutation state spaces. In AAAI, 1076-1081.
    • (2006) AAAI , pp. 1076-1081
    • Zahavi, U.1    Feiner, A.2    Holte, R.3    Schaeffer, J.4


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