On the complexity of task allocation
暂无分享,去创建一个
[1] Tad Hogg,et al. Using Deep Structure to Locate Hard Problems , 1992, AAAI.
[2] Marcin Paprzycki,et al. Parallel computing works! , 1996, IEEE Parallel & Distributed Technology: Systems & Applications.
[3] C. D. Gelatt,et al. Optimization by Simulated Annealing , 1983, Science.
[4] Gregory B. Sorkin. Simulated annealing on fractals: theoretical analysis and relevance for combinatorial optimization , 1990 .
[5] P. Stadler,et al. The landscape of the traveling salesman problem , 1992 .
[6] Peter M. A. Sloot,et al. Large scale simulations of complex systems part i: conceptual framework , 1997 .
[7] G. G. Stokes. "J." , 1890, The New Yale Book of Quotations.
[8] T. Hogg. Statistical mechanics of combinatorial search , 1994, Proceedings Workshop on Physics and Computation. PhysComp '94.
[9] Athanassios Siapas,et al. Criticality and Parallelism in Combinatorial Optimization , 1996, Science.
[10] Tilak Agerwala,et al. SP2 System Architecture , 1999, IBM Syst. J..
[11] Correlation structure of the landscape of the graph-bipartitioning problem , 1992 .
[12] C. P. Williams,et al. Phase transitions and coarse-grained search , 1994, Proceedings Workshop on Physics and Computation. PhysComp '94.
[13] S Kirkpatrick,et al. Critical Behavior in the Satisfiability of Random Boolean Expressions , 1994, Science.
[14] M. Mézard,et al. Spin Glass Theory and Beyond , 1987 .
[15] G. C. Fox,et al. Solving Problems on Concurrent Processors , 1988 .
[16] Izidor Gertner,et al. On the Complexity of Scheduling Problems for Parallel/Pipelined Machines , 1989, IEEE Trans. Computers.
[17] Geoffrey C. Fox,et al. Solving problems on concurrent processors: vol. 2 , 1990 .