Publications in cv.bib - page 4 [rss]
2005
[41] Heuristic Colour Assignment Strategies for Merge Models in Graph Colouring (I. Juhos, A. Tóth, J.I. van Hemert), In Evolutionary Computation in Combinatorial Optimization (G. Raidl, J. Gottlieb, eds.), Springer, 2005. [bib]
[40] Property analysis of symmetric travelling salesman problem instances acquired through evolution (J.I. van Hemert), In Evolutionary Computation in Combinatorial Optimization (G. Raidl, J. Gottlieb, eds.), Springer, 2005. [bib]
[39] Genetic Programming, Proceedings of the 8th European Conference, (M. Keijzer, A. Tettamanzi, P. Collet, J. van Hemert, M. Tomassini, eds.), Springer, volume 3447, 2005. [bib] [pdf]
[38] Complexity Transitions in Evolutionary Algorithms: Evaluating the impact of the initial population (A. Defaweux, T. Lenaerts, J.I. van Hemert, J. Parent), In Proceedings of the Congress on Evolutionary Computation, IEEE Press, 2005. [bib]
[37] Transition Models as an incremental approach for problem solving in Evolutionary Algorithms (A. Defaweux, T. Lenaerts, J.I. van Hemert, J. Parent), In Proceedings of the Genetic and Evolutionary Computation Conference (H.-G. Beyer et al., ed.), ACM Press, 2005. [bib] [pdf]
[36] Evolutionary Transitions as a Metaphor for Evolutionary Optimization (A. Defaweux, T. Lenaerts, J.I. van Hemert), In Advances in Artificial Life (M. Capcarrere, A.A. Freitas, P.J. Bentley, C.G. Johnson, J. Timmis, eds.), Springer, 2005. [bib]
2004
[35] Binary Merge Model Representation of the Graph Colouring Problem (I. Juhos, A. Tóth, J.I. van Hemert), In Evolutionary Computation in Combinatorial Optimization (J. Gottlieb, G. Raidl, eds.), Springer, 2004. [bib]
[34] Phase transition properties of clustered travelling salesman problem instances generated with evolutionary computation (J.I. van Hemert, N.B. Urquhart), In Parallel Problem Solving from Nature (Xin Yao, Edmund Burke, Jose A. Lozano, Jim Smith, Juan J. Merelo-Guervós, John A. Bullinaria, Jonathan Rowe, Peter Ti\vno Ata Kabán, Hans-Paul Schwefel, eds.), Springer, volume 3242, 2004. [bib] [pdf]
[33] A Study into Ant Colony Optimization, Evolutionary Computation and Constraint Programming on Binary Constraint Satisfaction Problems (J.I. van Hemert, C. Solnon), In Evolutionary Computation in Combinatorial Optimization (J. Gottlieb, G. Raidl, eds.), Springer, 2004. [bib]
[32] Dynamic Routing Problems with Fruitful Regions: Models and Evolutionary Computation (J.I. van Hemert, J.A. la Poutré), In Parallel Problem Solving from Nature (Xin Yao, Edmund Burke, Jose A. Lozano, Jim Smith, Juan J. Merelo-Guervós, John A. Bullinaria, Jonathan Rowe, Peter Ti\vno Ata Kabán, Hans-Paul Schwefel, eds.), Springer, volume 3242, 2004. [bib]
[31] Robust parameter settings for variation operators by measuring the resampling ratio: A study on binary constraint satisfaction problems (J.I. van Hemert, T. Bäck), In Journal of Heuristics, volume 10, 2004. [bib]
2003
[30] A new permutation model for solving the graph k-coloring problem (I. Juhos, A. Tóth, M. Tezuka, P. Tann, J.I. van Hemert), In Kalmàr Workshop on Logic and Computer Science, 2003. [bib]
[29] Evolving binary constraint satisfaction problem instances that are difficult to solve (J.I. van Hemert), In Proceedings of the IEEE 2003 Congress on Evolutionary Computation, IEEE Press, 2003. [bib]
[28] Comparing Evolutionary Algorithms on Binary Constraint Satisfaction Problems (B.G.W. Craenen, A.E. Eiben, J.I. van Hemert), In IEEE Transactions on Evolutionary Computation, volume 7, 2003. [bib] [pdf]
2002
[27] Use of Evolutionary Algorithms for Telescope Scheduling (R. Grim, M.L.M. Jansen, A. Baan, J.I. van Hemert, H. de Wolf), In Integrated Modeling of Telescopes (Torben Anderson, ed.), The International Society for Optical Engineering (SPIE), volume 4757, 2002. [bib]
[26] A Scriptable Planner, Using Python as a problem definition language (J.F. Jacob), Master's thesis, Leiden University, 2002. [bib]
[25] Application of Evolutionary Computation to Constraint Satisfaction and Data Mining (J.I. van Hemert), PhD thesis, Leiden University, 2002. (ISBN: 90-6734-057-X) [bib]
[24] Comparing Classical Methods for Solving Binary Constraint Satisfaction Problems with State of the Art Evolutionary Computation (J.I. van Hemert), In Applications of Evolutionary Computing (S. Cagnoni, J. Gottlieb, E. Hart, M. Middendorf, G. Raidl, eds.), Springer, 2002. [bib]
[23] Measuring the Searched Space to Guide Efficiency: The Principle and Evidence on Constraint Satisfaction (J.I. van Hemert, T. Bäck), In Parallel Problem Solving from Nature (J.J. Merelo, A. Panagiotis, H.-G. Beyer, José-Luis Fernández-Villacañas, Hans-Paul Schwefel, eds.), Springer, 2002. [bib]
2001
[22] A ``Futurist'' approach to dynamic environments (J.I. van Hemert, C. Van Hoyweghen, E. Lukschandl, K. Verbeeck), Technical report, Leiden University, 2001. [bib]
[21] An Engineering Approach to Evolutionary Art (J.I. van Hemert, M.L.M. Jansen), Technical report, Leiden University, 2001. [bib]
[20] A Scheduling Simulator for LOFAR (M.L.M. Jansen), Master's thesis, Leiden University, 2001. [bib]
[19] An Engineering Approach to Evolutionary Art (J.I. van Hemert, M.L.M. Jansen), In Proceedings of the Genetic and Evolutionary Computation Conference (Lee Spector, Erik D. Goodman, Annie Wu, W.B. Langdon, Hans-Michael Voigt, Mitsuo Gen, Sandip Sen, Marco Dorigo, Shahram Pezeshk, Max H. Garzon, Edmund Burke, eds.), Morgan Kaufmann Publishers, 2001. [bib]
[18] A ``Futurist'' approach to dynamic environments (J.I. van Hemert, C. Van Hoyweghen, E. Lukschandl, K. Verbeeck), In Proceedings of the Workshops at the Genetic and Evolutionary Computation Conference, Dynamic Optimization Problems (J. Branke, Th. Bäck, eds.), Morgan Kaufmann Publishers, 2001. [bib]
[17] Evolutionary Computation in Constraint Satisfaction and Machine Learning --- An abstract of my PhD. (J.I. van Hemert), In Proceedings of the Brussels Evolutionary Algorithms Day (BEAD-2001) (Anne Defaweux, Bernard Manderick, Tom Lenearts, Johan Parent, Piet van Remortel, eds.), Vrije Universiteit Brussel (VUB), 2001. [bib]
Powered by bibtexbrowser