Send dmanet mailing list submissions to
dmanet@zpr.uni-koeln.de
To subscribe or unsubscribe via the World Wide Web, visit
http://www.zaik.uni-koeln.de/mailman/listinfo/dmanet
or, via email, send a message with subject or body 'help' to
dmanet-request@zpr.uni-koeln.de
You can reach the person managing the list at
dmanet-owner@zpr.uni-koeln.de
When replying, please edit your Subject line so it is more specific
than "Re: Contents of dmanet digest..."
Today's Topics:
1. Call for Participation: The 2nd Cross-domain Heuristic Search
Challenge - CHeSC 2014 (Jose Carlos Ortiz Bayliss)
2. Call for Papers -- Seventh International Conference on FUN
WITH ALGORITHMS (FUN 2014) (Giuseppe Prencipe)
----------------------------------------------------------------------
Message: 1
Date: Fri, 29 Nov 2013 03:52:34 -0800 (PST)
From: Jose Carlos Ortiz Bayliss <jcobayliss@yahoo.com.mx>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] Call for Participation: The 2nd Cross-domain
Heuristic Search Challenge - CHeSC 2014
Message-ID:
<1385725954.20704.YahooMailBasic@web162104.mail.bf1.yahoo.com>
Content-Type: text/plain; charset=utf-8
[Please circulate to all those who might be interested, and accept our apologies if you received multiple copies of this announcement.]
The Second Cross-domain Heuristic Search Challenge - CHeSC 2014
www.hyflex.org/chesc2014/
The CHeSC series seeks to bring together practitioners from operational research, computer science and artificial intelligence who are interested in developing more general and reusable methods for automated search control; doing so using hyper-heuristics that can be applied without modification to solve a wide range of instances from different problem domains. In CHeSC 2011, the hyper-heuristic was used to solve each instance separately and independently in a fixed time.
CHeSC 2014 uses a "batch mode" in which the hyper-heuristic is given all the instances as a batch, together with a total time to solve them. As before, the hyper-heuristic then needs to decide how to use the supplied low-level heuristics (move/neighbourhood operators) for the problem domain in order to provide a solution for each instance in the batch. However, new challenges arise because the hyper-heuristic has the opportunity to:
* Decide how to allocate computational time between the instances
* Learn from some instances to be able to work better on others.
To support these, some limited information about features of each instance (size and ?kind?) is also made available to the hyper-heuristic.
The challenge is open now and with the deadline given below.
Competition Starts: 28 November 2013
Submission Deadline: 28 March 2014
Hence, you have four months to produce a "batch mode hyper-heuristic" that is able to solve a set of instances associated with multiple domains.
To encourage transition towards exploitation of multi-core machines, the competition has two tracks:
1) "Single-solver mode" - only one solver is allowed to run at a time.
2) "Multiple-solver mode" - multiple solvers are allowed to exploit the multiple cores of machine that will be used for evaluation.
In total, ?1,200 will be given as prizes to the implementers of top ranking algorithms in the competition.
Sponsors:
-The Automated Scheduling, Optimisation and Planning (ASAP) research group (www.asap.cs.nott.ac.uk)
-The LANCS Initiative (www.lancs-initiative.ac.uk)
Please consult the webpage www.hyflex.org/chesc2014/
If you have any questions, please do not hesitate to contact us at chesc2014@cs.nott.ac.uk
On behalf of the organisers,
Jose Carlos Ortiz-Bayliss
------------------------------
Message: 2
Date: Fri, 29 Nov 2013 14:26:42 +0100
From: Giuseppe Prencipe <prencipe@di.unipi.it>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] Call for Papers -- Seventh International Conference
on FUN WITH ALGORITHMS (FUN 2014)
Message-ID:
<CAEX5p9GRNE3GS41k+M6R6qM2JGhqN12+PBeKDc-8r=XKuS9sCQ@mail.gmail.com>
Content-Type: text/plain; charset=UTF-8
Apologies for multiple copies.
--------
FUN 2014
CALL FOR PAPERS
http://www.di.unipi.it/fun14
Seventh International Conference on FUN WITH ALGORITHMS
July 1-3, 2014, Lipari Island, Sicily, Italy
The Seventh International conference on Fun with Algorithms (FUN 2014)
is dedicated to the use, design, and analysis of algorithms and data
structures, focusing on results that provide amusing, witty but
nonetheless original and scientifically profound contributions to the
area. The previous FUNs were held in Elba Island, Italy; in
Castiglioncello, Tuscany, Italy; in Ischia Island, Italy; and in San
Servolo Island, Venice, Italy. Special issues of Theoretical Computer
Science, Discrete Applied Mathematics, and Theory of Computing Systems
were dedicated to them.
TOPICS OF INTEREST include (but are not limited to):
FUN with biological algorithms
FUN with combinatorial algorithms
FUN with cryptographic algorithms
FUN with distributed algorithms
FUN with game-theoretic algorithms
FUN with geometrical algorithms
FUN with graph algorithms
FUN with internet algorithms
FUN with mobile algorithms
FUN with optimization algorithms
FUN with parallel algorithms
FUN with randomized algorithms
FUN with robotics algorithms
FUN with space-conscious algorithms
FUN with string algorithms
FUN with visualization of algorithms
PROGRAM COMMITTEE
Je?re?mie Chalopin, LIF, CNRS & Aix Marseille Universite?
Pierluigi Crescenzi, University of Florence
Shantanu Das, Aix-Marseille Universite?
Josep Diaz, UPC Barcelona
Yann Disser, TU Berlin
Paolo Ferragina, University of Pisa
Fedor Fomin, University of Bergen
Pierre Fraigniaud, CNRS and University Paris Diderot
Leszek Gasieniec, University of Liverpool
Fabrizio Grandoni, IDSIA, University of Lugano
Evangelos Kranakis, Carleton University
Danny Krizanc, Wesleyan University
Flaminia Luccio, Ca' Foscari University of Venice
Matus Mihalak, ETH Zurich
Linda Pagli, University of Pisa
David Peleg, The Weizmann Institute
Paolo Penna, Autonomous Research, Ancona
Giuseppe Persiano, University of Salerno
Giuseppe Prencipe, University of Pisa
Jose Rolim, University of Geneva
Piotr Sankowski, University of Warsaw
Ryuhei Uehara, Japan Advanced Institute of Science and Technology
Jorge Urrutia, Universidad Nacional Auto?noma de Me?xico
Peter Widmayer (chair), ETH Zurich
Christos Zaroliagis, CTI and University of Patras
IMPORTANT DATES
Paper Submission: January 15, 2014
Acceptance Notification: February 28, 2014
Hotel reservation: March 31, 2014
Final version due: March 31, 2014
Conference: July 1-3, 2014
SUBMISSION DETAILS
A full paper should be submitted by January 15, 2014 following the
submission link given at the FUN 2014 web site. Manuscripts should not
exceed 12 pages. Authors of accepted papers are expected to present
their work at the conference.
PUBLICATIONS
Conference proceedings will be published by Springer in the LNCS
series. A special issue of Theoretical Computer Science will be
dedicated to a selected set of papers.
ADDITIONAL DETAILS
Additional details can be found in the conference web page:
http://www.di.unipi.it/fun14
Conference Chairs: Alfredo Ferro and Fabrizio Luccio
PC Chair: Peter Widmayer
------------------------------
Subject: Digest Footer
_______________________________________________
dmanet mailing list
dmanet@zpr.uni-koeln.de
http://www.zaik.uni-koeln.de/mailman/listinfo/dmanet
------------------------------
End of dmanet Digest, Vol 69, Issue 24
**************************************
No comments:
Post a Comment