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 - Algorithms MDPI - Special Issue on Parallel Algorithms
for Combinatorial Optimization Problems (Charalampos Konstantopoulos)
2. Open position: Lecturer in CS (Permanent) at NUIM Ireland
(Philippe Moser)
----------------------------------------------------------------------
Message: 1
Date: Mon, 27 Jun 2016 08:55:47 +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: <000001d1d038$8e54c080$aafe4180$@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)
------------------------------
Message: 2
Date: Mon, 27 Jun 2016 13:09:26 +0100
From: Philippe Moser <pmoser@cs.nuim.ie>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] Open position: Lecturer in CS (Permanent) at NUIM
Ireland
Message-ID:
<CAODRybuNsYe_8cGLZYEF+Q+YiSorY8VYM8ZcT3mVaP2Gu1z5aw@mail.gmail.com>
Content-Type: text/plain; charset=UTF-8
Contract Type: Permanent
Department: Computer Science
<https://www.maynoothuniversity.ie/computer-science>
Closing Date: Sunday, July 31, 2016
The CS department is theory friendly.
Maynooth University is committed to a strategy in which the primary
University goals of excellent research and scholarship and outstanding
education are interlinked and equally valued.
We are seeking an excellent academic to join our staff as a Lecturer in
Computer Science. Applications are welcome particularly from computer
scientists from the following research areas: Computer Vision, Robotics,
Intelligent Systems, Information Theory, Data Science, Dependable Software
Systems. The person appointed will have a proven record of teaching,
research and publication, appropriate to career stage. He/she will be
expected to make a strong contribution to the teaching programme of the
Department and undertake teaching duties on the Department's undergraduate
and postgraduate programmes as well as the supervision of Master's and PhD
students.
The appointee will be expected to build a strong research profile, that
supports the University's research strategy including affiliating to the
Research Institutes, where appropriate and working with colleagues on
national and international research. The appointee will be expected to
sustain and conduct research, engage in scholarship of quality and
substance and generate publications of international standard.
More details at:
https://www.maynoothuniversity.ie/human-resources/vacancies/lecturer-computer-science-permanent-department-computer-science
--
Dr Philippe Moser
Department of Computer Science
National University of Ireland Maynooth
Maynooth, Co. Kildare
Ireland
--------------------------------------------
Phone: +353-1-708-6347
WWW: http://www.cs.nuim.ie/~pmoser/
------------------------------
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 100, Issue 25
***************************************
No comments:
Post a Comment