References
Next: About this document
Up: AIDA* - Asynchronous Parallel
Previous: Acknowledgements
References
- Altmann et al., 1988
-
E. Altmann, T. A. Marsland, T. Breitkreutz.
Accounting for Parallel Tree Search Overheads.
Procs. Int. Conf. Par. Proc. (1988), 198 - 201
- Chakrabrti et al., 1989
-
P.P. Chakrabarti, S. Ghose, A. Acharya, S.C. de Sarkar.
Heuristic search in restricted memory.
Art. Intell. 41,2(1989/90), 197 - 221.
- Evett et al., 1990
-
M. Evett, J. Hendler, A. Mahanti, D.S. Nau.
PRA*: A memory-limited heuristic search procedure for the Connection Machine.
3rd IEEE Symp. Frontiers Mass. Par. Comp. (1990), 145 - 149.
- Korf, 1985
-
R.E. Korf.
Depth-first iterative-deepening: An optimal admissible tree search.
Art. Intell. 27(1985), 97 - 109.
- Kumar and Rao, 1990
-
V. Kumar, V.N. Rao.
Scalable parallel formulations of depth-first search.
In: Kumar, Gopalakrishnan, Kanal (eds.), Parallel Algorithms
for Machine Intelligence and Vision, Springer-Verlag (1990), 1 - 41.
- Mahanti et al., 1992
-
A. Mahanti, S. Ghosh, D.S. Nau, A.K. Pal and L. Kanal.
Performance of IDA* on trees and graphs.
10th Nat. Conf. on Art. Int.,
AAAI-92, San Jose, CA, (1992), 539 - 544.
- Mahanti and Daniels, 1993
-
A. Mahanti, C.J. Daniels.
A SIMD approach to parallel heuristic search.
Art. Intell. 60(1993), 243 - 282.
- Morabito et al., 1992
-
R.N. Morabito, M.N. Arenales, V.F. Arcaro.
An and-or-graph approach for two dimensional cutting problems.
European J. of OR 58(1992), 263 - 271.
- Newborn, 1988
-
M. Newborn.
Unsynchronized iteratively deepening parallel alpha-beta search.
IEEE Trans. Pattern Anal. Mach. Int., PAMI-10,9 (1988), 687 - 694.
- Nilsson, 1980
-
N.J. Nilsson.
Principles of Artificial Intelligence.
Tioga Publishing, Palo Alto, CA, (1980).
- Pearl, 1985
-
J. Pearl.
Heuristics. Intelligent Search Strategies for Computer Problem Solving.
Addison-Wesley, Reading, MA, (1984).
- Powley and Korf, 1991
-
C. Powley, R.E. Korf.
Single-agent parallel window search.
IEEE Trans. Pattern Anal. Mach. Int., PAMI-13,5 (1991), 466 - 477.
- Powley et al., 1993
-
C. Powley, C. Ferguson, R.E. Korf.
Depth-first heuristic search on a SIMD machine.
Art. Intell. 60(1993), 199 - 242.
- Rao et al., 1991
-
V.N. Rao, V. Kumar, R.E. Korf.
Depth-first vs. best-first search.
9th Nat. Conf. on Art. Int.
AAAI-91, Anaheim, CA, (1991), 434 - 440.
- Rao and Kumar, 1987
-
V.N. Rao, V. Kumar.
Parallel depth-first search. Part I. Implementation.
Int. J. Par. Progr. 16,6(1987), 479 - 499.
- Ratner and Warmuth, 1986
-
D. Ratner, M. Warmuth.
Finding a shortest solution for the extension of the 15-puzzle is intractable.
AAAI-86, 168 - 172.
- Reinefeld and Marsland, 1993
-
A. Reinefeld, T.A. Marsland.
Enhanced iterative-deepening search.
Univ. Paderborn, FB Mathematik-Informatik, Tech. Rep. 120 (March 1993),
to appear IEEE-PAMI.
- Reinefeld, 1993
-
A. Reinefeld.
Complete solution of the Eight-Puzzle and the
benefit of node-ordering in IDA*.
Procs. Int. Joint Conf. on AI, Chambéry, Savoi, France (Sept. 1993), 248 - 253.
- Russell, 1992
-
S. Russell.
Efficient memory-bounded search methods.
European AI-Conference,
ECAI-92, Vienna, (1992), 1 - 5.
- Wimer et al., 1988
-
S. Wimer, I. Koren, I. Cederbaum.
Optimal aspect ratios of building blocks in VLSI. Procs. 25th
ACM/IEEE Design Automation Conference, 1988, 66 - 72.
Volker Schnecke
Mon Dec 19 17:27:56 MET 1994