Loading ...
Sorry, an error occurred while loading the content.

Final CFP: OBUPM 2008, Optimization by Building and Using Probabilistic Models

Expand Messages
  • hauschildm
    WORKSHOP ON OPTIMIZATION BY BUILDING AND USING PROBABILISTIC MODELS (OBUPM-2010) to be held as part of the 2010 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE
    Message 1 of 1 , Mar 18 12:31 PM
    • 0 Attachment
      WORKSHOP ON OPTIMIZATION BY BUILDING AND USING
      PROBABILISTIC MODELS (OBUPM-2010)

      to be held as part of the

      2010 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE (GECCO-2010)
      Sponsored by ACM SIGEVO

      http://www.sigevo.org/GECCO-2010

      July 7-11, 2008 (Wednesday-Sunday)
      Portland Marriott Downtown Waterfront Hotel
      Portland, Oregon, USA

      PAPER SUBMISSION DEADLINE FOR WORKSHOP: March 25, 2010


      Genetic and evolutionary algorithms (GEAs) evolve a population of
      candidate solutions to a given optimization problem using two basic
      operators: (1) selection and (2) variation. Selection introduces a
      pressure toward high-quality solutions, whereas variation ensures
      exploration of the space of all potential solutions. Two variation
      operators are common in current genetic- and evolutionary computation
      (GEC): (1) crossover, and (2) mutation. Crossover creates new
      candidate solutions by combining bits and pieces of promising
      solutions, whereas mutation introduces slight perturbations to
      promising solutions to explore their immediate neighborhood. However,
      fixed, problem-independent variation operators often fail to
      effectively exploit important features of high-quality selected
      solutions. One way to make variation operators more powerful and
      flexible is to replace traditional variation of GEAs by the
      following two steps: 1. Build a probabilistic model of the selected
      promising solutions, and 2. sample the built model to generate a new
      population of candidate solutions. Algorithms based on this principle
      are commonly called probabilistic model-building genetic algorithms
      (PMBGAs) but are also known as estimation-of-distribution algorithms
      (EDAs) and as iterated density-estimation evolutionary algorithms
      (IDEAs).

      The general purpose of this workshop is to present and discuss

      * recent advances in PMBGAs,
      * new theoretical and empirical results,
      * applications of PMBGA, and
      * promising directions for future PMBGA research.

      We invite submissions on any of these topics, as well as any material
      on related research areas (such as the cross-entropy methods or
      quantum-inspired evolution).



      SUBMITTING TO OBUPM-2010
      ========================
      The workshop will feature a series of selected presentations.
      To submit your contribution, send your ACM-formatted paper in
      Postscript or PDF by e-mail to Mark W. Hauschild at
      mwh308@.... Papers should not exceed the limit of
      8 pages and must meet with deadline of the workshop (see important
      dates for details). In case you can not submit your paper
      electronically, please contact one of the workshop chairs.

      Please note that all contributions must abide ACM formatting
      rules because all contributions will be on the conference CD
      as well as in the ACM digital library. Failing to comply with
      the ACM formatting rules will result in exclusion from the
      proceedings. Visit http://www.sigevo.org/gecco-2010/papers.html
      for formatting details.


      IMPORTANT DATES FOR OBUPM-2010
      ==============================
      March 25, 2010: Paper submission deadline

      April 1, 2010: Notification of acceptance

      April 13, 2010: Camera ready files due

      April 19, 2010: Registration deadline for presenting authors

      April 23, 2010: Registration advance rate ends

      WEBSITE
      =======

      The workshop program and further information can be found online. Please
      check http://medal.cs.umsl.edu/obupm-2010 regularly for the latest
      information. In case you have any questions, please contact one of the
      workshop organizers.

      We are looking forward to meeting you at OBUPM-2010!


      WORKSHOP ORGANIZERS
      ===================

      Mark Hauschild
      Missouri Estimation of Distribution Algorithms Laboratory (MEDAL)
      Department of Mathematics and Computer Science
      University of Missouri at St. Louis
      One University Blvd., St.Louis, MO 63121
      Email: mwh308@...

      Martin Pelikan
      Missouri Estimation of Distribution Algorithms Laboratory (MEDAL)
      Department of Mathematics and Computer Science
      University of Missouri at St. Louis
      One University Blvd., St. Louis, MO 63121
      Email: pelikan@...


      GECCO is sponsored by the Association for Computing Machinery Special
      Interest Group on Genetic and Evolutionary Computation (SIGEVO). SIG
      Services: 2 Penn Plaza, Suite 701, New York, NY, 10121, USA,
      1-800-342-6626 (USA and Canada) or +212-626-0500 (Global).
    Your message has been successfully submitted and would be delivered to recipients shortly.