Evolving Variable-Ordering Heuristics for Constrained Optimisation
暂无分享,去创建一个
[1] Alex S. Fukunaga,et al. Evolving Local Search Heuristics for SAT Using Genetic Programming , 2004, GECCO.
[2] Roland Olsson,et al. Inductive Functional Programming Using Incremental Program Transformation , 1995, Artif. Intell..
[3] Alex S. Fukunaga,et al. Automated discovery of composite SAT variable-selection heuristics , 2002, AAAI/IAAI.
[4] Alexander Nareyek,et al. Choosing search heuristics by non-stationary reinforcement learning , 2004 .
[5] Brian Borchers,et al. A Two-Phase Exact Algorithm for MAX-SAT and Weighted MAX-SAT Problems , 1998, J. Comb. Optim..
[6] Susan L. Epstein,et al. The Adaptive Constraint Engine , 2002, CP.
[7] Steven Minton,et al. Automatically configuring constraint satisfaction programs: A case study , 1996, Constraints.
[8] Mark Wallace,et al. Principles and Practice of Constraint Programming – CP 2004 , 2004, Lecture Notes in Computer Science.
[9] Graham Kendall,et al. An investigation of a tabu assisted hyper-heuristic genetic algorithm , 2003, The 2003 Congress on Evolutionary Computation, 2003. CEC '03..
[10] Edward P. K. Tsang,et al. Adaptive Constraint Satisfaction: The Quickest First Principle , 1996, ECAI.
[11] Weixiong Zhang,et al. Efficient Strategies for (Weighted) Maximum Satisfiability , 2004, CP.
[12] John R. Koza,et al. Genetic programming - on the programming of computers by means of natural selection , 1993, Complex adaptive systems.
[13] Nicolas Barnier,et al. Solving the Kirkman's schoolgirl problem in a few seconds , 2002 .
[14] David H. Wolpert,et al. No free lunch theorems for optimization , 1997, IEEE Trans. Evol. Comput..
[15] Mark E. Stickel,et al. Implementing the Davis–Putnam Method , 2000, Journal of Automated Reasoning.