Wednesday, October 25, 2017

[DMANET] [AAMAS18] Final CFP: International Conference on Autonomous Agents and Multiagent Systems (AAMAS-18)

***************************************************
AAMAS 2018: July 10-15, 2018 in Stockholm
***************************************************

http://aamas18.ifaamas.org
@AAMAS2018


Important Dates
---------------

Abstract Submission: 10th of November 2017 (23:59 UTC-12)

Full Paper Submission: 14th of November 2017 (23:59 UTC-12)

Rebuttal Phase: 9th-10th of January 2018 (23:59 UTC-12)

Author Notification: 24th of January 2018 (23:59 UTC-12)


AAMAS is the leading scientific conference for research in autonomous agents and multiagent systems. The AAMAS conference series was initiated in 2002 by merging three highly respected meetings: the International Conference on Multi-Agent Systems (ICMAS); the International Workshop on Agent Theories, Architectures, and Languages (ATAL); and the International Conference on Autonomous Agents (AA). The aim of the joint conference is to provide a single, high-profile, internationally respected archival forum for scientific research in the theory and practice of autonomous agents and multiagent systems. This edition will be a part of the Federated AI Meeting (FAIM) where AAMAS is co-located with several AI conferences including the International Joint Conference on Artificial Intelligence (IJCAI)/European Conference on Artificial Intelligence (ECAI) and the International Conference on Machine Learning (ICML).

AAMAS 2018, the seventeenth conference in the AAMAS series, seeks the submission of high-quality papers addressing original research on autonomous agents and their interaction. All work must be original, that is, must not have appeared in conference proceedings, books, or journals and may not be under review for other archival conferences, books, or journals.

A significant number of papers will be invited to submit extended versions to the Journal of Autonomous Agents and Multi-agent Systems (JAAMAS) for fast-track review.

In addition to submissions in the main track, AAMAS 2018 will solicit papers for the following special tracks:

1) JAAMAS Submissions.
2) Robotics
3) Socially Interactive Agents
4) Blue Sky Ideas
5) Industrial Applications

The review process for the special tracks will be similar to the main track, but with program committee members specially selected for each track. All accepted papers for the special tracks will be included in the proceedings.

At least one of the authors of each paper is required to register, attend, and present the paper at the conference.

In addition to the main conference, AAMAS 2018 will include:

- Workshops
- Tutorials
- System demonstrations
- Poster presentations for full papers and extended abstracts
- Invited talks and panel discussions

The submission processes for the workshops and system demonstrations are separate from the main paper submission process. Information will be posted on the relevant pages.

----- ORGANIZING COMMITTEE

AAMAS 18 General Chairs:
Elisabeth Andre (University of Augsburg, Germany)
Sven Koenig (University of Southern California, USA)

AAMAS 18 Program Chairs:
Mehdi Dastani (University of Utrecht, Netherlands)
Gita Sukthankar (University of Central Florida, USA)

AAMAS 18 Local Chair:
Franziska Kluegl (Orebro University, Sweden)

The full AAMAS 2018 Call for Papers, along with descriptions of the special tracks
and all topics of interest, can be found at:

aamas18.ifaamas.org
@AAMAS2018
#aamas2018

**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

Tuesday, October 24, 2017

from Peter Bartlett: Simons-Berkeley Research Fellowships for Fall 2018 and Spring 2019

The Simons Institute for the Theory of Computing invites applications for Simons-Berkeley Research Fellowships for the Fall 2018 and Spring 2019 semesters. Simons-Berkeley Research Fellowships are intended for exceptional young scientists to participate in at least one of the semester-long programs at the institute. The Institute will host programs on "Foundations of Data Science" and "Lower Bounds in Computational Complexity" in Fall 2018 and "Data Privacy: Foundations and Applications" and "Geometry of Polynomials" in Spring 2019. The deadline for receipt of applications is December 15, 2017. For more information, see the call for applications: https://simons.berkeley.edu/fellows2018.

[DMANET] ICAPS 2018 Operations Research (OR) Track - Call for Papers (CFP)

ICAPS 2018 Operations Research (OR) Track - Call for Papers (CFP)

http://icaps18.icaps-conference.org/operations-research-track/

In 2018, ICAPS will run an Operations Research (OR) Track as part of the main conference. Operations research and automated planning are often seen as distinct fields with different application areas and techniques. Operations research typically focuses on optimizing an objective function defined over variables that are subject to a range of combinatorial and mathematical constraints. Automated planning is typically concerned with transforming a current state of the world into a desirable outcome, exploiting symbolic and search techniques for finding a feasible or even optimal sequence of actions. Moreover, in the context of reasoning about uncertainty, the two fields have often progressed in parallel, inventing orthogonal techniques or rediscovering existing ones.

However, a wide variety of applications are now emerging that require a tighter integration of these two fields. These applications typically require reasoning about time, space, and resources simultaneously: Their solutions are sequences of actions that use limited resources over time and must be selected from a wealth of different alternatives. In addition, some of these applications have inherent uncertainties, ranging from exogenous factors such as the demand for some products to endogenous aspects that determine the outcome of some actions.

The OR track of the ICAPS conference solicits papers at the intersection of these two fields to stimulate and nurture progress in their integration. The track provides a forum to report new results and to compare existing methods and formulations for complex planning problems under constraints. The track welcomes both methodological and applied contributions.

Author Guidelines

Authors may submit long papers (8 pages AAAI style plus up to one page of references) or short papers (4 pages plus up to one page of references). The type of paper must be indicated at submission time.

All papers, regardless of length, will be reviewed against the standard criteria of relevance, originality, significance, clarity and soundness, and are expected to meet the same high standards set by ICAPS. Short papers may be of narrower scope, for example by addressing a highly specific issue, or proposing or evaluating a small, yet important, extension of previous work or new idea.

Authors making multiple submissions must ensure that each submission has significant unique content. Papers submitted to ICAPS 2018 may not be submitted to other conferences or journals during the ICAPS 2018 review period nor may they be already under review or published in other conferences or journals. Overlength papers will be rejected without review.

Submission Instructions

All submissions will be made electronically, through the EasyChair conference system:

https://www.easychair.org/conferences/?conf=icaps2018

Submitted PDF papers should be anonymous for double-blind reviewing, adhere to the page limits of the relevant track CFP/submission type (long or short), and follow the AAAI author kit instructions for formatting: http://www.aaai.org/Publications/Author/icaps.php

In addition to the submitted PDF paper, authors can submit supplementary material (videos, technical proofs, additional experimental results) for their paper. Please make sure that the supporting material is also anonymized. Papers should be self-contained; reviewers are encouraged, but not obligated, to consider supporting material in their decision.

