A general stochastic approach to solving problems with hard and soft constraints
暂无分享,去创建一个
[1] Jun Gu,et al. A Modular Partitioning Approach for Asynchronous Circuit Synthesis , 1994, 31st Design Automation Conference.
[2] Bart Selman,et al. An Empirical Study of Greedy Local Search for Satisfiability Testing , 1993, AAAI.
[3] James M. Crawford,et al. Experimental Results on the Application of Satisfiability Algorithms to Scheduling Problems , 1994, AAAI.
[4] G. D. Smith,et al. Solving the Graphical Steiner Tree Problem Using Genetic Algorithms , 1993 .
[5] Mark D. Johnston,et al. A discrete stochastic neural network algorithm for constraint satisfaction problems , 1990, 1990 IJCNN International Joint Conference on Neural Networks.
[6] Steven Minton,et al. Solving Large-Scale Constraint-Satisfaction and Scheduling Problems Using a Heuristic Repair Method , 1990, AAAI.
[7] Bart Selman,et al. Local search strategies for satisfiability testing , 1993, Cliques, Coloring, and Satisfiability.
[8] Panos M. Pardalos,et al. A heuristic for the Steiner problem in graphs , 1996, Comput. Optim. Appl..
[9] Panos M. Pardalos,et al. A test problem generator for the Steiner problem in graphs , 1993, TOMS.
[10] Bart Selman,et al. Domain-Independent Extensions to GSAT : Solving Large StructuredSatis ability , 1993 .
[11] Henry Kautz,et al. Noise Strategies for Local Search , 1994, AAAI 1994.
[12] M. R. Rao,et al. Solving the Steiner Tree Problem on a Graph Using Branch and Cut , 1992, INFORMS J. Comput..
[13] K. Dowsland. HILL-CLIMBING, SIMULATED ANNEALING AND THE STEINER PROBLEM IN GRAPHS , 1991 .