JiscMail Logo
Email discussion lists for the UK Education and Research communities

Help for MODERN-HEURISTICS Archives


MODERN-HEURISTICS Archives

MODERN-HEURISTICS Archives


MODERN-HEURISTICS@JISCMAIL.AC.UK


View:

Message:

[

First

|

Previous

|

Next

|

Last

]

By Topic:

[

First

|

Previous

|

Next

|

Last

]

By Author:

[

First

|

Previous

|

Next

|

Last

]

Font:

Proportional Font

LISTSERV Archives

LISTSERV Archives

MODERN-HEURISTICS Home

MODERN-HEURISTICS Home

MODERN-HEURISTICS  March 2015

MODERN-HEURISTICS March 2015

Options

Subscribe or Unsubscribe

Subscribe or Unsubscribe

Log In

Log In

Get Password

Get Password

Subject:

Workshop on Automatically Configurable Algorithmic Frameworks (GECCO 2015) (deadline April 3rd)

From:

Manuel López-Ibáñez <[log in to unmask]>

Reply-To:

Manuel López-Ibáñez <[log in to unmask]>

Date:

Mon, 23 Mar 2015 12:26:38 +0100

Content-Type:

text/plain

Parts/Attachments:

Parts/Attachments

text/plain (105 lines)

*******************************************************************************
                                 Call for Papers

          Workshop on AUTOMATICALLY CONFIGURABLE ALGORITHMIC FRAMEWORKS

                            to be held as part of the
          Genetic and Evolutionary Computation Conference (GECCO 2015)
                         July 11-15, 2015, Madrid, Spain
                             organized by ACM SIGEVO

                 http://iridia.ulb.ac.be/~fmascia/gecco2015_acaf
*******************************************************************************

The Workshop on "Automatically Configurable Algorithmic Frameworks" aims at
bringing together researchers, developers and end users of algorithmic
frameworks for solving optimization problems. The focus of the workshop will be
on the design, analysis and automatic configuration of such frameworks.

The proliferation of metaheuristics, including many types of local searches,
evolutionary algorithms, and swarm intelligence approaches, has given rise to
software frameworks that aim at generalizing and hybridizing diverse techniques
by combining components from different optimization algorithms. Examples of
such frameworks are PaGMO, ParadisEO, Shark, SATenstein, jMetal and the MOACO
framework. These frameworks are usually characterized by a large number of
parameters that allow selecting and configuring the behavior of specific
algorithmic components. A parameter configuration is, hence, an instantiation
of a particular optimization algorithm fine-tuned to a specific application
scenario.  Inevitably, the performance of the frameworks strongly depends on
their parameter settings and manually tuning such parameters is a hard and
tedious task for the algorithm designer. Moreover, the ability of the framework
to generate novel algorithm designs will depend on its flexibility when
combining algorithmic components.  Automatic configuration techniques
(parameter tuning) allow the algorithm designers to focus on the design of new
algorithmic components, and on how to combine them into a flexible
framework. The final algorithm design decisions will be taken by the automatic
configuration technique that will search in the algorithmic design space
defined by the framework for the best algorithm for the problem at hand.

The automatic configuration of algorithmic frameworks poses challenges in terms
of generalization of algorithmic components, identification of key components
to be tuned, algorithmic configuration methods, different types of abstraction
(top-down versus bottom-up), and automatic design approaches.

We invite researchers to submit their original and unpublished works on the
aforementioned challenges. In particular, we will welcome:

* Novel ideas on how to design, extend and analyze metaheuristics frameworks in
   order to enable automatic configuration and design.

* Proposals for new algorithmic frameworks designed to be automatically
   configured.

* Theoretical studies that propose generalized models of metaheuristics to be
   implemented in (new) flexible frameworks.

* Studies that analyze and evaluate the conceptual models underpinning existing
   frameworks.

* Experimental studies that compare the capabilities of existing frameworks to
   produce state-of-the-art algorithms for challenging optimization problems in
   an automatic fashion.


Important dates
---------------

    April 3, 2015	Submission deadline
   April 20, 2015	Notification of acceptance
      May 4, 2015	Submission of camera-ready