The proceedings will be published by AAAI Press. All accepted papers will be published in the main conference proceedings and will be presented orally at the conference (full papers will be allocated more time).

Important Dates

November 17, 2017Abstracts (electronic submission) due
November 21, 2017Papers (electronic submission, PDF) due
January 29, 2018Notification of acceptance

The reference timezone for all deadlines is UTC-12. That is, as long as there is still some place anywhere in the world where the deadline has not yet passed, you are on time!

Operations Research (OR) Track Chairs

Pascal Van Hentenryck, University of Michigan
Adrian Pearce, University of Melbourne

Program Committee

Florian Pommering, University of Basel
Daniele Magazzeni, King's College London
Nina Narodytska, Samsung Research America
Sylvie Thiebaux, Australian National University (ANU)
Christopher Beck, University of Toronto
Russell Bent, Los Alamos National Laboratory
Blai Bonet, Universidad Simón Bolívar
Christina Burt, Satalia
André Augusto Ciré, University of Toronto
Michelle Blom, University of Melbourne


**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] Simons-Berkeley Research Fellowships for Fall 2018 and Spring 2019

The Simons Institute for the Theory of Computing invites applications for
Simons-Berkeley Research Fellowships for the Fall 2018 and Spring 2019
semesters. Simons-Berkeley Research Fellowships are intended for
exceptional young scientists to participate in at least one of the
semester-long programs at the institute. The Institute will host programs
on "Foundations of Data Science" and "Lower Bounds in Computational
Complexity" in Fall 2018 and "Data Privacy: Foundations and Applications"
and "Geometry of Polynomials" in Spring 2019. The deadline for receipt of
applications is December 15, 2017. For more information, see the call for
applications: https://simons.berkeley.edu/fellows2018.

--
Peter Bartlett
Associate Director, Simons Institute for the Theory of Computing
Professor, Computer Science and Statistics
UC Berkeley

**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] PostDoc in Graph Drawing at Roma Tre University

A postdoc position in graph drawing and related areas is open in the
graph drawing research group led by Prof. Giuseppe Di Battista at the
Department of Engineering at Roma Tre University. The research group
includes Fabrizio Frati, Maurizio Patrignani, and Maurizio Pizzonia as
permanent members, together with several postdocs and PhD students. The
postdoc position is funded by the PRIN (Research Projects of National
Interest) Project "MODE" - Morphing graph drawings efficiently.

The ideal candidate for the position should have a PhD in Mathematics or
Computer Science and should have a background in algorithms, theoretical
computer science and/or discrete mathematics, preferably with an
interest in graph drawing, graph theory, and/or combinatorial geometry.

The postdoc appointment is to begin in late 2017 or early 2018. The
position is for one year, renewable for a second year. The position is
full-time and research-only. The position is open to candidates of any
nationality; in particular, no knowledge of Italian is required. The
gross salary is 27K, which will result in ~1650 net per month. Travel
funding will be available.

The call can be found here: http://www.ingegneria.uniroma3.it/?p=27526
The Italian version of the call is available here:
http://www.ingegneria.uniroma3.it/?p=27502

Detailed information on how to apply are available in the call. In
particular, a candidate should send a package to the address specified
in the first page of the call, containing:

- 3 filled forms ("Allegato A", "Allegato B", and "Allegato C"),
corresponding to the last three pages of the call
- a copy of an ID
- a copy of the CV
- a copy of any relevant titles (e.g., the ph.d. award, awards at
conferences, ...)
- a copy of the most significant publications (possibly no more than five)

The package has to be received no later than the 15th of November.
Selected candidates will be interviewed via Skype or similar electronic
means. For any further information, please contact Fabrizio Frati
<frati@dia.uniroma3.it>
------------------------
QUICK GUIDE TO THE FORMS

Allegato A:
- Rep. N is 102/2017
- At point 2) the candidate should indicate first the topic of his/her
degree (e.g., mathematics or computer science), then the date of
conferment, then the University where the degree was obtained, then the
final grade (if available).

Allegato B:
This form is to self-certify that the candidate has obtained a master
degree. In the thick box, the candidate should specify the topic of
his/her degree (e.g., mathematics or computer science), then the date of
conferment, then the University where the degree was obtained, then the
Faculty where the degree was obtained, then the final grade (if
available); the small box indicates a laurea cum laude.

Allegato C:
In the first list the candidate should list the relevant titles attached
to the application. In the second list the candidate should list the
titles of the scientific publications attached to the application.
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] URGENT: Full-Time PhD Position in Combinatorial Optimization at University Clermont Auvergne, Clermont-Ferrand, France (Second Advertisement)

The Computer Science, Modeling, and System Optimization research
Laboratory (LIMOS – UMR CNRS 6158) at the University Clermont Auvergne,
Clermont-Ferrand, France, invites applications for a full-time PhD
position in Combinatorial Optimization.

The position is funded by the French National Research Agency (ANR) for
three years and is related to the research project "Optimal Routing and
Spectrum Assignment of Realistic FlexGrid Elastic Optical Networks"
(FLEXOPTIM) led by Dr. Hervé Kerivin from LIMOS. The FLEXOPTIM project
aims at developing efficient off-line/on-line algorithms for the Routing
and Spectrum Assignment (RSA) problem on large-scale Spectrally Flexible
Optical Networks (SFONs) and at integrating them into a global
Software-Defined Networking (SDN) framework. This interdisciplinary
project brings together experts in mathematical optimization from LIMOS
and experts in optical-network architecture and control from the
Institut Mines-Telecom (IMT-Atlantique, formerly Telecom Bretagne) in
Brest, France. An explicit collaboration with Orange Labs is planned
during the project.

The PhD research project involves investigating the combinatorial and
optimization aspects of the RSA problem, developing algorithms to solve
realistic large-size instances of such a problem, and playing an active
role in the assessment of the functionality and efficiency of the
devised methods on a dedicated Orange-Labs platform. The successful
applicant must have a strong background in applied mathematics and
computer science. We are seeking an exceptionally talented and
motivated student with a good knowledge in theoretical and experimental
mathematical optimization such as combinatorial optimization, polyhedral
combinatorics, decomposition methods for large-scale problems, and
optimization under uncertainty, as well as skills in C/C++ programming
language; some experience with optimization software such as Cplex and
Gurobi would be an asset. Given the field of application of the
research project, a genuine interest in networking is required.

The PhD candidate will work in the Combinatorial and Continuous
Optimization group of LIMOS under the supervision of Dr. Hervé Kerivin
and Dr. Annegret Wagler. He/she will also work closely with researchers
from IMT-Atlantique where regular meetings will be held. The successful
applicant is expected to carry out cutting-edge research, deliver
presentations at international conferences, and publish in top-tier
journals and conference proceedings. The PhD scholarship includes a
competitive salary and travel support. In addition, a teaching
assistantship with extra payment may be available. Throughout the three
years, the PhD candidate will be provided with specialized scientific
and career development training offered by the Doctoral School of
Engineering Sciences at University Clermont Auvergne.

