|
 |
Авторизация |
|
 |
Поиск по указателям |
|
 |
|
 |
|
 |
 |
|
 |
|
Pearl J. — Heuristics |
|
 |
Предметный указатель |
Tower of Hanoi 27—31 123
Trajectories of error parameters 333—346
Traveling salesman problem (TSP) 10 15 20 31 70 79 114 115 124 176 210
Traversal path 39—40
Traversal tree 49 74
Trees 19 33
Trees, action 26 29 30
Trees, game 222—226 251
Trees, strategy 19 224
Trees, uniform 33 150
Trees, unordered 26 27 32
Triangle inequality 82 116
Tversky, A. 124 125
Typical errors 184
Uniform cost algorithm 44 65 69 71 87 150 151 162
Uniform tree 33 150
Uninformed (blind) search 34 36—46
Upper supports 197 199 201 322
Uspensky, J.V. 126
| Valtorta, M. 131
VanderBrug, G.J. 31 170
Verstraete, R. 349
Vertices, in graphs 33
Visibility argument for look-ahead 332 347—348
Wagner, H. 31
Waltz, D. 69
Weide, B.W. 127 286
Weight labeling procedure 58
Weight labeling procedure, examples 58
Weights on arcs 33
Winkler, R.L. 126
Winning probability 251—254 322 357—358
Winning strategies 224—225
Winston, P.H. 47 227
Wood, D.E. 19 31 70 131
Worst case analysis 162 170 179—180 294
Z and algoritnms 61—63 65
Zucker, S. 69
|
|
 |
Реклама |
 |
|
|