论文信息 - Simulated annealing for hard satisfiability problems

Simulated annealing for hard satisfiability problems

A portable domestic sewing machine is provided with support means for enabling detachable accessories for use therewith during operation of the machine, such as a current regulating device and an extension table, to be firmly held in position within at least one space provided within the confines of the body of the machine, when the machine is not in use and a case or housing in which the machine with the accessories stored therein is located during non-use of the sewing machine.

William M. Spears | W. Spears

[1] W. Spears,et al. Using Neural Networks and Genetic Algorithms as Heuristics for NP-Complete Problems , 1983 .

[2] Bart Selman,et al. Domain-Independent Extensions to GSAT : Solving Large StructuredSatis ability , 1993 .

[3] Kenneth A. De Jong,et al. Using Genetic Algorithms to Solve NP-Complete Problems , 1989, ICGA.

[4] Hector J. Levesque,et al. Hard and Easy Distributions of SAT Problems , 1992, AAAI.

[5] Thomas Bäck,et al. Optimal Mutation Rates in Genetic Search , 1993, ICGA.

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

[7] James M. Crawford,et al. Experimental Results on the Crossover Point inSatis ability , 1993 .

[8] Bart Selman,et al. An Empirical Study of Greedy Local Search for Satisfiability Testing , 1993, AAAI.

[9] R. A. Young,et al. A Hybrid Genetic Algorithm for a Logic Problem , 1990, European Conference on Artificial Intelligence.

[10] William M. Spears,et al. A NN Algorithm for Hard Satisfiability Problems † , 1993 .

[11] Jun Gu,et al. Efficient local search for very large-scale satisfiability problems , 1992, SGAR.

[12] Bart Selman,et al. Local search strategies for satisfiability testing , 1993, Cliques, Coloring, and Satisfiability.