The earliest start date is December 01, 2017 but the position will
remain open until an appropriate candidate is found. Applicants must
have earned a master's degree in Operations Research, Applied
Mathematics, Computer Science, or related fields by the start date of
the position. Besides the aforementioned scientific requirements, the
successful applicant must demonstrate a high level of proficiency in
spoken and written English. Knowledge of French is not required but
would be an asset.

Review of applications will continue until the position is filled.
Applications received by October 31, 2017 will be given full
consideration. Applications must contain
1) A cover letter,
2) A curriculum vitae or resume,
3) Copies of undergraduate and graduate transcripts,
4) A 1-2 page research statement describing how the applicant's
qualifications and research interests would fit the project,
5) A copy of the applicant's master's thesis,
6) Up to three publications if it applies,
7) The names and contact information of academic references, one of
which should be the applicant's master's thesis supervisor.
All application materials must be submitted in English to Dr. Hervé
Kerivin at kerivin@isima.fr with the subject line "FLEXOPTIM PhD
scholarship (applicant's name)", preferably as a single PDF file. If
the original academic transcripts are not in French or English, the
translated transcripts must have the university's official stamp on
them.

If you have further questions regarding this position, please contact
Dr. Hervé Kerivin at kerivin@isima.fr with the subject line "FLEXOPTIM
PhD scholarship".

Dr. Hervé Kerivin
Institute for Computer Science
LIMOS – UMR CNRS 6158
University Clermont Auvergne
Campus Universitaire des Cézeaux
1 rue de la Chebarde
TSA 60125 - CS 60026
63178 Aubière cedex
France


**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] Graduate and postdoctoral positions in CS theory at University of Victoria, Canada

The Theory Group of the Computer Science department in the University of Victoria, BC, Canada is looking for talented students for the Masters or PhD degree, to begin in September 2018, or possibly May 2018. The Theory Group includes Bruce Kapron, Valerie King, Wendy Myrvold, Frank Ruskey, Venkatesh Srinivasan, Ulrike Stege and Sue Whitesides. We are looking for students with strong mathematical ability and experience in the theory of computing. The group's interests include combinatorial algorithms, cryptography, complexity, data structures, distributed computing, graph algorithms, logic, parameterized complexity, and randomization.

We also have an opening for one or more postdoctoral fellows, with a 2018 start date. Such a position would be for one year, possibly extendable to two. We will give preference to those interested in working across more than one area. Postdoctoral fellows should have a record of publication in internationally recognized conferences or journals in theoretical computer science.

Applicants for student positions are requested to submit three references with email contacts, transcripts which demonstrate mathematical ability and relevant coursework ,and a statement of research interests. PhD and postdoctoral applicants should in addition submit evidence of research, such as papers which have appeared in internationally recognized venues. Please send these materials by November 13, 2017 to cstheory@uvic.ca<mailto:cstheory@uvic.ca>.

Finally, we invite inquiries regarding short-term research visits for visitors at all levels, including students and postdoctoral fellows.

Please contact Valerie King val@uvic.ca<mailto:val@uvic.ca> or Bruce Kapron bmkapron@uvic.ca<mailto:bmkapron@uvic.ca> if you have questions.

**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] Two open positions (Phd or postdoc) at Hagen (Andre Schulz)

We announce

TWO Positions (PostDoc or Phd) for 3 and 2 years

at the FernUniversität in Hagen, Germany, at the LG Theoretische Informatik
under supervision of Prof. André Schulz. The research focus of the group lies
in graph drawing, computational geometry, algorithms and related areas.

The positions are full-time with competitive salary depending on the applicant's
qualification. The 3-year contract comes with the possibility of an extension for
another 3 years. Both positions can be filled with either a postdoc or a Phd student.
The positions come with teaching duties such as designing course material, grading
assignments, supervising students (normal 4 SWS workload for German universities).
Therefore, it is desired that the candidate is in written and verbal command of the
German language.

For a postdoc we expect that the candidate has (or is very close to) a PhD in Computer
Science or Mathematics and has a solid background in discrete math and algorithms.

Ideally, the applicant has knowledge and interest in at least one of the following fields:

- graph drawing
- computational geometry
- algorithms
- graph theory
- combinatorics

To send your applications consisting of

- cover letter,
- curriculum vitae,
- for PhD students: Master thesis,
- for postdocs: PhD thesis (preliminary version, if not finished),
- contact information for one or two references

please use the following link

https://fernuni-hagen.hr4you.org/generator.php?id=605

(The link leads to the complete and official advertisment.)

The deadline is December 1.

If you have further questions, please send an email
to andre.schulz[[at]]fernuni-hagen.de<http://fernuni-hagen.de>.

--
Prof. Dr. Andre Schulz - LG Theoretische Informatik
andre.schulz@fernuni-hagen.de<mailto:andre.schulz@fernuni-hagen.de> / http://www.fernuni-hagen.de/ti/

**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

Monday, October 23, 2017

[DMANET] 6th French-Israeli workshop on Foundations of Computer Science

****************************************************************************
CALL FOR PARTICIPATION

6th French-Israeli Workshop on Foundations of Computer Science

Tel-Aviv University
November 22-23, 2017

https://www.irif.fr/~filofocs/FILOFOCS2017/

****************************************************************************

The 6th FILOFOCS workshop will be held at Tel-Aviv University
on November 22-23, 2017. This is the 6th edition of this series of workshops
and is part of the activities of FILOFOCS (French-Israeli Laboratory
on Foundations of Computer Science), a LEA (Laboratoire Européen
Associé) of the CNRS and Tel-Aviv University. See
http://www.liafa.univ-paris-diderot.fr/~adiro/filofocs//filofocs_lab/filofocs_lab.html
for more details on the previous workshops and other activities of
FILOFOCS.

A preliminary program is now available on the webpage of the
workshop https://www.irif.fr/~filofocs/FILOFOCS2017/ .

The workshop will follow another interesting event, in celebration
of Amos Fiat's 61st birthday, to be held on November 20-21,
at Tel-Aviv University. See www.cs.huji.ac.il/~yrabani/Amos61 .

Both events are open to be attended by any interested party,
upon free, but mandatory by Nov. 12, registration (links on
the events' webpages).


best regards,

Benny Chor, Marc Renault, Adi Rosen (organizers)
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] AmosFest - a workshop in honor of Amos Fiat's 61st birthday

****************************************************************************
CALL FOR PARTICIPATION

AmosFest - a workshop in honor of Amos Fiat's 61st birthday

