You are here

Home

Historical Interest Only

This is a static HTML version of an old Drupal site. The site is no longer maintained and could be deleted at any point. It is only here for historical interest.

Publications

Export 674 results:
Filters: Keyword is constraint satisfaction  [Clear All Filters]
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z 
C
B. G. W. Craenen, Eiben, A. E., and van Hemert, J. I., “Comparing Evolutionary Algorithms on Binary Constraint Satisfaction Problems”, IEEE Transactions on Evolutionary Computation, vol. 7, p. 424--444, 2003.
D
A. Defaweux, Lenaerts, T., van Hemert, J. I., and Parent, J., “Transition Models as an incremental approach for problem solving in Evolutionary Algorithms”, in Proceedings of the Genetic and Evolutionary Computation Conference, 2005, p. 599--606.
A. Defaweux, Lenaerts, T., and van Hemert, J. I., “Evolutionary Transitions as a Metaphor for Evolutionary Optimization”, in LNAI 3630, 2005, p. 342--352.
A. Defaweux, Lenaerts, T., van Hemert, J. I., and Parent, J., “Complexity Transitions in Evolutionary Algorithms: Evaluating the impact of the initial population”, in Proceedings of the Congress on Evolutionary Computation, 2005, p. 196--203.
E
A. E. Eiben and van Hemert, J. I., “SAW-ing EAs: adapting the fitness function for solving constrained problems”, in New ideas in optimization, D. Corne, Dorigo, M., and Glover, F., Eds. McGraw-Hill, London, 1999, p. 389--402.
A. E. Eiben, van Hemert, J. I., Marchiori, E., and Steenbeek, A. G., “Solving Binary Constraint Satisfaction Problems using Evolutionary Algorithms with an Adaptive Fitness Function”, in Springer Lecture Notes on Computer Science, 1998, p. 196--205.
A. E. Eiben, van Hemert, J. I., Marchiori, E., and Steenbeek, A. G., “Extended abstract: Solving Binary Constraint Satisfaction Problems using Evolutionary Algorithms with an Adaptive Fitness Function”, in Proceedings of the Xth Netherlands/Belgium Conference on Artificial Intelligence (NAIC'98), 1998, p. 299--301.
A. E. Eiben, van der Hauw, J. K., and van Hemert, J. I., “Graph Coloring with Adaptive Evolutionary Algorithms”, Journal of Heuristics, vol. 4, p. 25--46, 1998.
G
R. Grim, Jansen, M. L. M., Baan, A., van Hemert, J. I., and de Wolf, H., “Use of Evolutionary Algorithms for Telescope Scheduling”, in Integrated Modeling of Telescopes, 2002, vol. 4757, p. 51--61.
M. Gruber, van Hemert, J. I., and Raidl, G. R., “Neighborhood Searches for the Bounded Diameter Minimum Spanning Tree Problem Embedded in a VNS, EA, and ACO”, in Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2006), Seattle, USA, 2006, vol. 2, p. 1187--1194.
H
J. van Hemert, “Evolutionary Computation and Constraint Satisfaction”, J. Kacpryk and Pedrycz, W., Eds. Springer, 2015, pp. 1271–1284.
J. I. van Hemert and Solnon, C., “A Study into Ant Colony Optimization, Evolutionary Computation and Constraint Programming on Binary Constraint Satisfaction Problems”, in Springer Lecture Notes on Computer Science, 2004, p. 114--123.
J. I. van Hemert and Bäck, T., “Measuring the Searched Space to Guide Efficiency: The Principle and Evidence on Constraint Satisfaction”, in Springer Lecture Notes on Computer Science, 2002, p. 23--32.
J. I. van Hemert, “Constraint Satisfaction Problems and Evolutionary Algorithms: A Reality Check”, in Proceedings of the Twelfth Belgium/Netherlands Conference on Artificial Intelligence (BNAIC'00), 2000, p. 267--274.
J. I. van Hemert and Bäck, T., “Robust parameter settings for variation operators by measuring the resampling ratio: A study on binary constraint satisfaction problems”, Journal of Heuristics, vol. 10, p. 629--640, 2004.
J. I. van Hemert, “Evolutionary Computation in Constraint Satisfaction and Machine Learning --- An abstract of my PhD.”, in Proceedings of the Brussels Evolutionary Algorithms Day (BEAD-2001), 2001.
J. I. van Hemert, “Comparing Classical Methods for Solving Binary Constraint Satisfaction Problems with State of the Art Evolutionary Computation”, in Springer Lecture Notes on Computer Science, 2002, p. 81--90.
J. I. van Hemert, “Evolving combinatorial problem instances that are difficult to solve”, Evolutionary Computation, vol. 14, p. 433--462, 2006.
J. I. van Hemert, “Evolving binary constraint satisfaction problem instances that are difficult to solve”, in Proceedings of the IEEE 2003 Congress on Evolutionary Computation, 2003, p. 1267--1273.
J
I. Juhos and van Hemert, J. I., “Contraction-Based Heuristics to Improve the Efficiency of Algorithms Solving the Graph Colouring Problem”, in Studies in Computational Intelligence, C. Cotta and van Hemert, J. I., Eds. Springer, 2008, p. 167--184.
I. Juhos, Tóth, A., and van Hemert, J. I., “Binary Merge Model Representation of the Graph Colouring Problem”, in Springer Lecture Notes on Computer Science, 2004, p. 124--134.
I. Juhos and van Hemert, J. I., “Improving Graph Colouring Algorithms and Heuristics Using a Novel Representation”, in Springer Lecture Notes on Computer Science, 2006, p. 123--134.
I. Juhos, Tóth, A., Tezuka, M., Tann, P., and van Hemert, J. I., “A new permutation model for solving the graph k-coloring problem”, in Kalmàr Workshop on Logic and Computer Science, 2003, p. 189--199.
I. Juhos, Tóth, A., and van Hemert, J. I., “Heuristic Colour Assignment Strategies for Merge Models in Graph Colouring”, in Springer Lecture Notes on Computer Science, 2005, p. 132--143.

      Creative Commons License