Evolving algorithms for constraint satisfaction
暂无分享,去创建一个
[1] Bart Selman,et al. Evidence for Invariants in Local Search , 1997, AAAI/IAAI.
[2] Hector J. Levesque,et al. A New Method for Solving Hard Satisfiability Problems , 1992, AAAI.
[3] Byungki Cha,et al. Adding New Clauses for Faster Local Search , 1996, AAAI/IAAI, Vol. 1.
[4] John R. Koza,et al. Genetic programming - on the programming of computers by means of natural selection , 1993, Complex adaptive systems.
[5] Edward P. K. Tsang,et al. Adaptive Constraint Satisfaction: The Quickest First Principle , 1996, ECAI.
[6] Bart Selman,et al. Noise Strategies for Improving Local Search , 1994, AAAI.
[7] Graham Kendall,et al. An investigation of a tabu assisted hyper-heuristic genetic algorithm , 2003, The 2003 Congress on Evolutionary Computation, 2003. CEC '03..
[8] Alexander Nareyek,et al. Choosing search heuristics by non-stationary reinforcement learning , 2004 .
[9] Susan L. Epstein,et al. The Adaptive Constraint Engine , 2002, CP.
[10] Holger H. Hoos,et al. Scaling and Probabilistic Smoothing: Efficient Dynamic Local Search for SAT , 2002, CP.
[11] Steven Minton,et al. Automatically configuring constraint satisfaction programs: A case study , 1996, Constraints.
[12] Jonathan Gratch,et al. Adaptive Problem-solving for Large-scale Scheduling Problems: A Case Study , 1996, J. Artif. Intell. Res..
[13] David H. Wolpert,et al. No free lunch theorems for optimization , 1997, IEEE Trans. Evol. Comput..