Tel-Aviv University
November 20-21, 2017

www.cs.huji.ac.il/~yrabani/Amos61


****************************************************************************

AmosFest - a workshop in honor of Amos Fiat's 61st birthday
will be held at Tel-Aviv University on November 20-21, 2017.
We are planning a feast of scientific talks, food, and partying,
attended by Amos Fiat and his colleagues, students and friends.

A preliminary program is now available on the workshop
webpage www.cs.huji.ac.il/~yrabani/Amos61 .

This event will be followed by another interesting event,
the 6th French-Israeli workshop on Foundations of Computer Science,
to be held on November 22-23, at Tel-Aviv University
(see https://www.irif.fr/~filofocs/FILOFOCS2017/ ).

Both events are open to be attended by any interested party,
upon free, but mandatory by Nov. 12, registration (links on
the workshops' webpages)

best regards,

Yossi Azar, Michal Feldman, Yuval Rabani, Adi Rosen (organizers)
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] Workshop in Robust Optimisation

Dear colleagues,

you are cordially invited to participate in the 2-days workshop on "Robust
Optimization" at the University of Avignon on the 28th and 29th of June
2018. This workshop aims at regrouping the different approaches to static
and adjustable robust optimization, ranging from combinatorial optimization
and integer programming to convex optimization and distributionally robust
approaches.

We are delighted to announce the following invited speakers:

- Dick den Hertog (Tilburg University)
- Adam Kasperski (Wroclaw University of Technology)
- Wolfram Wiesemann (Imperial College London)

In addition, there is room for around 8 contributed presentations, lasting
30 to 45 minutes. If you are interested in giving a presentation, or simply
to participate in the workshop, please send your name and affiliation to
Marc Goerigk (m.goerigk@lancaster.ac.uk). The participation is free but
registration is necessary for organizing the lunch and coffee breaks.

The workshop will be held at the Université d'Avignon et des Pays de
Vaucluse, right in the center of the lovely town of Avignon. Notice that it
is located 5-6 hours by train from Bordeaux where the ISMP will take place
making it easy to combine the two events.
We are looking forward to meeting you in Avignon!

Marc Goerigk
Michael Poss

**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] [GECCO 2018] Call For Entries for 15th Annual (2018) "Humies" Awards

[Apologies if you receive multiple copies]

Call For Entries
for 15th Annual (2018) "Humies" Awards
for Human-Competitive Results
Produced by Genetic and Evolutionary Computation
www.human-competitive.org

To be Held at
Genetic and Evolutionary Computation Conference (GECCO)
July 15-19, 2018 (Sunday - Thursday)
in Kyoto, Japan
http://gecco-2018.sigevo.org

Entries are hereby solicited for awards totaling $10,000 for
human-competitive results that have been produced by any form of
genetic and evolutionary computation (including, but not limited to
genetic algorithms, genetic programming, evolution strategies,
evolutionary programming, learning classifier systems, grammatical
evolution, gene expression programming, differential evolution, etc.)
and that have been published in the open literature between the
deadline for the previous competition and the deadline for the current
competition.

The competition will be held as part of the Genetic and
Evolutionary Computation (GECCO) conference operated by the
Association for Computing Machinery (ACM) Special Interest
Group (SIG) on Genetic and Evolutionary Computation (SIGEVO).
Entries chosen to be finalists will be made at the conference.
The winners of the awards will be announced during
the conference.

