Publications in cv.bib - page 5 [rss]

[45] | Evolutionary Computation in Combinatorial Optimization, 7th European Conference, (C. Cotta, J.I. van Hemert, eds.), Springer, volume LNCS 4446, 2007. [bib] [pdf] |

2006 | |

[44] | Increasing the efficiency of graph colouring algorithms with a representation based on vector operations , In Journal of Software, volume 1, 2006. [bib] |

[43] | Improving Graph Colouring Algorithms and Heuristics Using a Novel Representation , In Evolutionary Computation in Combinatorial Optimization (J. Gottlieb, G. Raidl, eds.), Springer, 2006. [bib] [doi] |

[42] | Evolving combinatorial problem instances that are difficult to solve , In Evolutionary Computation, volume 14, 2006. [bib] [pdf] |

[41] | 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 (Maarten Keijzer et al., ed.), ACM, volume 2, 2006. [bib] [pdf] |

[40] | European Graduate Student Workshop on Evolutionary Computation, (M. Giacobini, J.I. van Hemert, eds.), 2006. [bib] |

2005 | |

[39] | Heuristic Colour Assignment Strategies for Merge Models in Graph Colouring , In Evolutionary Computation in Combinatorial Optimization (G. Raidl, J. Gottlieb, eds.), Springer, 2005. [bib] |

[38] | Property analysis of symmetric travelling salesman problem instances acquired through evolution , In Evolutionary Computation in Combinatorial Optimization (G. Raidl, J. Gottlieb, eds.), Springer, 2005. [bib] |

[37] | 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] |

[36] | Complexity Transitions in Evolutionary Algorithms: Evaluating the impact of the initial population , In Proceedings of the Congress on Evolutionary Computation, IEEE Press, 2005. [bib] |

[35] | Transition Models as an incremental approach for problem solving in Evolutionary Algorithms , In Proceedings of the Genetic and Evolutionary Computation Conference (H.-G. Beyer et al., ed.), ACM Press, 2005. [bib] [pdf] |

[34] | Evolutionary Transitions as a Metaphor for Evolutionary Optimization , In Advances in Artificial Life (M. Capcarrere, A.A. Freitas, P.J. Bentley, C.G. Johnson, J. Timmis, eds.), Springer, 2005. [bib] [doi] |

2004 | |

[33] | Binary Merge Model Representation of the Graph Colouring Problem , In Evolutionary Computation in Combinatorial Optimization (J. Gottlieb, G. Raidl, eds.), Springer, 2004. [bib] |

[32] | Phase transition properties of clustered travelling salesman problem instances generated with evolutionary computation , 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] |

[31] | A Study into Ant Colony Optimization, Evolutionary Computation and Constraint Programming on Binary Constraint Satisfaction Problems , In Evolutionary Computation in Combinatorial Optimization (J. Gottlieb, G. Raidl, eds.), Springer, 2004. [bib] |

[30] | Dynamic Routing Problems with Fruitful Regions: Models and Evolutionary Computation , 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] |

[29] | Robust parameter settings for variation operators by measuring the resampling ratio: A study on binary constraint satisfaction problems , In Journal of Heuristics, volume 10, 2004. [bib] |

2003 | |

[28] | A new permutation model for solving the graph k-coloring problem , In Kalmàr Workshop on Logic and Computer Science, 2003. [bib] |

[27] | Evolving binary constraint satisfaction problem instances that are difficult to solve , In Proceedings of the IEEE 2003 Congress on Evolutionary Computation, IEEE Press, 2003. [bib] |

[26] | Comparing Evolutionary Algorithms on Binary Constraint Satisfaction Problems , In IEEE Transactions on Evolutionary Computation, volume 7, 2003. [bib] [pdf] |

2002 | |

[25] | Use of Evolutionary Algorithms for Telescope Scheduling , In Integrated Modeling of Telescopes (Torben Anderson, ed.), The International Society for Optical Engineering (SPIE), volume 4757, 2002. [bib] |

[24] | Application of Evolutionary Computation to Constraint Satisfaction and Data Mining , PhD thesis, Leiden University, 2002. (ISBN: 90-6734-057-X) [bib] |

[23] | Comparing Classical Methods for Solving Binary Constraint Satisfaction Problems with State of the Art Evolutionary Computation , In Applications of Evolutionary Computing (S. Cagnoni, J. Gottlieb, E. Hart, M. Middendorf, G. Raidl, eds.), Springer, 2002. [bib] |

[22] | Measuring the Searched Space to Guide Efficiency: The Principle and Evidence on Constraint Satisfaction , 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 | |

[21] | A ``Futurist'' approach to dynamic environments , Technical report, Leiden University, 2001. [bib] |

Powered by bibtexbrowser