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. 2nd Call for Competition on Permutation-based Combinatorial
Optimization Problems in GECCO 2014 (Leticia Hernando)
2. FSTTCS 2014-- First Call for Papers (Venkatesh Raman)
----------------------------------------------------------------------
Message: 1
Date: Tue, 13 May 2014 12:03:20 +0200
From: Leticia Hernando <leticia.hernando@ehu.es>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] 2nd Call for Competition on Permutation-based
Combinatorial Optimization Problems in GECCO 2014
Message-ID: <CA83FF8B-E898-4BF1-9E7E-FFD9F6A1AE8A@ehu.es>
Content-Type: text/plain; charset=us-ascii
------------------------------------------------------------------------------------------------------
Please accept our apologies if you receive multiple copies of this email.
-------------------------------------------------------------------------------------------------------
2nd Call for the participation in the upcoming Competition on Permutation-based
Combinatorial Optimization Problems to be held at the Genetic and Evolutionary Computation
Conference (GECCO-2014), July 12th-16th, 2014, in Vancouver, British Columbia, Canada.
-------------------------------------------- Home Page --------------------------------------------
http://www.sc.ehu.es/ccwbayes/Competition_GECCO2014/index.html
----------------------------------------- Important Dates -------------------------------------------
Code Release: March 1, 2014.
Submissions: June 1, 2014.
Publication: July 12-16, 2014.
--------------------------------------------- Description ---------------------------------------------
This competition is designed with the objective of providing a first overview of the current
state-of-the-art metaheuristic algorithms for solving permutation-based optimization problems.
In the last years, the analysis and solution of these permutation-based combinatorial optimization
problems has become one of the most challenging fields in mathematics as well as in computer
science. Many works in the literature have provided exact, heuristic and metaheuristic algorithms
for solving specific permutation-problems, but usually these works are compared with a low
number of problems and algorithms. In this sense, the aim of the competition is to evaluate and
compare as many algorithms as possible, on a wide set of problems. In this regard, the competition
organizers provide a code framework and a benchmark of a broad set of instances of classical
combinatorial optimization problems:
- Traveling Salesman Problem (TSP),
- Permutation Flowshop Scheduling Problem (PFSP),
- Linear Ordering Problem (LOP),
- Quadratic Assignment Problem (QAP).
In addition, we propose a benchmark of artificially generated instances, where each instance
has been customized in relation with the number of local optima and the size of the attraction
basins, in order to describe specific shape landscapes.
Both code framework and instances are available at the homepage of the competition.
Even though there is no restriction about the type of algorithm to submit, we encourage
competitors to propose innovative and efficient algorithms, so that this competition can be
a forum for new ideas.
------------------------------------------------- Results -----------------------------------------
As a result of the competition, a report with results, statistical analysis and discussion on the
submitted proposals to the GECCO 2014 Competition on Permutation-based Combinatorial
Optimization Problems will be published. The finalists selected by the organizers will be
invited to present their submission at the competition session, to be held during the GECCO
2014 conference. The winner of the competition will be announced at the end of this session.
-------------------------------------------------------------------------------------------------------
The guidelines of the competition, the submission details and all the information needed to
participate can be found at the homepage of the competition:
http://www.sc.ehu.es/ccwbayes/Competition_GECCO2014/index.html
or by contacting the organizers by email at:
competition.gecco2014@ehu.es
-------------------------------------------------------------------------------------------------------
It would be greatly appreciated if news of this event could be passed on to any colleagues who
might be interested in submitting contributions to the Competition on Permutation-based
Combinatorial Optimization Problems.
This is a very innovative competition and the resulting conclusions will be a useful tool for the
scientific community! We look forward to your proposal!
--------------------------------------- Organization Committee -------------------------------
Leticia Hernando, *
Josu Ceberio, * Intelligent Systems Group
Alexander Mendiburu, * University of the Basque Country (UPV/EHU)
Jose A. Lozano, *
------------------------------
Message: 2
Date: Tue, 13 May 2014 07:40:52 -0400
From: "Venkatesh Raman" <vraman@imsc.res.in>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] FSTTCS 2014-- First Call for Papers
Message-ID:
<344c94947cf9149bfe8503983497d1cc.squirrel@www.imsc.res.in>
Content-Type: text/plain;charset=iso-8859-1
FSTTCS 2014
34th Foundations of Software Technology and Theoretical Computer Science
December 15--17, 2014
India International Centre, New Delhi, India
First Call for Papers
---------------------
IARCS, the Indian Association for Research in Computing Science, announces
the 34th Foundations of Software Technology and Theoretical Computer
Science conference at India International Centre, New Delhi, India.
The FSTTCS conference is a forum for presenting original results in
foundational aspects of Computer Science and Software Technology.
Representative areas include, but are not limited to, the following.
Algorithms and data structures
randomized algorithms
approximation algorithms
distributed algorithms
geometric algorithms
online and streaming algorithms
fixed-parameter tractability
graph algorithms
Computational complexity
circuits
communication complexity
proof complexity
structural complexity
pseudorandomness
PCPs
inapproximability
Combinatorial optimization
Game theory and mechanism design
Quantum computing
Computational biology
Cryptography and security
Automata and formal languages
Concurrent, timed and hybrid systems
Logic in computer science
finite model theory
modal and temporal logics
specification
verification
synthesis
Programming languages
semantics
types
program analysis and correctness
Submissions
-----------
Submissions will be in electronic form via EasyChair using the LIPIcs
LaTeX style file (see
http://www.dagstuhl.de/en/publications/lipics/instructions-for-authors).
Submissions must not exceed 12 pages (including bibliography).
Simultaneous submissions to journals or other conferences with published
proceedings are disallowed. Accepted papers will be published as
proceedings of the conference in the Leibniz International Proceedings in
Informatics (LIPIcs) as a free, open, electronic archive with access to
all. For an accepted paper to be included in the proceedings, one of the
authors must commit to presenting the paper at the conference.
Important Dates
**************************************************************************
Abstract Submission deadline: July 11, 2014
Paper Submission deadline: July 18, 2014
Notification to Authors: September 15, 2014
Deadline for camera-ready papers: October 15, 2014
**************************************************************************
Important Links and email addresses
------------------------------------
Conference page: http://www.fsttcs.org
Submission page: https://www.easychair.org/conferences/?conf=fsttcs2014
Invited Speakers
----------------
Nikhil Bansal (TU Eindhoven)
Paul Gastin (LSV, ENS Cachan)
Martin Grohe (RWTH Aachen)
Orna Kupferman (Hebrew University)
Ryan Williams (Stanford University)
Programme Committee
-------------------
Deeparnab Chakrabarty (MSR, India)
Timothy Chan (Univ. Waterloo)
Anirban Dasgupta (IIT Gandhinagar)
Amit Kumar (IIT Delhi)
Neeldhara Misra (IISc, Bangalore)
Subhas Nandy (ISI Kolkata)
Patrick Nicholson (MPI Saarbrucken)
Michal Pilipczuk (Univ. Bergen)
Jaikumar Radhakrishnan (TIFR, Mumbai)
Rajmohan Rajaraman (Northeastern Univ.)
Venkatesh Raman (IMSc, Chennai), co-chair
Rahul Santhanam (Univ. Edinburgh)
Jayalal Sarma (IIT Madras)
Srikanth Srinivasan (IIT Bombay)
Kavitha Telikepalli (TIFR, Mumbai)
Suresh Venkatasubramanian (Univ. Utah)
Dietmar Berwanger (LSV, ENS Cachan)
Ahmed Bouajjani (LIAFA Paris)
Supratik Chakraborty (IIT Bombay)
Radha Jagadeesan (DePaul University)
Aditya Kanade (IISc, Bangalore)
Dietrich Kuske (TU Ilmenau)
Ralf Kusters (Univ. Trier)
Kamal Lodaya (IMSc, Chennai)
Madhavan Mukund (CMI, Chennai)
Shaz Qadeer (MSR, Redmond)
Arnaud Sangnier (LIAFA Paris)
Alexis Saurin (CNRS, Univ. Paris-Diderot)
Sunil Simon (IIT Kanpur)
S P Suresh (CMI, Chennai), co-chair
Ashutosh Trivedi (IIT Bombay)
Mahesh Viswanathan (Univ. Illinois)
Organizing Committee
--------------------
Shweta Agrawal (IIT Delhi)
Naveen Garg (IIT Delhi)
Ragesh Jaiswal (IIT Delhi), chair
Amit Kumar (IIT Delhi)
Sanjiva Prasad (IIT Delhi)
Sandeep Sen (IIT Delhi)
--
Venkatesh Raman,
www.imsc.res.in/~vraman
------------------------------
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 75, Issue 11
**************************************
No comments:
Post a Comment