IMPORTANT DATES:
* Wednesday June 6, 2018 -- Deadline for entries (consisting of
one TEXT file, PDF files for one or more papers, and possible "in
press" documentation (explained below). Please send entries to
koza at human-competitive dot org

* Wednesday June 20, 2018 -- Finalists will be notified by e-mail

* Wednesday July 4, 2018 -- Finalists must submit their presentation
(e.g., PowerPoint, PDF) for posting on the competition's web site.
Send presentations to koza at human-competitive dot org

* July 15-19, 2018 (Sunday-Thursday) -- GECCO conference

* Tuesday July 17, 2018 (TENTATIVE) -- Presentations before judging
committee at public session of the GECCO conference. Finalists should
make a point of double-checking the time and date in the conference's
final schedule.

* Thursday July 19, 2018 (TENTATIVE) -- Announcement of awards at
plenary session of the GECCO conference


JUDGING COMMITTEE
* Erik Goodman
* Una-May O'Reilly
* Wolfgang Banzhaf
* Darrell Whitley
* Lee Spector

PUBLICITY CHAIR: William Langdon

CALL FOR ENTRIES
Techniques of genetic and evolutionary computation are being
increasingly applied to difficult real-world problems -- often
yielding results that are not merely academically interesting, but
competitive with the work done by creative and inventive
humans. Starting at the Genetic and Evolutionary Computation
Conference (GECCO) in 2004, cash prizes have been awarded for
human-competitive results that had been produced by some form of
genetic and evolutionary computation in the previous year.

This prize competition is based on published results. The publication
may be a paper published anywhere in the open literature (e.g., the
GECCO conference, any another conference or workshop, journal,
technical report, thesis, book, chapter in edited book).

The competition is open to any paper

(1) published in the open literature between June 7, 2017 (the
deadline for the previous year's competition) and June 6, 2018 (the
deadline for this competition), or

(2) that is "in press" by the deadline for this competition. "In
Press" means the paper must have been unconditionally accepted for
publication and be identical to that which will be published
imminently without the possibility of any further changes or revision
by the authors or editors. For example, a paper accepted for the
current year's GECCO conference would not have been published by the
deadline for the competition. However, because the paper has already
been unconditionally accepted for publication (and the final
camera-ready version submitted to the conference prior to the deadline
for this competition), a GECCO paper is "in press." If an entry is
"in press," the entry must include a copy of the documentation
establishing that the paper meets this requirement.

The paper must meet the usual standards of a scientific publication in
that it must clearly describe a problem, the methods used to address
the problem, the results obtained, and sufficient information about
how the work was done in order to enable the work to be independently
replicated.

An automatically created result is considered "human-competitive" if
it satisfies at least one of the eight criteria below.

(A) The result was patented as an invention in the past, is an
improvement over a patented invention, or would qualify today as a
patentable new invention.

(B) The result is equal to or better than a result that was accepted
as a new scientific result at the time when it was published in a
peer-reviewed scientific journal.

(C) The result is equal to or better than a result that was placed
into a database or archive of results maintained by an internationally
recognized panel of scientific experts.

(D) The result is publishable in its own right as a new scientific
result independent of the fact that the result was mechanically
created.

(E) The result is equal to or better than the most recent
human-created solution to a long-standing problem for which there has
been a succession of increasingly better human-created solutions.

(F) The result is equal to or better than a result that was considered
an achievement in its field at the time it was first discovered.

(G) The result solves a problem of indisputable difficulty in its
field.

(H) The result holds its own or wins a regulated competition involving
human contestants (in the form of either live human players or
human-written computer programs).

Contestants should note that a pervasive thread in most of the above
eight criteria is the notion that the result satisfy an "arms length"
standard -- not a yardstick based on the opinion of the author, the
author's own institution (educational or corporate), or the author's
own close associates. "Arms length" may be established in numerous
ways. For example, if the result is a solution to "a long-standing
problem for which there has been a succession of increasingly better
human-created solutions," it is clear that the scientific community
(not the author, the author's own institution, or the author's close
associates) have vetted the significance of the problem. Similarly, a
problem's significance may be established if the result replicates or
improves upon a scientific result published in a peer-reviewed
scientific journal, replicates or improves upon a previously patented
invention, constitutes a patentable new invention, or replicates or
improves a result that was considered an achievement in its field at
the time it was first discovered. Similarly, a problem's significance
may be established if the result holds its own or wins a regulated
competition involving live human players or human-written computer
programs. In each of the foregoing examples, the standard for
human-competitiveness is being established external to the author, the
author's own institution, or the author's close associates. It is also
conceivable to rely only on criterion G ("The result solves a problem
of indisputable difficulty in its field"); however, if only criterion
G is claimed, there must be a clear and convincing argument that the
problem's "difficulty" is indeed "indisputable."

The competition will be held as part of the annual Genetic and
Evolutionary Computation (GECCO) conference. Entries chosen to be
finalists are to be made at the conference. The awards and prizes will
be announced at the conference.

Cash prizes of $5,000 (gold), $3,000 (silver), and bronze (either one
prize of $2,000 or two prizes of $1,000) will be awarded for the best
entries that satisfy one or more of the criteria for
human-competitiveness. The awards will be divided equally among
co-authors unless the authors specify a different division at the time
of submission. Prizes are paid by check in U.S. dollars after the
GECCO conference. The judges may, based on submissions, reallocate
the prize amounts and prize categories within the total amount
available for prizes.

DETAILED INSTRUCTIONS FOR ENTERING THE "HUMIES"
If you plan to make an entry into this competition, please check the
web site for updated information and for possible last-minute changes
immediately prior to submitting your entry. Similarly, if you are
selected as a finalist, please re-check the web site prior to the
conference for possible last-minute changes in instructions or
schedule.

All entries are to be sent electronically to koza at human-competitive
dot org. All entries will be promptly acknowledged, so please make an
inquiry if you do not receive a reasonably prompt acknowledgment
shortly after your submission.

An entry must consist of one TEXT file and one or more PDF files. In
addition, if the paper is "in press" asof the deadline date for
submissions, an additional document must be submitted.

If authors are making multiple entries to the competition, please
submit separate e-mails, each containing the required TEXT file and
PDF file(s) supporting the entry.

The TEXT file must contain the following 11 items. Please be very
careful to include ALL required information. Contestants are alerted
to the fact that items 6 and 9 areespecially important and will be the
main basis by which entries will be judged. The papers and
presentations from earlier competitions (starting in 2004) are posted
at the competition web site at www.human-competitive.org. These
previous entries may be informative and helpful in crafting your
entry.

1. the complete title of one (or more) paper(s) published in the open
literature describing the work that the author claims describes a
human-competitive result;

2. the name, complete physical mailing address, e-mail address, and
phone number of EACH author of EACH paper(s);

3. the name of the corresponding author (i.e., the author to whom
notices will be sent concerning the competition);

4. the abstract of the paper(s);

5. a list containing one or more of the eight letters (A, B, C, D, E,
F, G, or H) that correspond to the criteria (see above) that the
author claims that the work satisfies;

6. a statement stating why the result satisfies the criteria that the
contestant claims (see examples of statements of human-competitiveness
as a guide to aid in constructing this part of the submission);

7. a full citation of the paper (that is, author names; publication
date; name of journal, conference, technical report, thesis, book, or
book chapter; name of editors, if applicable, of the journal or edited
book; publisher name; publisher city; page numbers, if applicable);

8. a statement either that "any prize money, if any, is to be divided
equally among the co-authors" OR a specific percentage breakdown as to
how the prize money, if any, is to be divided among the co-authors;

9. a statement stating why the authors expect that their entry would
be the "best," and

10. An indication of the general type of genetic or evolutionary
computation used, such as GA (genetic algorithms), GP (genetic
programming), ES (evolution strategies), EP (evolutionary
programming), LCS (learning classifier systems), GE (grammatical
evolution), GEP (gene expression programming), DE (differential
evolution), etc.

11. The date of publication of each paper. If the date of
publication is not on or before the deadline for submission, but
instead, the paper has been unconditionally accepted for publication
and is "in press" by the deadline for this competition, the entry must
include a copy of the documentation establishing that the paper meets
the "in press" requirement.

The PDF file(s) are to contain the paper(s). The strongly preferred
method is that you send a separate PDF file for each of your paper(s)
relating to your entry. Both the text file and the PDF file(s) for
each entry will be permanently posted on a web page shortly after the
deadline date for entries (for use by the judges, conference
attendees, and anyone else who is interested) and will remain posted
on the web as a permanent record of the competition. If your paper is
only available on the publisher's web site and your publisher
specifically requires that your published paper may appear only on
your own personal page, the second choice is that you send link(s) to
a separate web page on your web site containing link(s) to the PDF
file(s) of the paper(s) that constitute your entry. This separate web
page is to contain nothing else, so the interested parties may quickly
locate your paper(s). If you use this second-choice option, you must
ALSO supply a link to a permanent web site maintained by your
publisher where your specific paper may be viewed or purchased (that
is, not a link merely to the publisher's general home page, but a link
to the specific web page containing your paper on the publisher's
site). Keep in mind that the objective is to guarantee a permanent
record of the entries and to make it easy for anyone to locate your
material.

Generally, only one paper should be submitted. More than one paper
should be submitted only if no single paper fully describes the
specific result or method. Note that this competition involves
specific results published in the past year, and it NOT an evaluation
of the author's entire body of work over period of years. Note that
this is a competition involving a result that satisfies the criteria
for being "human-competitive" as defined herein.

The judging committee will review all entries and identify a short
list of finalists for presentation at the GECCO conference. Finalists
will be notified by an e-mail to the corresponding author. Please
acknowledge receipt of this message, so the judges know that you
received your notice. Finalists must then make a short oral
presentation to the judging committee at a public session of the GECCO
conference. The presentations will be held on one of the early days of
the conference, and the winners will be announced a day or two later
at the conference.

Finalists must submit their presentation (e.g., a PowerPoint, PDF) by
e-mail to koza at human-competitive dot org. All submissions will be
promptly acknowledged, so please make an inquiry if you do not receive
a reasonably prompt acknowledgment. These presentations will be posted
on the web page for the competition. oral presentation (usually about
10 minutes) by the finalists to the judging committee. The
presentations will be open to all conference attendees at a special
session of the conference. The oral presentation should primarily
focus on 1. why the result qualifies as being human-competitive and
2. why the judges should consider the entry as "best" in comparison to
other entries that may also be "human-competitive."

In this short oral presentation to the judges, a description of the
work itself is decidedly secondary. By the time of your presentation,
the judges will be familiar with the papers. Thus, the focus of the
presentation is on reasons why the work being presented should win a
prize -- not an explanation or presentation of the work itself.

In the unlikely event that a presenter is scheduled to make a
presentation elsewhere at the GECCO conference at the same time,
please notify the judging committee, so they can rearrange time slots.

After the oral presentations, the award committee will meet and
consider the presentations.

The presenting author for each entry must register for the GECCO
conference.

A judge will recuse himself or herself if he or she is closely
associated with a finalist (e.g., a current academic advisor, current
collaborator, co-author with the finalist of related work).


Additional information is at www.human-competitive.org
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] PhD studentship in optimization/renewable energy, Strathclyde Business School (Glasgow, UK)

A PhD studentship in optimization is available at the Dept. of Management Science, University of Strathclyde Business School, Glasgow, UK, with an immediate start date if preferable (but latest by 1st March 2018). The project is entitled "Optimization of Offshore Renewable Energy Arrays for Minimal Life-Cycle Costs".

Funding is available to cover 3 years of tuition fees plus a tax free stipend (£14,653 for 2017-18, and projected to increase to £15,020 for 2018-19 and £15,395 for 2019-20). The studentship is open to candidates from any nationality (UK/EU/international), however, the fees will be covered at the UK/EU level only (there is about £10k extra fee for non-EU international students).

The application deadline is 14th November 2017.

ABOUT THE PROJECT

A fundamental difficulty in developing offshore renewable energy (ORE) sites is that the uncertain environmental conditions make accurately assessing the life-cycle costs of a site a challenging problem. In particular, logistical operations throughout the life of a site are subject to uncertain operating conditions, and it is therefore difficult to plan and schedule these operations, and to estimate the resulting durations and costs. Similarly, the generating potential throughout the operation of a given site is dependent on the realised weather as well as the availability of each asset, and uncertainties in each of these make it difficult to accurately predict the profits to be gained from energy production. Decisions on aspects such as the size, layout and composition of a site are therefore difficult to accurately quantify and compare.

This project will aim to develop optimisation models to identify the best strategy for designing an ORE site. A complimentary PhD project in the Dept. of Naval Architecture, Ocean and Marine Engineering at Strathclyde will take an alternative approach to the problem, and as both projects progress in parallel, mutual developments will feed into both projects. This will provide a cross-disciplinary approach to a challenging research problem with potential industry impact.

FUNDING AND ELIGIBILITY

Funding is available to cover 3 years of tuition fees at the UK/EU level, plus a tax free stipend of £14,653 for 2017-18, and projected to increase to £15,020 for 2018-19 and £15,395 for 2019-20. The student will be given opportunities to attend a conference and/or specialized training every year.

The PhD project requires a highly numerate graduate with interests in renewable energy. Candidates should have at least a strong Honours degree or equivalent (a strong 2:1 Honours degree, or a B.Sc. degree with 3.3 GPA in a 4.0 system), or preferably a Master's degree in a quantitative discipline such as industrial engineering, operations research, mathematics or computer science (amongst others). Experience in programming and fundamental knowledge in optimization are not essential but highly desirable. Candidates who are not native English speakers will be required to provide evidence for their English skills (such as by IELTS or similar tests that are approved by UKVI, or a degree completed in an English speaking country).

Applications are admitted until 14th November 2017, or until a suitable candidate is found thereafter.

HOW TO APPLY

Please submit your complete applications at:

https://www.strath.ac.uk/studywithus/postgraduateresearchopportunities/businesspgropportunities/managementsciencepgropportunities/simulationandoptimisationofoffshorerenewableenergyarraysforminimallife-cyclecosts/

Candidates are expected to submit a cover letter, CV, any university degree certificates and transcripts, English test results (if applicable), two recommendation letters (or contact details of two referees, if letters are not available to them), and any other supporting documents.

More information about the department can be found here: http://www.strath.ac.uk/business/managementscience/

Informal enquiries about the project to Dr Euan Barlow (euan.barlow@strath.ac.uk).

**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] PhD student / Post-Doc position in Algorithms Engineering at University Vienna

