Applications of parallel processing languages to reducing the average time behavior of search algorithms are discussed. It is argued that a parallel algorithm can dramatically reduce the average time behavior even if the algorithm is run in a time-slicing fashion on a single processor. A language is developed with primitives to facilitate the construction of algorithms of this type.
No takes yet. Share an insight, caveat, or question.
William A. Kornfeld (1982) studied this question.
Synapse has enriched 2 closely related papers on similar clinical questions. Consider them for comparative context: