Illinois Genetic Algorithms Lab http://illigal.org Life, Liberty, and the Pursuit of Genetic Algorithms Fri, 19 Nov 2010 04:39:45 +0000 en-US hourly 1 http://wordpress.org/?v=3.5.1 GECCO 2011: Call for Papers http://illigal.org/2010/11/18/gecco-2011-call-for-papers/ http://illigal.org/2010/11/18/gecco-2011-call-for-papers/#comments Fri, 19 Nov 2010 04:39:45 +0000 xavier http://illigal.org/?p=2265 Continue reading →]]> The Genetic and Evolutionary Computation Conference (GECCO-2011) is now inviting paper submissions for the conference to be held in Dublin, Ireland, July 12-16, 2011. GECCO-2011 will present the latest high-quality results in the growing field of genetic and evolutionary computation. A complete call for paper for GECCO 2011 can be found here. More information about GECCO 2011 can be found on the conference website, Twitter, and Facebook. The paper submission deadline is January 26, 2011.

]]> http://illigal.org/2010/11/18/gecco-2011-call-for-papers/feed/ 0 GECCO 2011 competitions are here http://illigal.org/2010/11/10/gecco-2011-competitions-are-here/ http://illigal.org/2010/11/10/gecco-2011-competitions-are-here/#comments Wed, 10 Nov 2010 06:57:24 +0000 xavier http://illigal.org/?p=2262 The GECCO 2011 website has been updated with detailed information of this year’s competitions. Interested? Here is the list of open competitions:

  • Demolition derby
  • Evolutionary art
  • GPUs for genetic and evolutionary computation
  • Simulated car racing championship
  • Visualizing evolution
]]> http://illigal.org/2010/11/10/gecco-2011-competitions-are-here/feed/ 0 GECCO-2011: Call for New Frontiers Track Proposals http://illigal.org/2010/06/08/gecco-2011-call-for-new-frontiers-track-proposals/ http://illigal.org/2010/06/08/gecco-2011-call-for-new-frontiers-track-proposals/#comments Wed, 09 Jun 2010 02:47:36 +0000 xavier http://illigal.org/2010/06/08/gecco-2011-call-for-new-frontiers-track-proposals/ Continue reading →]]> 2011 Genetic and Evolutionary Computation Conference (GECCO-2011)July 12-16, Dublin, IrelandOrganized by ACM SIGEVO20th International Conference on Genetic Algorithms (ICGA) and the16th Annual Genetic Programming Conference (GP)One Conference – Many Mini-Conferences‚ 15 Program TracksThe organization of GECCO 2011 is well underway and we are happy to announce a very exciting program of tracks:
  • Ant Colony Optimization and Swarm Intelligence
  • Artificial Life, Evolutionary Robotics,
  • Adaptive Behaviour and Evolvable Hardware
  • Bioinformatics, Computational, Systems and Synthetic Biology
  • Estimation of Distribution Algorithms
  • Evolutionary Strategies, Evolutionary Programming
  • Evolutionary (& Metaheuristics) Combinatorial Optimisation
  • Evolutionary Multiobjective Optimisation
  • Generative and Developmental Systems
  • Genetic Algorithms
  • Genetic Programming
  • Genetics-Based Machine Learning
  • Parallel Evolutionary Systems
  • Real World Applications
  • Search Based Software Engineering
  • Theory

For GECCO-2011, we wish to expand the list of usual tracks with one New Frontiers Tracks (NFTs). The goal of New Frontiers Tracks is to allow our community to explore emerging, exciting new ideas that relate or impinge into Genetic and Evolutionary Computation and Natural Computing.Thus, we are delighted to invite for NFTs proposals.

NEW FRONTIERS TRACK PROPOSAL FORMAT

Proposals should include a track title, the list of up to two co-chairs and an abstract of max 1000 characters. The abstract should both (i) describe the track focus and (ii) point out why the track should be added to GECCO.

SUBMISSION

Proposals for NFTs should be submitted to Natalio Krasnogor (Natalio.Krasnogor@Nottingham.ac.uk) with subject‚ “GECCO 2011 NFT Proposal”‚ not later than 30th June 2010.

SELECTION

The list of all NFTs will be in display at GECCO 2010 and a ballot (details to be announced later) will be carried out during GECCO 2010.Prospective chairs will be allowed to submit a one minute video to support their track. The videos will be put on-line on the GECCO-2011 website.The most voted NFT will be selected for inclusion into GECCO 2011 program. The selected NFT will have the same status, editorial procedures and quality control as normal GECCO tracks. NFTs are expected to run for one year only.We believe this to be an exciting opportunity for the community to explore innovative, perhaps risky & adventurous research topics, within the framework of the top conference in the field. Hence, we very much look forward for a strong response from the community to this call for New Frontiers Track proposals!

Natalio Krasnogor (GECCO 2011, Editor-in-chief) & Pier Luca Lanzi (GECCO 2011, General Chair)

GECCO is sponsored by the Association for Computing Machinery Special Interest Group for Genetic and Evolutionary Computation (ACM SIGEVO).

You can follow GECCO 2011  on Twitter at @GECCO2011, join us at GECCO 2011 FaceBook group or Wave with us.

]]> http://illigal.org/2010/06/08/gecco-2011-call-for-new-frontiers-track-proposals/feed/ 0 SIGEVOlution Volume 5 Issue 1 http://illigal.org/2010/05/27/sigevolution-volume-5-issue-1/ http://illigal.org/2010/05/27/sigevolution-volume-5-issue-1/#comments Thu, 27 May 2010 07:51:55 +0000 lanzi http://illigal.org/2010/05/27/sigevolution-volume-5-issue-1/ Continue reading →]]> Dublin

The new issue of SIGEVOlution is now available for you to download from:
http://www.sigevolution.org

The issue features:

  • EC Testing of Embedded Systems by Peter M. Kruse, Joachim Wegener
    and Stefan Wappler
  • Competitions @ GECCO-2010 by Christian Gagné
  • Events reports: NICSO-2010 by David Pelta
  • Dissertation corner
  • New issues of journals
  • Calls & calendar

The newsletter is intended to be viewed electronically.

Pier Luca Lanzi (EIC)

]]> http://illigal.org/2010/05/27/sigevolution-volume-5-issue-1/feed/ 0 Loopy Substructural Local Search for the Bayesian Optimization Algorithm http://illigal.org/2010/04/08/loopy-substructural-local-search-for-the-bayesian-optimization-algorithm/ http://illigal.org/2010/04/08/loopy-substructural-local-search-for-the-bayesian-optimization-algorithm/#comments Thu, 08 Apr 2010 14:09:38 +0000 admin http://illigal.org/category/technical-reports/2010/04/08/loopy-substructural-local-search-for-the-bayesian-optimization-algorithm/ Continue reading →]]> This paper presents a local search method for the Bayesian optimization algorithm (BOA) based on the concepts of substructural neighborhoods and loopy belief propagation. The proba- bilistic model of BOA, which automatically identifies important problem substructures, is used to define the topology of the neighborhoods explored in local search. On the other hand, belief propagation in graphical models is employed to find the most suitable configuration of conflicting substructures. The results show that performing loopy substructural local search (SLS) in BOA can dramatically reduce the number of generations necessary to converge to optimal solutions and thus provides substantial speedups.

]]> http://illigal.org/2010/04/08/loopy-substructural-local-search-for-the-bayesian-optimization-algorithm/feed/ 0 Model Accuracy in the Bayesian Optimization Algorithm http://illigal.org/2010/04/08/model-accuracy-in-the-bayesian-optimization-algorithm/ http://illigal.org/2010/04/08/model-accuracy-in-the-bayesian-optimization-algorithm/#comments Thu, 08 Apr 2010 14:08:00 +0000 admin http://illigal.org/category/technical-reports/2010/04/08/model-accuracy-in-the-bayesian-optimization-algorithm/ Continue reading →]]> Evolutionary algorithms (EAs) are particularly suited to solve problems for which there is not much information available. From this standpoint, estimation of distribution algorithms (EDAs), which guide the search by using probabilistic models of the population, have brought a new view to evolutionary computation. While solving a given problem with an EDA, the user has access to a set of models that reveal probabilistic dependencies between variables, an important source of information about the problem. However, as the complexity of the used models increases, the chance of overfitting and consequently reducing model interpretability, increases as well.This paper investigates the relationship between the probabilistic models learned by the Bayesian optimization algorithm (BOA) and the underlying problem structure. The purpose of the paper is threefold. First, model building in BOA is analyzed to understand how the problem structure is learned. Second, it is shown how the selection operator can lead to model overfitting in Bayesian EDAs. Third, the scoring metric that guides the search for an adequate model structure is modified to take into account the non-uniform distribution of the mating pool generated by tournament selection. Overall, this paper makes a contribution towards understanding and improving model accuracy in BOA, providing more interpretable models to assist efficiency enhancement techniques and human researchers.

]]> http://illigal.org/2010/04/08/model-accuracy-in-the-bayesian-optimization-algorithm/feed/ 0 Scaling eCGA Model Building via Data-Intensive Computing http://illigal.org/2010/04/08/scaling-ecga-model-building-via-data-intensive-computing/ http://illigal.org/2010/04/08/scaling-ecga-model-building-via-data-intensive-computing/#comments Thu, 08 Apr 2010 14:05:29 +0000 admin http://illigal.org/category/technical-reports/2010/04/08/scaling-ecga-model-building-via-data-intensive-computing/ Continue reading →]]> This paper shows how the extended compact genetic algorithm can be scaled using data- intensive computing techniques such as MapReduce. Two different frameworks (Hadoop and MongoDB) are used to deploy MapReduce implementations of the compact and extended com- pact genetic algorithms. Results show that both are good choices to deal with large-scale problems as they can scale with the number of commodity machines, as opposed to previous ef- forts with other techniques that either required specialized high-performance hardware or shared memory environments.

]]> http://illigal.org/2010/04/08/scaling-ecga-model-building-via-data-intensive-computing/feed/ 0 Live from Dublin http://illigal.org/2010/04/08/live-from-dublin/ http://illigal.org/2010/04/08/live-from-dublin/#comments Thu, 08 Apr 2010 07:05:21 +0000 admin http://illigal.org/2010/04/08/live-from-dublin/ Continue reading →]]> IlliGAL director David E. Goldberg is tweeting live from the IEEE Conference on Transforming Engineering Education at Dublin.  Right now there is a panel discussing whether transformation is needed and if so what needs to be transformed.  Follow the thread at www.twitter.com/deg511.

]]> http://illigal.org/2010/04/08/live-from-dublin/feed/ 0 SIGEVOlution Volume 4 Issue 4 http://illigal.org/2010/03/29/sigevolution-volume-4-issue-4/ http://illigal.org/2010/03/29/sigevolution-volume-4-issue-4/#comments Mon, 29 Mar 2010 15:35:26 +0000 lanzi http://illigal.org/2010/03/29/sigevolution-volume-4-issue-4/ Continue reading →]]> Galactic Arms Race

The new issue of SIGEVOlution is now available for you to download from:
http://www.sigevolution.org

The issue features:

  • Galactic Arms Race by Erin J. Hastings and Kenneth O. Stanley
  • A Perl Primer for EA Practitioners by Juan-Julián Merelo
  • New issues of journals
  • Calls & calendar

The newsletter is intended to be viewed electronically.

Pier Luca Lanzi (EIC)

]]> http://illigal.org/2010/03/29/sigevolution-volume-4-issue-4/feed/ 0 The perils and pleasures of interdisciplinarity http://illigal.org/2010/03/18/the-perils-and-pleasures-of-interdisciplinarity/ http://illigal.org/2010/03/18/the-perils-and-pleasures-of-interdisciplinarity/#comments Thu, 18 Mar 2010 11:58:37 +0000 admin http://illigal.org/2010/03/18/the-perils-and-pleasures-of-interdisciplinarity/ Continue reading →]]> IlliGAL director David E. Goldberg just gave a talk on “The Perils and Pleasures of Interdisciplinarity” at a Workshop on the Challenges in Top-Down, Bottom-up and Computational Approaches in Synthetic Biology.  The talk is available in the viewer below:

Related talks are available here.

]]> http://illigal.org/2010/03/18/the-perils-and-pleasures-of-interdisciplinarity/feed/ 1