July 11-15, 2015	GECCO 2015 Conference


Submission Details
------------------

We invite submissions of papers in PDF format, not exceeding 8 pages, and 
formatted following the preparation instructions for GECCO 2015 full papers:

     http://www.sigevo.org/gecco-2015/papers.html#instructions

The review process of the workshop is not double-blind, thus papers should not 
be anonymous but contain full authorship details.

Papers should be submitted directly to both <[log in to unmask]> and
<[log in to unmask]>. All accepted papers will be presented at
the workshop and appear in the GECCO Conference Companion Proceedings
published by ACM.


Workshop Schedule
-----------------

The schedule will be announced at the workshop website:
http://iridia.ulb.ac.be/~fmascia/gecco2015_acaf


Organizers
----------

Franco Mascia <[log in to unmask]>
http://iridia.ulb.ac.be/~fmascia/

Manuel Lopez-Ibanez <[log in to unmask]>
http://iridia.ulb.ac.be/~manuel/

Top of Message | Previous Page | Permalink

JiscMail Tools


RSS Feeds and Sharing


Advanced Options


Archives

April 2024
March 2024
February 2024
January 2024
December 2023
November 2023
October 2023
September 2023
August 2023
July 2023
June 2023
May 2023
April 2023
March 2023
February 2023
January 2023
December 2022
November 2022
October 2022
September 2022
August 2022
July 2022
June 2022
May 2022
April 2022
March 2022
February 2022
January 2022
December 2021
November 2021
October 2021
September 2021
August 2021
July 2021
June 2021
May 2021
April 2021
March 2021
February 2021
January 2021
December 2020
November 2020
October 2020
September 2020
August 2020
July 2020
June 2020
May 2020
April 2020
March 2020
February 2020
January 2020
December 2019
November 2019
October 2019
September 2019
August 2019
July 2019
June 2019
May 2019
April 2019
March 2019
February 2019
January 2019
December 2018
November 2018
October 2018
September 2018
August 2018
July 2018
June 2018
May 2018
April 2018
March 2018
February 2018
January 2018
December 2017
November 2017
October 2017
September 2017
August 2017
July 2017
June 2017
May 2017
April 2017
March 2017
February 2017
January 2017
December 2016
November 2016
October 2016
September 2016
August 2016
July 2016
June 2016
May 2016
April 2016
March 2016
February 2016
January 2016
December 2015
November 2015
October 2015
September 2015
August 2015
July 2015
June 2015
May 2015
April 2015
March 2015
February 2015
January 2015
December 2014
November 2014
October 2014
September 2014
August 2014
July 2014
June 2014
May 2014
April 2014
March 2014
February 2014
January 2014
December 2013
November 2013
October 2013
September 2013
August 2013
July 2013
June 2013
May 2013
April 2013
March 2013
February 2013
January 2013
December 2012
November 2012
October 2012
September 2012
August 2012
July 2012
June 2012
May 2012
April 2012
March 2012
February 2012
January 2012
December 2011
November 2011
October 2011
September 2011
August 2011
July 2011
June 2011
May 2011
April 2011
March 2011
February 2011
January 2011
December 2010
November 2010
October 2010
September 2010
August 2010
July 2010
June 2010
May 2010
April 2010
March 2010
February 2010
January 2010
December 2009
November 2009
October 2009
September 2009
August 2009
July 2009
June 2009
May 2009
April 2009
March 2009
February 2009
January 2009
December 2008
November 2008
October 2008
September 2008
August 2008
July 2008
June 2008
May 2008
April 2008
March 2008
February 2008
January 2008
December 2007
November 2007
October 2007
September 2007
August 2007
July 2007
June 2007
May 2007
April 2007
March 2007
February 2007
January 2007
2006
2005
2004
2003
2002
2001
2000
1999
1998


JiscMail is a Jisc service.

View our service policies at https://www.jiscmail.ac.uk/policyandsecurity/ and Jisc's privacy policy at https://www.jisc.ac.uk/website/privacy-notice

For help and support help@jisc.ac.uk

Secured by F-Secure Anti-Virus CataList Email List Search Powered by the LISTSERV Email List Manager