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: Author is van Hemert, J. I.  [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 
H
J. I. van Hemert and Baldock, R. A., “Mining spatial gene expression data for association rules”, in Lecture Notes in Bioinformatics, 2007, p. 66--76.
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, “Property analysis of symmetric travelling salesman problem instances acquired through evolution”, in Springer Lecture Notes on Computer Science, 2005, p. 122--131.
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 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. 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 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, “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. 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, “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, “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 and Jansen, M. L. M., “An Engineering Approach to Evolutionary Art”, in Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2001), 2001, p. 177.
J. I. van Hemert, Van Hoyweghen, C., Lukschandl, E., and Verbeeck, K., “A ``Futurist'' approach to dynamic environments”, in Proceedings of the Workshops at the Genetic and Evolutionary Computation Conference, Dynamic Optimization Problems, 2001, p. 35--38.
J. I. van Hemert, “De Creatieve Computer”, AIgg Kennisgeving, vol. 13, p. 10--18, 2000.
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 Eiben, A. E., “Mondriaan Art by Evolution”, in Proceedings of the Eleventh Belgium/Netherlands Conference on Artificial Intelligence (BNAIC'99), 1999, p. 291--292.
J. I. van Hemert and Baldock, R. A., “Matching Spatial Regions with Combinations of Interacting Gene Expression Patterns”, in Communications in Computer and Information Science, 2008, p. 347--361.
J. I. van Hemert and la Poutré, J. A., “Exploiting Fruitful Regions in Dynamic Routing using Evolutionary Computation”, in Studies in Computational Intelligence , vol. 161, F. Pereira Babtista and Tavares, J., Eds. Springer, 2009, p. 131--149.
J. I. van Hemert and Koetsier, J., “Giving Computational Science a Friendly Face”, Zero-In, vol. 1, no. 3, p. 12--13, 2009.

      Creative Commons License