论文信息 - Criticality and Parallelism in GSAT

Criticality and Parallelism in GSAT

Abstract Abstract In this work we show some empirical results on the parallelization of GSAT. We subdivided the set of variables in τ equal subsets and we applied GSAT in parallel on each subset. We observed the existence of an optimum degree of parallelism ((τopt) for which the best performance, in terms of efficiency (time and number of iterations) and effectiveness (fraction of solved instances) is obtained. Moreover, we found that τopt is strictly correlated to the connectivity parameter (q).

Andrea Roll

[1] John Archibald Wheeler,et al. At Home in the Universe , 1994 .

[2] Athanassios Siapas,et al. Criticality and Parallelism in Combinatorial Optimization , 1996, Science.

[3] Dittes. Optimization on rugged landscapes: A new general purpose Monte Carlo approach. , 1996, Physical review letters.

[4] Peter F. Stadler,et al. Amplitude Spectra of Fitness Landscapes , 1998, Adv. Complex Syst..

[5] Andrea Roli,et al. Solving the Satisfiability Problem through Boolean Networks , 1999, AI*IA.

[6] C. D. Gelatt,et al. Optimization by Simulated Annealing , 1983, Science.

[7] Bart Selman,et al. Evidence for Invariants in Local Search , 1997, AAAI/IAAI.

[8] Stuart A. Kauffman,et al. Technological evolution and adaptive organizations: Ideas from biology may find applications in economics , 1995, Complex..

[9] Hector J. Levesque,et al. A New Method for Solving Hard Satisfiability Problems , 1992, AAAI.

[10] Christian Blum,et al. Critical Parallelization of Local Search for MAX-SAT , 2001, AI*IA.

[11] Wim Hordijk,et al. A Measure of Landscapes , 1996, Evolutionary Computation.

[12] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[13] Stuart A. Kauffman,et al. ORIGINS OF ORDER , 2019, Origins of Order.

[14] Toby Walsh,et al. The Constrainedness of Search , 1996, AAAI/IAAI, Vol. 1.