Solving constraint satisfaction problems by a genetic algorithm adopting viral infection
暂无分享,去创建一个
Hitoshi Kanoh | Seiichi Nishihara | N. Kato | K. Hasegawa | M. Matsumoto | S. Nishihara | H. Kanoh | N. Kato | M. Matsumoto | K. Hasegawa
[1] James Bowen,et al. Solving Constraint Satisfaction Problems Using a Genetic/Systematic Search Hybrid That Realizes When to Quit , 1995, ICGA.
[2] N. Anderson. Evolutionary Significance of Virus Infection , 1970, Nature.
[3] Steven Minton,et al. Minimizing Conflicts: A Heuristic Repair Method for Constraint Satisfaction and Scheduling Problems , 1992, Artif. Intell..
[4] Bart Selman,et al. Domain-Independent Extensions to GSAT : Solving Large StructuredSatis ability , 1993 .
[5] R M Haralick,et al. The consistent labeling problem: part I. , 1979, IEEE transactions on pattern analysis and machine intelligence.
[6] Paul Morris,et al. The Breakout Method for Escaping from Local Minima , 1993, AAAI.
[7] Hector J. Levesque,et al. Hard and Easy Distributions of SAT Problems , 1992, AAAI.
[8] Andrew J. Davenport,et al. GENET: A Connectionist Architecture for Solving Constraint Satisfaction Problems by Iterative Improvement , 1994, AAAI.
[9] Hitoshi Kanoh,et al. Genetic algorithms for constraint satisfaction problems , 1995, 1995 IEEE International Conference on Systems, Man and Cybernetics. Intelligent Systems for the 21st Century.