You  love  algorithms, their analysis and efficient implementation? You
are about to or know somebody who graduates with an excellent Master's
degree and is looking
for a PhD position? Then please  read on:

The research group "Theory and Applications of Algorithms" led by
Professor Monika Henzinger
at the University of Vienna is inviting applications for the full-time
position of a

    PhD Student / University Assistant ("Prae-Doc") (m/f)

    or

    Post-Doc / University Assistant ("Post-Doc") (m/f)

starting on December 1st, 2017 (the exact date is negotiable).
The initial contract length is one year, but an extension is possible
(and in the case of a PhD student also expected).

Working Area:

A successful candidate will work under the supervision of Prof. Monika
Henzinger and Dr. Christian Schulz
on the topics of algorithm engineering, parallel and distributed
algorithms, dynamic algorithms and
combinatorial optimization (such as graph partitioning/clustering,
process mapping, independent sets, ...).
Exceptional candidates in the general area of algorithms and data
structures will also be considered.
Further responsibilities as part of the position include the supervision
of bachelor and master students
and possibly TA duties.

Requirements:

- Very good university degree (Master or equivalent) in computer science
or a related field
- Solid skills in software development and in the theoretical analysis
of algorithms (evidenced by your thesis or relevant courses); knowledge
in combinatorial algorithms and
linear algebra is particularly desirable
- Self-motivation, team spirit and willingness to work in
interdisciplinary projects
- Knowledge in parallel programming (in particular MPI) is a plus, but
no requirement

University Vienna offers  excellent  conditions for undergraduate,
graduate, and PhD
students. As part of the university we pursue a non-discriminatory
employment policy and value equal
opportunities, as well as diversity (http://diversity.univie.ac.at). The
university lays special
emphasis on increasing the number of women in senior and in academic
positions. Given equal qualifications,
preference will be given to female applicants.

Please forward this email to anyone who may be interested or send your
application documents (cover letter,
CV, copies of certificates, a skype address for a possible interview and
the contact information of
two references) to the address below. To receive full consideration,
submit the documents via email
by November 10, 2017 to:

Theory and Applications of Algorithms
Faculty of Computer Science
University of Vienna
Dr. Christian Schulz
Währinger Str. 29
A-1090 Vienna
Austria
email: christian.schulz@univie.ac.at
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] PhD and postdoctoral positions linked to an ERC project at the University of Málaga, Spain

