nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A general branch and bound formulation for understanding and synthesizing and/or tree search procedures
|
Kumar, Vipin |
|
1983 |
21 |
1-2 |
p. 179-198 20 p. |
artikel |
2 |
A minimax algorithm better than alpha-beta? Yes and No
|
Roizen, Igor |
|
1983 |
21 |
1-2 |
p. 199-220 22 p. |
artikel |
3 |
Consistent-labeling problems and their algorithms: Expected-complexities and theory-based heuristics
|
Nudel, Bernard |
|
1983 |
21 |
1-2 |
p. 135-178 44 p. |
artikel |
4 |
Editorial Board
|
|
|
1983 |
21 |
1-2 |
p. CO2- 1 p. |
artikel |
5 |
Efficient graph automorphism by vertex partitioning
|
Fowler, Glenn |
|
1983 |
21 |
1-2 |
p. 245-269 25 p. |
artikel |
6 |
Eurisko: A program that learns new heuristics and domain concepts
|
Lenat, Douglas B. |
|
1983 |
21 |
1-2 |
p. 61-98 38 p. |
artikel |
7 |
Pathology on game trees revisited, and an alternative to minimaxing
|
Nau, Dana S. |
|
1983 |
21 |
1-2 |
p. 221-244 24 p. |
artikel |
8 |
Preface
|
Pearl, Judea |
|
1983 |
21 |
1-2 |
p. 1-6 6 p. |
artikel |
9 |
Search and Reasoning in problem solving
|
Simon, Herbert A. |
|
1983 |
21 |
1-2 |
p. 7-29 23 p. |
artikel |
10 |
Searching for an optimal path in a tree with random costs
|
Karp, Richard M. |
|
1983 |
21 |
1-2 |
p. 99-116 18 p. |
artikel |
11 |
Search rearrangement backtracking and polynomial average time
|
Purdom Jr., Paul Walton |
|
1983 |
21 |
1-2 |
p. 117-133 17 p. |
artikel |
12 |
Theory formation by heuristic search
|
Lenat, Douglas B. |
|
1983 |
21 |
1-2 |
p. 31-59 29 p. |
artikel |