Thomas A. Montgomery and Edmund H. Durfee. "Search<E-388> Reduction in Hierarchical Distributed Problem Solving." Group Decision and<E-411> Negotiation 2:301-317 (Special issue on Distributed Artificial Intelligence), 1993.<E-413>  Home/Search   Document Not in Database   Summary   Related Articles

.... ) Again, since k E 456 (and hence f(k) is constant, and l=log E 180 k E 207 n, this reduces simply to O(log E 350 k E 380 n) This means E 432 that through decomposition and parallel problem solving, the exponential ToH E 418 problem can be reduced to logarithmic time complexity [Montgomery 1993]. E 387 What the ToH problem illustrates is the potential for improved parallelism due to E 447 distributed problem solving in the ideally decomposable case. Unfortunately, few E 433 problems satisfy the assumptions in this analysis of ToH, including: E 321 1. There is no backtracking back ....

Thomas A. Montgomery and Edmund H. Durfee. "Search<E-388> Reduction in Hierarchical Distributed Problem Solving." Group Decision and<E-411> Negotiation 2:301-317 (Special issue on Distributed Artificial Intelligence), 1993.<E-413>

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC