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. CfP: GECCO 2016: Late-Breaking Abstracts, deadline is
approaching (José Francisco Chicano García)
2. Computational Optimization (Stefka Fidanova)
3. CFP - Algorithms MDPI - Special Issue on Parallel Algorithms
for Combinatorial Optimization Problems (Charalampos Konstantopoulos)
----------------------------------------------------------------------
Message: 1
Date: Thu, 31 Mar 2016 00:15:20 +0100
From: José Francisco Chicano García <chicano@lcc.uma.es>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] CfP: GECCO 2016: Late-Breaking Abstracts, deadline
is approaching
Message-ID: <8D3B1600-F83E-4362-B389-6D245DA8AE99@lcc.uma.es>
Content-Type: text/plain; charset=us-ascii
*********************************************************************************************************
CALL FOR PAPERS
2016 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE (GECCO 2016)
LATE-BREAKING ABSTRACTS
July 20-24, 2016, Denver, CO, USA
Submission deadline: April 3rd, 2016
Organized by ACM SIGEVO
http://gecco-2016.sigevo.org/index.html/Late-Breaking+Abstracts
*********************************************************************************************************
** DESCRIPTION
Two-page abstracts describing late-breaking developments in the field
of genetic and evolutionary computation are solicited for presentation
at the Late-Breaking Abstracts Workshop of the 2016 Genetic and
Evolutionary Computation Conference (GECCO 2016), and for inclusion in
the proceedings companion to be distributed on USB key to all attendees
of the conference and in the ACM Digital Library.
** PRESENTATION FORMAT
Following the success of the last year poster format for Late Breaking
Abstracts, authors of the accepted submissions will be asked to prepare
a poster summarizing their contributions. The chair will introduce each
work at the beginning of the session and attendees will have the opportunity
to interact with authors and enjoy a dynamic forum to share and spread
scientific ideas. The details about the poster preparation will be sent
to the authors of accepted abstracts.
** SELECTION PROCESS
Late-breaking abstracts will be briefly examined for relevance and
minimum standards of acceptability, but will not be peer reviewed in
detail. Authors of accepted late-breaking abstracts will individually
retain copyright (and all other rights) to their late-breaking abstracts.
Accepted late breaking abstracts with no author registered by the deadline
will not appear in the Late-Breaking Abstracts section on the USB key nor
the ACM Digital Library.
** HOW TO SUBMIT AN ABSTRACT
Submission site: https://ssl.linklings.net/conferences/gecco
Page limit: 2 pages using ACM template.
Templates for Word and LaTeX are available on the ACM website at
http://www.acm.org/publications/article-templates/proceedings-template.html.
** IMPORTANT DEADLINES
Submissions close: April 03, 2016, 23:59 (Anywhere on Earth)
Authors notification: April 20, 2016
Camera Ready Files Deadline: May 04, 2016
** TUTORIALS & WORKSHOPS
GECCO 2016 offers a rich program of tutorials and workshops.
See the full list at:
http://gecco-2016.sigevo.org/index.html/Tutorials
http://gecco-2016.sigevo.org/index.html/Workshops
** VENUE
GECCO 2016 will take place in Denver, Colorado, USA. This city is an
important industrial center, a major destination for business travel,
and a good base for trips into the Rocky Mountains.
** MORE INFORMATION
For more information, visit
http://gecco-2016.sigevo.org/index.html/Late-Breaking+Abstracts
** CONTACT
For technical matters, contact the Late Breaking Abstracts Workshop Chairs,
Francisco Chicano at chicano@lcc.uma.es
***************************************************************************************
GECCO is sponsored by the Association for Computing Machinery Special
Interest Group for Genetic and Evolutionary Computation (ACM SIGEVO).
------------------------------
Message: 2
Date: Thu, 31 Mar 2016 13:36:48 +0300
From: Stefka Fidanova <stefka.fidanova@gmail.com>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] Computational Optimization
Message-ID:
<CAAL360uS+5cd9-G8DQDOrQc05m0=GyFG5RUzQusW53D2vKwQHA@mail.gmail.com>
Content-Type: text/plain; charset=UTF-8
------------
Call for Papers
9th International Workshop on Computational Optimization (WCO 2016)
Gdansk, Poland, September 11 - 14, 2016)
organized in the framework of FEDERATED CONFERENCE ON COMPUTER SCIENCE
AND INFORMATION SYSTEMS
FedCSIS - 2016
====================
We invite original contributions related with both theoretical and
practical aspects of optimization methods.
The list of topics includes, but is not limited to:
* unconstrained and constrained optimization
* combinatorial optimization
* continues optimization
* global optimization
* multiobjective optimization
* optimization in dynamic and/or noisy environments
* large scale optimization
* parallel and distributed approaches in optimization
* random search algorithms, simulated annealing, tabu search and other
derivative free optimization methods
* nature inspired optimization methods (evolutionary algorithms, ant
colony optimization, particle swarm optimization, immune artificial
systems etc)
* hybrid optimization algorithms involving natural computing
techniques and other global and local optimization methods
*computational biology and optimization
* distance geometry and applications
* optimization methods for learning processes and data mining
* application of optimization methods on real life and industrial problems
* computational optimization methods in statistics, econometrics,
finance, physics, chemistry, biology, medicine, engineering etc.
====================
Important dates:
18.04.2016 (April 18, 2016) – Full paper submission
30.05.2016 (May 30, 2016) - Position paper submission
13.06.2016 (June 13, 2016) – Notification of acceptance
04.07.2016 (July 04, 2016) – Camera-ready version of the accepted paper
====================
Submission and Publication
* Authors should submit draft papers as PDF.
* The total length of a paper should not exceed 10 pages for full
paper and 4 pages for short papers (IEEE style). IEEE style templates
are available at http://www.fedcsis.org/.
* Papers will be refereed and accepted on the basis of their
scientific merit and relevance to the workshop.
* Accepted and Presented paper will be published in the Conference
Proceedings and included in the IEEE Xplore database (pending) and
indexed in the DBLP.
* Extended versions of selected papers presented during the conference
will be published as Special Issue(s) of Springer Studies of
Computational Intelligence.
====================
If you have any question do not hesitate to send a mail to wco2016@fedcsis.org .
Organizing Committee
Stefka Fidanova, Bulgarian Academy of Science, Bulgaria
Daniela Zaharie, West University of Timisoara, Romania
Antonio Mucherino, IRISA, France
--
Assoc. Prof. Stefka Fidanova
IICT-BAS
Acad. G. Bonchev str. bl.25A
1113 Sofia Bulgaria
Ph. +359-2-9796642
------------------------------
Message: 3
Date: Thu, 31 Mar 2016 16:19:10 +0300
From: "Charalampos Konstantopoulos" <konstant@unipi.gr>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] CFP - Algorithms MDPI - Special Issue on Parallel
Algorithms for Combinatorial Optimization Problems
Message-ID: <000001d18b4f$eacfa8d0$c06efa70$@unipi.gr>
Content-Type: text/plain; charset="us-ascii"
Call for Papers
MDPI Algorithms Journal
Special Issue on Parallel Algorithms for Combinatorial Optimization Problems
(http://www.mdpi.com/journal/algorithms/special_issues/parallel_algorithms)
Scope
Combinatorial optimization problems model most of the application scenarios
frequently arising in practice. Unfortunately, optimal solutions to these
problems are hard to obtain, with most of them having high computational
complexity. Even in the case of problems admitting polynomial time
solutions, e.g., the classical shortest path problem, the relevant
applications should now work on very large input instances or should cope
with a large number of concurrent users. Thus, faster solution methods are
clearly needed for achieving real time responses for problems previously
considered as easy ones. The same also holds for most heuristic methods or
approximation algorithms that have been proposed for obtaining approximate
solutions for hard optimization problems in acceptable execution times. For
large-scale problems, these techniques are inadequate, and much faster
algorithmic techniques are needed again.
Due to the aforementioned limitations, parallelism has been considered a
means of deriving faster algorithmic solutions. Parallel computation is
virtually ubiquitous nowadays and can be found in all modern computing
platforms. Although the concept of parallel execution is simple, its
application on combinatorial optimization problems is not straightforward,
due to the inherently irregular control flow that the algorithms for this
kind of problem commonly have. In this Special Issue, we solicit
contributions that will propose new methodologies for solving problems in
combinatorial optimization using parallel computation, either in
shared-memory systems (e.g., multi-core/many-core processors, GPUs, etc.) or
in distributed-memory systems (e.g., clusters, cloud architectures, etc.).
Topics of interest include, but are not limited to:
- Parallel exact algorithms: e.g., divide-and-conquer, dynamic programming,
etc.
- Parallel approximation algorithms- Parallel fixed parameter algorithms
- Parallel heuristics/metaheuristics for combinatorial optimization
problems: e.g., local search, simulated annealing, evolutionary computation,
swarm intelligence computation, etc.
- Parallel techniques in integer linear programming: e.g., parallelization
of branch-and-bound, column generation, and cutting plane methods or their
combinations (i.e., branch-and-cut or branch-and-price).
- Parallel algorithms for multi-objective optimization problems.
----------------------------------------------------------------------------
-------------
Manuscript submission deadline: June 30, 2016
----------------------------------------------------------------------------
-------------
Guest Editor
Dr. Charalampos Konstantopoulos
Department of Informatics
University of Piraeus, Greece (konstant@unipi.gr)
------------------------------
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 98, Issue 1
*************************************
No comments:
Post a Comment