References



Next: About this document Up: Work-Load Balancing in Highly Previous: Conclusion

References

1
S. Arvindam, V. Kumar, V. Rao. Efficient parallel algorithms for searching problems: Applications in VLSI CAD. 3rd Symp. Frontiers Mass. Par. Comp. 1990, 166-169.

2
P.P. Chakrabarti, S. Ghose, A. Acharya, S.C. de Sarkar. Heuristic search in restricted memory. Art. Intell. 41,2(1989/90), 197 - 221.

3
E. Dijkstra, W.H.J. Feijen and A.J.M. van Gasteren. Derivation of a termination detection algorithm for distributed computation. Inf. Proc. Lett. 16 (1983), 217-219.

4
S. Farrange, T. A. Marsland. Dynamic splitting of decision trees. Tech. Rep. TR93.03, University of Alberta, Edmonton (March 93).

5
A.Y. Grama, A. Gupta and V. Kumar. Isoefficiency: Measuring the scalability of parallel algorithms and architectures. IEEE Par. & Distr. Techn. 1,3 (1993), 12-21.

6
R.E. Korf. Depth-first iterative-deepening: An optimal admissible tree search. Art. Intell. 27 (1985), 97-109.

7
V. Kumar, V. Rao. Scalable parallel formulations of depth-first search. Kumar, Gopalakrishnan, Kanal, eds., Par. Alg. for Mach. Intell. and Vision, Springer 1990, 1-41.

8
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, (1992), 539-544.

9
N.J. Nilsson. Principles of Artificial Intelligence. Tioga Publ., Palo Alto, CA, 1980.

10
C.H. Papadimitriou and K. Steiglitz. Combinatorial Optimization: Algorithms and Complexity. Prentice-Hall, 1982.

11
J. Pearl. Heuristics. Intelligent Search Strategies for Computer Problem Solving. Addison-Wesley, Reading, MA, (1984).

12
V.N. Rao, V. Kumar and K. Ramesh. A parallel implementation of iterative-deepening A*. AAAI-87, 878-882.

13
V.N. Rao and V. Kumar. Parallel depth first search. Part I. Implementation. Intl. J. Parallel Programming 12, 6 (1987), 479-499.

14
D. Ratner and M. Warmuth. Finding a shortest solution for the extension of the 15-puzzle is intractable. AAAI-86, 168-172.

15
A. Reinefeld. Effective parallel backtracking methods for Operations Research applications. EUROSIM Intl. Conf. Massively Par. Proc., Delft (June 1994).

16
A. Reinefeld and V. Schnecke. AIDA* - Asynchronous Parallel IDA*. 10 Canadian Conf. on Art. Intell. AI'94, (May 1994), Banff, Canada.

17
L. Stockmeyer. Optimal orientations of cells in silicon floorplan designs. Inform. and Control 57 (1983), 97-101.

18
S. Wimer, I. Koren and I. Cederbaum. Optimal aspect ratios of building blocks in VLSI. 25th ACM/IEEE Design Automation Conference, (1988), 66-72.



Volker Schnecke
Fri Dec 16 11:20:32 MET 1994