New methods to color the vertices of a graph
Communications of the ACM
Using deep structure to locate hard problems
AAAI'92 Proceedings of the tenth national conference on Artificial intelligence
Improving the performance of vector hyper-heuristics through local search
Proceedings of the 14th annual conference on Genetic and evolutionary computation
Learning vector quantization for variable ordering in constraint satisfaction problems
Pattern Recognition Letters
Generation of neural networks using a genetic algorithm approach
International Journal of Bio-Inspired Computation
Hi-index | 0.00 |
This paper describes a model which constructs hyper-heuristics for variable ordering within Constraint Satisfaction Problems (CSPs) by running a genetic algorithm that evolves the topology of neural networks and some learning parameters.