Dear Colleagues,

Apologies for possible cross-posting.

The research group OASYS (Optimization and Analytics for Sustainable EnergY
Systems) at the University of Málaga (Málaga, Spain) is currently looking
for talented and entrepreneurial candidates to fill a PhD position and a
postdoctoral position on the topic "Advanced Analytics to Empower the Small
Flexible Prosumption of Electricity."

Both positions are linked to an Excellent Science project awarded by the
European Research Council through an ERC Starting Grant.

The PhD candidate must possess a master degree in computer science,
control/electrical engineering, applied mathematics and/or statistics,
engineering, or equivalent academic qualifications. Preference will be given
to candidates with skills in statistical and mathematical modelling, big
data management techniques, optimization and software development. Knowledge
of data-handling and programming software (Python, R, Matlab, etc.) is an
advantage. Furthermore, good command of the English language (orally and in
writing) is clearly a plus.

The Postdoctoral Researcher is expected to possess a PhD or equivalent,
preferably in operations research, control engineering, computer science,
mathematics, or statistics. Preference will be given to candidates with a
strong background in optimization theory and mathematical programming. The
ability to code and solve large-scale optimization problems using
programming languages like Python and optimization solvers like Cplex on
High-Performance Computing Facilities is clearly an advantage. Excellent
command of the English language, both orally and in writing is required.

The appointments involve a competitive salary, healthcare and social
security insurance.

Detailed information on the positions we are offering and on the application
procedure can be found at https://sites.google.com/site/jnmmgo/recruitment

Applications should be received no later than December 3, 2017.

I would appreciate it very much if you could spread the link to the
positions within your network.

Best regards,


Juan Miguel Morales González


Associate Professor


Department of Applied Mathematics

Universidad de Málaga

Dept. Matemática Aplicada

Edificio de Ingenierías Industriales

Despacho 2.556L.-B.

UMA Teatinos, C/Doctor Ortiz Ramos s/n, 29071 Málaga (España)


**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] Extended Deadline - Special Session ISOLIA - ACIIDS 2018

>
> ACIIDS 2018 -
> ​*Extended Deadline for paper submission: 31st*
> * ​October​ 2017*
>
> ************************************************************
> *****************************
>
> Conference: ACIIDS 2018
> Name: 10th Asian Conference on Intelligent Information and Database
> Systems
> Conference web site: http://www.aciids.pwr.edu.pl/
> Date: March 19-21, 2018
> Venue: Dong Hoi City, Vietnam
> Publication: Springer LNCS/LNAI Series (max 10 pages)
> Submission via EasyChair: https://easychair.org/
> conferences/?conf=aciids2018
>
> ISOLIA 2018: Special Session on Intelligent Systems for Optimization of
> Logistics and Industrial Applications
>
>
> *********************************
> *Topics*
> *********************************
>
> With the emergence of the new manufacturing revolution, often called
> Industry 4.0, new manufacturing configurations,
> enhanced with advanced robotics and data acquisition, are being used.
> Companies and factories, faced with increasing
> competitiveness, are working on the development of new algorithms and
> systems to cope with the increasing use of
> autonomous machines, the demand load and environmental constraints.
> Moreover, they consistently deal with a dynamic and
> agile environment, characterized by a considerable amount of data, a
> changing manufacturing process and uncertain inputs.
> The ISOLIA 2018 Special Session at the 10th Asian Conference on
> Intelligent Information and Database Systems (ACIIDS
> 2018) is devoted to the intelligent systems dedicated to address the
> optimization of logistics and production systems with
> industrial applications. We want to offer an opportunity for researchers
> and practitioners to identify new promising research
> directions as well as to publish recent advances in this area. The scope
> of the ISOLIA 2018 includes, but is not limited to the
> following topics:
>
> - Simulation and multi-agent systems for performance evaluation
> - New algorithms for scheduling problems
> - Exact algorithms (Brand and Bounds, Dynamic programming …)
> - Intelligent manufacturing systems
> - Novel techniques for the design of assembly/disassembly systems
> - Advanced evolutionary algorithms for effective manufacturing
> - Facility planning
> - Robust optimization for scheduling and production planning
> - Heuristic and meta-heuristic approaches for reverse logistics
> - Energy optimization in manufacturing and planning
> - Intelligent approaches for warehouse management
> - Stochastic modeling of manufacturing systems
> - Multi-criteria decision making for operations and logistics
> - Green manufacturing
>
> *********************************
> IMPORTANT DATES
> *********************************
> Submission of papers:
> ​31st
> October 2017
> Notification of acceptance: 1
> ​December
> 2017
> Camera-ready papers: 15
> ​December
> 2017
> Registration and payment: 15 December 2017
> Conference: 19-21 March 2018
>
> *********************************
> SUBMISSION DETAILS
> *********************************
> All contributions should be original and not published elsewhere or
> intended to be published during the review period.
>
> Submitted papers should be prepared in English in LNCS/LNAI style and
> should not exceed 10 pages.
>
> Each paper is to be submitted electronically as a single PDF file through
> EasyChair at: https://easychair.org/conferences/?conf=aciids2018
>
> All accepted papers must be presented by one of the authors who must
> register for the conference and pay the fee.
>
> The conference proceedings will be published by Springer in the
> prestigious series LNCS/LNAI (indexed by ISI, EI, DBLP, Inspec, Scopus,
> etc.).
>
> A selected number of accepted and personally presented papers will be
> expanded and revised for possible inclusion in special issues in high
> quality scientific journals.
>
>

**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] 2-year Postdoc Position in Management Science at Lancaster University

For a postdoctoral position in an externally funded research project, we
seek applicants with research interest and expertise combining simulation
modeling and meta-heuristics, machine learning, or computational
intelligence in the context of management science, operational research, or
operations management.

You should have, or be close to completing, excellent Masters and PhD
degrees in management, engineering or computer science (or in a related
subject area), with initial publications in preparation for leading
scholarly journals. Corporate experience from applied research and
consultancy projects is valued, particularly in the domains of revenue
management and/or logistics and transport. You should have excellent
verbal/written communication skills, a strong quantitative background, and
computer programming experience (e.g. Java, R, Python, etc.).

You will be expected to primarily work in an externally funded project on
calibrating and validating agent-based simulations for business decision
support. There will be opportunities to develop further research projects
within the Department Management Science.

The application deadline is Thursday 16 November 2017; interviews will be
conducted on Thursday 28 November 2017. This position is open to all
nationalities.

