BIDPS - a basic algorithm of iterative-deepening perimeter search

被引：0
|
作者：
机构：
来源：
Jisuanji Gongcheng | / 6卷 / 45-47期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [1] ENHANCED ITERATIVE-DEEPENING SEARCH
    REINEFELD, A
    MARSLAND, TA
    [J]. IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1994, 16 (07) : 701 - 710
  • [2] Iterative-Deepening Conflict-Based Search
    Boyarski, Eli
    Felner, Ariel
    Harabor, Daniel
    Stuckey, Peter J.
    Cohen, Liron
    Li, Jiaoyang
    Koenig, Sven
    [J]. PROCEEDINGS OF THE TWENTY-NINTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2020, : 4084 - 4090
  • [3] ITERATIVE-DEEPENING PROLOG
    ZELL, A
    BRAUNL, T
    [J]. SCANDINAVIAN CONFERENCE ON ARTIFICIAL INTELLIGENCE - 89, 1989, : 919 - 929
  • [4] Iterative-deepening fuzzy heuristic search algorithms and their learning investigation
    Wang, ST
    [J]. FUZZY SETS AND SYSTEMS, 1996, 82 (03) : 351 - 355
  • [5] Iterative-deepening search with on-line tree size prediction
    Ethan Burns
    Wheeler Ruml
    [J]. Annals of Mathematics and Artificial Intelligence, 2013, 69 : 183 - 205
  • [6] REDUCING REEXPANSIONS IN ITERATIVE-DEEPENING SEARCH BY CONTROLLING CUTOFF BOUNDS
    SARKAR, UK
    CHAKRABARTI, PP
    GHOSE, S
    DESARKAR, SC
    [J]. ARTIFICIAL INTELLIGENCE, 1991, 50 (02) : 207 - 221
  • [7] Iterative-deepening search with on-line tree size prediction
    Burns, Ethan
    Ruml, Wheeler
    [J]. ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE, 2013, 69 (02) : 183 - 205
  • [8] Solving the traveling tournament problem with iterative-deepening A∗
    David C. Uthus
    Patricia J. Riddle
    Hans W. Guesgen
    [J]. Journal of Scheduling, 2012, 15 : 601 - 614
  • [9] DEPTH-1ST ITERATIVE-DEEPENING - AN OPTIMAL ADMISSIBLE TREE-SEARCH
    KORF, RE
    [J]. ARTIFICIAL INTELLIGENCE, 1985, 27 (01) : 97 - 109
  • [10] EXECUTION OF LOGIC PROGRAMS BY ITERATIVE-DEEPENING A-ASTERISK SLD-TREE SEARCH
    OLSSON, R
    [J]. BIT, 1993, 33 (02): : 214 - 231
12345