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 evolutionary computation  [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
C. Cotta and van Hemert, J., “Evolutionary Computation in Combinatorial Optimization, 7th European Conference”, Lecture Notes in Computer Science, vol. LNCS 4446. Springer, 2007.
D
C. Di Chio, Giacobini, M., and van Hemert, J., “European Graduate Student Workshop on Evolutionary Computation”. 2008.
G
M. Giacobini and van Hemert, J., “European Graduate Student Workshop on Evolutionary Computation”. Budapest, Hungary, 2006.
M. Giacobini and van Hemert, J., “European Graduate Student Workshop on Evolutionary Computation”. Valencia, Spain, 2007.
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 Urquhart, N. B., “Phase transition properties of clustered travelling salesman problem instances generated with evolutionary computation”, in LNCS, Birmingham, UK, 2004, vol. 3242, p. 150--159.
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 and la Poutré, J. A., “Dynamic Routing Problems with Fruitful Regions: Models and Evolutionary Computation”, in LNCS, Birmingham, UK, 2004, vol. 3242, p. 690--699.
J. van Hemert and Cotta, C., “Evolutionary Computation in Combinatorial Optimization, 8th European Conference”, Lecture Notes in Computer Science, vol. LNCS 4972. Springer, 2008.
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. 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. \'{a}n Juhos and van Hemert, J., “Graph Colouring Heuristics Guided by Higher Order Graph Properties”, in Lecture Notes in Computer Science, 2008, vol. 4972, p. 97--109.
K
M. Keijzer, Tettamanzi, A., Collet, P., van Hemert, J., and Tomassini, M., “Genetic Programming, Proceedings of the 8th European Conference”, Lecture Notes in Computer Science, vol. 3447. Springer, 2005.

      Creative Commons License