Please find more information and apply here:
https://hr-jobs.lancs.ac.uk/Vacancy.aspx?ref=A2079

If you require any further information, please contact
Catherine Cleophas
c.cleophas@lancaster.ac.uk

**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

Sunday, October 22, 2017

[DMANET] 7th edition of the Winter School on Network Optimization (announcement)

?The 7th edition of the Winter School on Network Optimization will take place at Hotel Estoril-Éden, Monte Estoril, from the 15th to the 19th of January 2018. Its main objective is to provide an opportunity for PhD students to get together and attend high level courses in the field of Network Optimization. Non-PhD students are welcome to attend the school, but the number of participants is limited and priority will be given to PhD students. In this edition of the school, the lecturers and subjects to be addressed are:

Adam Ouorou (Orange Labs) - Robust optimization in telecommunications;

Martine Labbé (Univ. Libre de Bruxelles) - Bilevel programming: Stackelberg games and Pricing Problems;

Ivana Ljubic (ESSEC, Paris) - Recent Developments on Exact Solvers for the (Prize-Collecting) Steiner Tree Problem;

Silvano Martello (Univ. of Bologna) - Packing problems in one and more dimensions;

Juan José Salazar-Gonzalez (Univ. de La Laguna) - Models and Algorithms for Vehicle Routing Problems with Pickups and Deliveries.

The school is part of the activities of the CMAFCIO (Centro de Matemática, Aplicações Fundamentais e Investigação Operacional) University of Lisbon as well as of the ENOG

(European Network Optimization Group). The event is also endorsed by the EURO (the Association of European Societies) and APDIO (the Portuguese OR society).

Potential participants are invited to submit their CVs to the address NetOpt2018@fc.ul.pt no later than the 31st October .

Further information is available in the webpage (http://netopt2018.campus.ciencias.ulisboa.pt<http://netopt2018.campus.ciencias.ulisboa.pt/>)??

**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] ACM e-Energy 2018 Call-for-Papers

9th International Conference on Future Energy Systems (ACM e-Energy)
June 12-15, 2018, Karlsruhe, Germany
http://conferences.sigcomm.org/eenergy/2018/index.php

ACM eEnergy is the premier forum for research at the intersection of
computing and communication technologies with energy systems. It has
established a strong track record for high-quality research in the
application of computing and networked systems to make legacy systems more
energy-efficient and in the design, analysis, and development of innovative
energy systems. The Ninth International Conference on Future Energy Systems
(ACM e-Energy) will be held in Karlsruhe, Germany from the 12th to the 15th
of June 2018. By bringing together researchers in a single-track conference
designed to offer significant opportunities for personal interaction, it is
a major forum for shaping the future of this area.

CALL FOR PAPERS

Important Dates
Paper registration deadline: January 15th, 2018, AOE
Paper submission deadline: January 22nd, 2018, AOE
Author notification: April 9th, 2018

We seek high-quality papers at the intersection of computing and
communication technologies with energy systems. We welcome submissions
describing conceptual advances, as well as advances in system design,
implementation and experimentation. ACM e-Energy is committed to a fair,
timely, and thorough review process with sound and detailed feedback.

Relevant topics for the conference include, but are not limited to the
following:

- Monitoring and control of energy systems for smart grids, smart
buildings, and smart cities

- Energy-efficient computing and communication, including in data centers

- Electric vehicles and energy-efficient transportation systems

- Control of distribution and transmission networks

- Microgrid and distributed generation management and control

- Distributed energy resources, including energy storage resources

- Privacy and security of smart grid infrastructure

- Demand-side management, including innovative pricing and incentive design

- Modeling and understanding the user behavior of energy systems enabled by
computing and communication technologies

- Data analytics for the smart grid and energy-efficient systems

- Electricity market and electricity supply chain measurement, modeling,
and analysis

- Applications of cyber-physical systems and industrial Internet-of-Things
to smart energy systems

Three types of contributions are solicited:

Full papers, up to 10 pages in 9-point ACM double-column format for the
main body of the paper (i.e., everything excluding references) and
unlimited number of pages for appendices and references, should present
original theoretical and/or experimental research in any of the areas
listed above that has not been published, accepted for publication, or
under review by another workshop, conference, or journal. The review of
full papers will follow the standard double-blind policy.

Notes, up to 4 pages in 9-point ACM double-column format for the main body
of the paper (i.e., everything excluding references) and unlimited number
of pages for appendices and references. Notes are intended to discuss
preliminary research results, advocate new research directions, or present
industrial projects. While notes are not expected to have extensive
evaluations, they will be reviewed based on the novelty of their ideas,
potential for impact, and quality of presentation. The review of note will
also follow the standard double-blind policy.

Poster/Demo descriptions, up to 2 pages in 9-point ACM double-column format
showcasing work in progress are encouraged. Accepted posters/demos will be
showcased in a separate session at the conference. Topics of interest are
the same as research topics listed above. Preference will be given to
posters/demos where the primary contribution is from one or more students.
Industry participation is also encouraged.

SUBMISSION INSTRUCTIONS

The submission must be in PDF format and be formatted according to the
official ACM Proceedings format. Papers that do not meet the size and
formatting requirements may not be reviewed. Word and LaTeX templates are
available at http://www.acm.org/publications/article-templates/proceed
ings-template.html
.

Submissions are to be made via the paper submission website:
https://eenergy18.hotcrp.com/

**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

Friday, October 20, 2017

[DMANET] Assistant Professor in Computer Science with specialization in Structural Combinatorics at KAM MFF UK

Applications are invited for a 3-year position as Assistant Professor in
Computer Science with specialization in Structural Combinatorics at the
Department of Applied Mathematics, Faculty of Mathematics and Physics,
Charles University in Prague (KAM MFF UK), with the possibility of
renewal and shift to tenure track.

Candidates should have a PhD in Mathematics, Computer Science or
Operations Research, and demonstrate strong potential for excellence in
research.

The successful candidate will be expected to conduct research related to
structural combinatorics, graph theory, design and analysis of
algorithms.

The successful applicant will teach in English and within three years
also in Czech, topics mainly from discrete mathematics and computer
science. Good knowledge of Czech is advantageous but not necessary.

Desirable are a previous postdoc in combinatorics and strong background
in graph theory and computer science.

The expected starting date is January 1, 2018.

Signed application in digital form, accompanied by a motivation letter,
curriculum vitae, proof of education, lists of publications and
citations, and a description of pedagogical experience should be
e-mailed to <konkurzy@dekanat.mff.cuni.cz>. The candidates must also
arrange for two letters of recommendation to be e-mailed to
<konkurzy@dekanat.mff.cuni.cz>. The deadline for applications is
November 20, 2017.

For official announcement see
https://www.mff.cuni.cz/to.en/fakulta/prace/
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************