Genetic programming: on the programming of computers by means of natural selection
Genetic programming: on the programming of computers by means of natural selection
Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems
Artificial Intelligence - Special volume on constraint-based reasoning
Noise strategies for improving local search
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
An adaptive evolutionary algorithm for the satisfiability problem
SAC '00 Proceedings of the 2000 ACM symposium on Applied computing - Volume 1
A machine program for theorem-proving
Communications of the ACM
Foundations of genetic programming
Foundations of genetic programming
Evolutionary algorithms for the satisfiability problem
Evolutionary Computation
Automated discovery of composite SAT variable-selection heuristics
Eighteenth national conference on Artificial intelligence
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Stochastic Local Search Methods for Dynamic SAT- an Initial Investigation
Stochastic Local Search Methods for Dynamic SAT- an Initial Investigation
A GP-based hyper-heuristic framework for evolving 3-SAT heuristics
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Alembic: an efficient algorithm for CNF preprocessing
Proceedings of the 44th annual Design Automation Conference
Domain-independent extensions to GSAT: solving large structured satisfiability problems
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
Generating SAT local-search heuristics using a GP hyper-heuristic framework
EA'07 Proceedings of the Evolution artificielle, 8th international conference on Artificial evolution
EuroGP'06 Proceedings of the 9th European conference on Genetic Programming
Evolving heuristics with genetic programming
Proceedings of the 10th annual conference on Genetic and evolutionary computation
Grammar-based genetic programming for timetabling
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Towards a population-based framework for improving stochastic local search algorithms
Proceedings of the 14th annual conference on Genetic and evolutionary computation
| Hi-index | 0.00 |
This paper presents Inc*, a general algorithm that can be used in conjunction with any local search heuristic and that has the potential to substantially improve the overall performance of the heuristic. Genetic programming is used to discover new strategies for the Inc* algorithm. We experimentally compare performance of local heuristics for SAT with and without the Inc* algorithm. Results show that Inc* consistently improves performance.