A RESULT ON THE COMPUTATIONAL-COMPLEXITY OF HEURISTIC ESTIMATES FOR THE A-STAR ALGORITHM

被引：15

|

作者：

VALTORTA, M ^{[1
]}

机构：

[1] DUKE UNIV,DEPT COMP SCI,DURHAM,NC 27706

来源：

INFORMATION SCIENCES | 1984年 / 34卷 / 01期

关键词：

D O I：

10.1016/0020-0255(84)90009-4

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

收藏

页码：47 / 59

页数：13

相关论文

共 50 条

[1] A NEW RESULT ON THE COMPLEXITY OF HEURISTIC ESTIMATES FOR THE A-ASTERISK ALGORITHM
HANSSON, O
MAYER, A
VALTORTA, M
[J]. ARTIFICIAL INTELLIGENCE, 1992, 55 (01) : 129 - 143
[2] COMPUTATIONAL-COMPLEXITY OF A PIECEWISE LINEAR HOMOTOPY ALGORITHM
SAIGAL, R
[J]. MATHEMATICAL PROGRAMMING, 1984, 28 (02) : 164 - 173
[3] A Robust Heuristic for the Multidimensional A-star/Wavefront Hybrid Planning Algorithm
Wojnicki, Igor
Ernst, Sebastian
Turek, Andwojciech
[J]. ARTIFICIAL INTELLIGENCE AND SOFT COMPUTING, PT II (ICAISC 2015), 2015, 9120 : 282 - 291
[4] AN OVERVIEW OF COMPUTATIONAL-COMPLEXITY
COOK, SA
[J]. COMMUNICATIONS OF THE ACM, 1983, 26 (06) : 401 - 408
[5] AMORTIZED COMPUTATIONAL-COMPLEXITY
TARJAN, RE
[J]. SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1985, 6 (02): : 306 - 318
[6] THE COMPUTATIONAL-COMPLEXITY OF ONE ALGORITHM RECOGNIZING MONOTONE MATRICES
FTACNIK, M
[J]. COMPUTERS AND ARTIFICIAL INTELLIGENCE, 1985, 4 (05): : 437 - 444
[7] THE COMPUTATIONAL-COMPLEXITY OF ABDUCTION
BYLANDER, T
ALLEMANG, D
TANNER, MC
JOSEPHSON, JR
[J]. ARTIFICIAL INTELLIGENCE, 1991, 49 (1-3) : 25 - 60
[8] ON THE COMPUTATIONAL-COMPLEXITY OF BISIMULATION
MOLLER, F
SMOLKA, SA
[J]. ACM COMPUTING SURVEYS, 1995, 27 (02) : 287 - 289
[9] PROBABILISTIC ANALYSIS OF THE COMPLEXITY OF A-STAR
HUYN, N
DECHTER, R
PEARL, J
[J]. ARTIFICIAL INTELLIGENCE, 1980, 15 (03) : 241 - 254
[10] THE COMPUTATIONAL-COMPLEXITY OF WRITING SYSTEMS
SIMONS, GF
[J]. FIFTEENTH LACUS FORUM 1988, 1989, : 538 - 553

← 1 2 3 4 5 →