next up previous
Next: About this document ... Up: No Title Previous: Acknowledgements


D.P. Agrawal, V.K. Janakiram, and R. Mehrotra.
A randomized parallel branch and bound algorithm.
In Proceedings of the International Conference on Parallel Processing, pages 69-75. The Pennsylvania State University, 1988.

S Anderson and M C Chen.
Parallel branch-and-bound algorithms on the hypercube.
In Proceedings of the Conference on Hypercube Multiprocessors, pages 309-317, 1987.

A Barrett and D Weld.
Partial order planning: evaluating possible efficiency gains.
Technical Report CSE TR 92-05-1, University of Washington, 1992.

Samrat Bhattacharjee, Ken Calvert, and Ellen W Zegura.
An architecture for active networking.
In Ahmed N Tantawy, editor, High Performance Networking, pages 265-279. Chapman & Hall, 1997.

B Cestnik.
Estimating probabilities: a crucial task in machine learning.
In Proceedings of the Ninth European Conference on Artificial Intelligence, pages 174-179, 1990.

D Challou, M Gini, and V Kumar.
Parallel search algorithms for robot motion planning.
In James Geller, editor, Proceedings of the AAAI Symposium on Innovative Applications of Massive Parallelism, pages 40-47, 1993.

P Clark and R Niblett.
The CN2 induction algorithm.
Machine Learning, 3:261-284, 1989.

D J Cook and R C Varnell.
Maximizing the benefits of parallel search using machine learning.
In Proceedings of the National Conference on Artificial Intelligence, pages 559-564. AAAI Press, 1997.

Diane J Cook.
A hybrid approach to improving the performance of parallel search.
In Parallel Processing for Artificial Intelligence 3, pages 120-145. Elsevier, 1997.

Diane J Cook, Larry Hall, and Willard Thomas.
Parallel search using transformation-ordering iterative-deepening A*.
The International Journal of Intelligent Systems, 8(8):855-873, 1993.

Diane J Cook and Gary Lyons.
Massively parallel IDA* search.
Journal of Artificial Intelligence Tools, 2(2):163-180, 1993.

John J Craig.
Introduction to robotics.
Addison-Wesley, 1989.

Matthew Evett, James Hendler, Ambuj Mahanti, and Dana Nau.
PRA*: massively parallel heuristic search.
Journal of Parallel and Distributed Computing, 25:133-143, 1995.

R Feldmann, P Mysliwietz, and B Monien.
Studying overheads in massively parallel min/max-tree evaluation.
In Proceedings of the Sixth Annual ACM Symposium on Parallel Algorithms and Architectures, pages 94-103. Association for Computing Machinery, 1994.

Martin Frank, Piyawadee Sukavirija, and James D Foley.
Inference bear: designing interactive interfaces through before and after snapshots.
In Proceedings of the ACM Symposium on Designing Interactive Systems, pages 167-175. Association for Computing Machinery, 1995.

M Furuichi, K Taki, and N Ichyoshi.
A multi-level load balancing scheme for or-parallel exhaustive search programs on the multi-psi.
In Proceedings of the Second ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pages 100-106. Association for Computing Machinery, 1990.

L V Kale and Vikram A Saletore.
Parallel state-space search for a first solution with consistent linear speedups.
International Journal of Parallel Programming, 19(4):251-293, 1990.

George Karypis and Vipin Kumar.
Unstructured tree search on SIMD parallel computers.
In Proceedings of Supercomputing 92, pages 453-462. IEEE Computer Society, 1992.

V Kumar and V N Rao.
Scalable parallel formulations of depth-first search.
In Kumar, Kanal, and Gopalakrishan, editors, Parallel Algorithms for Machine Intelligence and Vision, pages 1-41. Springer-Verlag, 1990.

Henry Lieberman.
Integrating user interface agents with conventional applications.
In Proceedings of the ACM Conference on Intelligent User Interfaces, pages 39-46. Association for Computing Machinery, 1998.

A Mahanti and C Daniels.
SIMD parallel heuristic search.
Artificial Intelligence, 60(2):243-281, 1993.

Nihar R. Mahapatra and Shantanu Dutt.
New anticipatory load balancing strategies for parallel A* algorithms.
In Proceedings of the DIMACS Series on Discrete Mathematics and Theoretical Computer Science, pages 197-232. American Mathematical Society, 1995.

Steven Minton.
Automatically configuring constraint satisfaction programs: a case study.
Constraints, 1(1):7-43, 1996.

Curt Powley, C Ferguson, and R E Korf.
Depth-first heuristic search on a SIMD machine.
Artificial Intelligence, 60(2):199-242, 1993.

Curt Powley and Richard E Korf.
Single-agent parallel window search.
IEEE Transactions on Pattern Analysis and Machine Intelligence, 13(5):466-477, 1991.

J. Ross Quinlan.
C4.5: programs for machine learning.
Morgan Kaufmann, 1993.

J.R. Quinlan.
Induction of decision trees.
Machine Learning 1, 1(1):81-106, 1986.

S P Rajpal and S Kumar.
Parallel heuristic search algorithms for message passing multiprocessor systems.
Computer Science and Informatics, 23(4):7-18, 1993.

V N Rao, V Kumar, and K Ramesh.
A parallel implementation of iterative-deepening-A*.
In Proceedings of the National Conference on Artificial Intelligence, pages 178-182. Morgan Kaufmann, 1987.

Alexander Reinefeld and Volker Schnecke.
AIDA* - asynchronous parallel IDA*.
In Proceedings of the Tenth Canadian Conference on Artificial Intelligence, pages 295-302. Canadian Information Processing Society, 1994.

D E Rumelhart and J L McClelland.
Parallel distributed processing: exploration in the microstructure of cognition, Volumes 1 and 2.
MIT Press, Cambridge, MA, 1986.

V A Saletore.
A distributed and adaptive dynamic load balancing scheme for parallel processing of medium-grain tasks.
In Proceedings of the Fifth Distributed Memory Computing Conference, pages 231-235, 1990.

Peter Steenkiste, Allan Fisher, and Hui Zhang.
Darwin: resource management for application-aware networks.
Technical Report CMU-CS-97-195, Carnegie Mellon University, 1997.

Christian Suttner.
Static partitioning with slackness.
In Parallel Processing for Artificial Intelligence 3, pages 106-120. Elsevier, 1997.

R Craig Varnell.
An architecture for improving the performance of parallel search.
PhD thesis, University of Texas at Arlington, 1997.