@Article{evett95a,
  author =	 {Matthew Evett and James Hendler and Ambuj Mahanti
                  and Dana Nau},
  title =	 {{PRA}*: Massively Parallel Heuristic Search},
  googleid = 	 {eFialxOKGicJ:scholar.google.com/},
  journal =	 {Journal of Parallel and Distributed Computing},
  year =	 1995,
  volume =	 25,
  number =	 2,
  pages =	 {133--143},
  abstract =	 {In this paper we describe a variant of A* search
                  designed to run on the massively parallel, SIMD
                  Connection Machine (CM-2). The algorithm is designed
                  to run in a limited memory by use of a retraction
                  technique which allows nodes with poor heuristic
                  values to be removed from the open list, until such
                  time as they may need reexpansion, more promising
                  paths having failed. Our algorithm, called PRA* (for
                  Parallel Retraction A*), is designed to maximize use
                  of the Connection Machine's memory and.},
  keywords =     {distributed-search},
  url =		 {http://citeseer.ist.psu.edu/84590.html},
  cluster = 	 {2817716333626153080}
}