dmanet@zpr.uni-koeln.de
To subscribe or unsubscribe via the World Wide Web, visit
http://www.zaik.uni-koeln.de/mailman/listinfo/dmanet
or, via email, send a message with subject or body 'help' to
dmanet-request@zpr.uni-koeln.de
You can reach the person managing the list at
dmanet-owner@zpr.uni-koeln.de
When replying, please edit your Subject line so it is more specific
than "Re: Contents of dmanet digest..."
Today's Topics:
1. Call for Participation 1st AIROYoung workshop (Lavinia Amorosi)
2. [GECCO 2017] Final Day for Proposals for Tutorials, Workshops
and Competitions (Javier Ferrer)
3. CPAIOR 2017 - AI, OR and CP for Optimization ** Updated
deadlines ** (Michele Lombardi)
4. Final call for papers: IPCO 2017 (Jochen Koenemann)
5. postdoctoral positions at IRIF (prev., LIAFA), Paris, France
(Adi Rosen)
----------------------------------------------------------------------
Message: 1
Date: Mon, 7 Nov 2016 10:55:06 +0100
From: Lavinia Amorosi <lavinia.amorosi@uniroma1.it>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] Call for Participation 1st AIROYoung workshop
Message-ID:
<CAM+03PtBE_e67NOT0ukCNR7a6JXnWMQGwGpTSe5N9HKcWaZzcw@mail.gmail.com>
Content-Type: text/plain; charset=UTF-8
Dear colleagues,
We wish to introduce to your attention AIROYoung, the
youth chapter of the Italian Operational Research Society (AIRO) settled
down last September during the AIRO International Conference (
www.airoyoung.org).
We are planning to have the first AIROYoung workshop on
"Emerging Optimization Problems on Complex Networks"
which will take place at the Statistical Department of the University of
Rome, Sapienza on 16th-17th February 2017.
All AIROYoung members, PhD students in Operations Research and people who
obtained the PhD in the last five years or who are under 35 years
interested in Operations Research, are invited to present their work.
High-quality contributions from young researchers need not be limited to
the workshop theme.
In this preliminary announcement we ask you to save the date. Further
information (other activities, social program, invited speakers, ecc.) will
be given as soon as possible.
We hope you will be able to join us!
For organizational reasons, please let us know if you will be able to
attend this exciting workshop.
Please fill the participation form at:
https://docs.google.com/forms/d/e/1FAIpQLSdqQDvgkqfvYVoU4cBK
XjWAdb2QO5KjdsRmxZLKhdoskweplQ/viewform
The event and further info will be published also on our website (
www.airoyoung.org).
Looking forward to hearing from you.
The organizing committee:
Lavinia Amorosi (University of Rome, Sapienza)
Alberto Maria Santini (University of Bologna)
------------------------------
Message: 2
Date: Mon, 7 Nov 2016 14:42:50 +0100
From: Javier Ferrer <ferrer@lcc.uma.es>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] [GECCO 2017] Final Day for Proposals for Tutorials,
Workshops and Competitions
Message-ID: <0a2873f8-66fc-aaff-8f75-1781a1bc8fc9@lcc.uma.es>
Content-Type: text/plain; charset=utf-8; format=flowed
2017 Genetic and Evolutionary Computation Conference (GECCO 2017)
July, 2017, Berlin, Germany
http://gecco-2017.sigevo.org/
Important Dates:
Tutorials, Workshops and Competitions Proposals: November 7, 2016
Conference: 15-19 July, 2017
*** Call for Tutorials ***
Deadline for tutorial proposals: November 7, 2016
Tutorial acceptance decision: TBA
Tutorials at GECCO 2017 will be presented by domain experts to cover
current topics relevant to evolutionary computation researchers and
practitioners. Each tutorial will be 110 minutes long. We encourage the
inclusion of interactive activities and demos.
Tutorials will be free to all GECCO 2017 attendees. It is expected that
all the instructors involved in an accepted tutorial will attend the
conference. One instructor/presenter of each accepted tutorial will be
able to register for GECCO at half the regular rate. (The discount can
be divided among tutorial instructors if there are more than one. Each
presenter is eligible for only a single tutorial discount, i.e., it is
not possible to aggregate discounts from more tutorials).
Accepted tutorials' slide sets will be collected by Sheridan/ACM Press,
and published as part of a companion volume to the conference
proceedings in the ACM Digital library.
* Submission Process *
Each tutorial proposal should include:
1. A half-page extended abstract (in plain text) that includes: the
title of the tutorial, the name and affiliation of the instructor(s),
and a description of the tutorial scope and content.
2. Short bio of the instructor(s) (about half page in plain text).
3. [Highly encouraged] A description of any interactive activity or demo
planned within the tutorial presentation.
* Reviewing *
Tutorial proposals will be reviewed by the GECCO 2017 organising
committee, based on the GECCO attendees' likely interest in them, the
breadth and depth of the topic(s), and the expertise and credentials of
the instructor(s).
* Information and Submissions *
Submit the tutorial proposals to:
Petr Posik, GECCO 2017 Tutorials Chair
Czech Technical University, Prague, Czech Republic
Email: petr.posik (at) fel.cvut.cz
*** Call for Workshops ***
GECCO workshops provide the possibility to commonly develop visions and
exchange ideas in an informal setting, especially if focused on an
emerging research field or interdisciplinary research area. In contrast
to regular sessions, workshops can (and should) host interactive
sessions (posters, discussions, demonstrations, etc.). Attendance at the
workshops will be free to all GECCO attendees.
Workshop organisers are responsible for coordination and publicity. They
collect and review papers, and provide a list of accepted papers and
their authors, if applicable. If required, the GECCO organisers may
provide additional support to the workshop organisers, such as
publicity. Note that organisers, participants and presenters must
register for the conference. Accepted workshop papers will be collected
by Sheridan/ACM Press, and published in a companion volume to the
conference proceedings.
* Submission Process *
Each workshop proposal needs to include:
1. A half-page extended abstract (in plain text) that includes: the
workshop title, the name and affiliation of the organiser(s), and a
description of scope and content. Please refrain from using special
characters in the title.
2. Short bio of the organiser(s) (about half-page in plain text).
3. [Highly encouraged] A description of any interactive activity or demo
planned within the workshop.
4. A draft schedule of the workshop, including the estimated duration (1
to max 4 sessions) and type of sessions.
5. If this workshop (or a similar event coordinated by the same
organisers or a subset of them) has taken place in previous years,
either at GECCO or at other events, then include URLs to the event pages.
* Reviewing of Proposals *
Workshop proposals will be reviewed by the GECCO 2017 organising
committee, based on GECCO attendees' likely interest, the breadth and
the depth of the topic(s), and the expertise and credentials of the
organiser(s).
* Information and Proposal Submissions *
Julia Handl and Markus Wagner, GECCO 2017 Workshops Chairs
Manchester Business School, United Kingdom
University of Adelaide, Australia
Email: julia.handl (at) mbs.ac.uk
markus.wagner (at) adelaide.edu.au
Webpage: http://gecco-2017.sigevo.org/index.html/Workshops
*** Call for Competitions ***
Competitions demonstrate how Evolutionary Computation and related
techniques can be utilized in challenging practical, real-world and
gaming settings. They also enable fair comparisons between algorithms
and (for recurrent competitions) provide the possibility to follow the
development of approaches over time.
* Submission process *
Each competition proposal should include:
1. A half-page abstract (plain text) that includes: competition title,
the name and affiliation of the organiser(s), a description of the
competition, and web address of last edition if already held before.
* Information and Submissions *
Mike Preuss, GECCO 2017 Competitions Chair ERCIS/Westfaelische
Wilhelms-Universitaet Muenster
Email: geccocompetitions (at) sigevolution.org
Webpage: http://gecco-2017.sigevo.org/index.html/Competitions
********
GECCO is sponsored by the Association for Computing Machinery Special
Interest Group for Genetic and Evolutionary Computation (ACM SIGEVO).
********
--
Javier Ferrer
E.T.S. Ingeniería Informática
University of Málaga
Tel: +34 95213 2815
Fax: +34 95213 1397
ferrer [at] lcc.uma.es
http://neo.lcc.uma.es/staff/javi/
*********************************
Publicity Chair for GECCO 2017
*********************************
------------------------------
Message: 3
Date: Mon, 7 Nov 2016 15:43:11 +0100
From: Michele Lombardi <michele.lombardi2@unibo.it>
To: <dmanet@zpr.uni-koeln.de>
Subject: [DMANET] CPAIOR 2017 - AI, OR and CP for Optimization **
Updated deadlines **
Message-ID: <etPan.582092ff.68569e11.1002c@unibo.it>
Content-Type: text/plain; charset="utf-8"
=============================================
CPAIOR 2017, Third Call for Papers
Padova, June 5-8 2017
http://cpaior2017.dei.unipd.it/
=============================================
*** Updated dealines! ***
- Abstracts: November 16, 2016
- Papers: November 22, 2016
[Apologies for cross-posting]
General Information
-------------------
The Fourteenth International Conference on Integration of Artificial Intelligence and Operations Research Techniques in Constraint Programming will be held in Padova, Italy, June 5 - 8, 2017, with a Master Class on "Computational Techniques for Combinatorial Optimization" on June 5, and the Main Conference on June 6 - 8, 2017.
The aim of the conference is to bring together interested researchers from Constraint Programming (CP), Artificial Intelligence (AI), and Operations Research (OR) to present new techniques or applications in combinatorial optimization, and to provide an opportunity for researchers in one area to learn about techniques in the others.
A main objective of this conference series is also to give these researchers the opportunity to show how the integration of techniques from different fields can lead to interesting results on large and complex problems.
Therefore papers that actively combine, integrate, or contrast approaches from more than one of the areas are especially solicited. High quality papers from a single area are also welcome, provided that they are of interest to other communities involved. Application papers showcasing CP/AI/OR techniques on novel and challenging applications or experience reports on such applications are strongly encouraged.
The program committee invites submissions that include but are not limited to the following topics:
* Inference and relaxation methods: constraint propagation, cutting planes, global constraints, graph algorithms, dynamic programming, Lagrangian and convex relaxations, heuristic functions based on relaxations.
* Search methods: branch and bound, intelligent backtracking, incomplete search, randomized search, portfolios, column generation, Benders decomposition or any other decomposition methods, local search and metaheuristics
* Integration of machine learning and optimization: learning-based search and heuristics, use of predictive models in optimization, constraint acquisition, optimization for training machine learning models
* Integration methods: solver communication, model transformations and solver selection, parallel and distributed resolution techniques, models, and solvers.
* Modeling methods: comparison of models, symmetry breaking, uncertainty, dominance relationships.
* Innovative Applications of CP/AI/OR techniques.
* Implementation of CP/AI/OR techniques and optimization systems.
More information is available on the conference web site: http://cpaior2017.dei.unipd.it/
Important Dates
---------------
* Abstract submission deadline: 14 Nov
* Paper submission deadline: 21 Nov
* Rebuttal period: 20-23 Dec
* Final notification: 16 Jan
* Camera-ready version: 31 Jan
Submission process and formats
------------------------------
Paper submissions are of two types:
* Long papers (15 pages, plus references)
* Short papers (8 pages, plus references)
The conference proceedings will be published on the LNCS series.
Additionally, outstanding submissions to the technical program will be offered the opportunity to be published exclusively through a "fast track" process in the "Constraint" Journal. Journal fast track paper will still be regularly presented at the conference.
All papers are to be submitted electronically in PDF format via easychair:
https://easychair.org/conferences/?conf=cpaior2017
Authors should follow the submission instructions on the conference website. In the particular, they should comply with the required format (LNCS style) and page limits.
For any queries on the submission process, please contact the program chairs at domenico.salvagnin@unipd.it and michele.lombardi2@unibo.it
Organization
------------
* Program chairs:
- Domenico Salvagnin (DEI, University of Padova), http://www.dei.unipd.it/~salvagni/
- Michele Lombardi (DISI, University of Bologna), http://ai.unibo.it/people/MicheleLombardi
* Conference chair:
- Domenico Salvagnin (DEI, University of Padova), http://www.dei.unipd.it/~salvagni/
* Program Committee:
- Chris Beck, University of Toronto
- David Bergman, University of Connecticut
- Timo Berthold, Fair Isaac Germany GmbH
- Hadrien Cambazard, Grenoble INP
- Andre A. Cire, University of Toronto
- Matteo Fischetti, University of Padova
- Bernard Gendron, Université de Montréal
- Ambros Gleixner, Zuse Institute Berlin
- Carla Gomes, Cornell University
- Tias Guns, KU Leuven
- John Hooker, Tepper School of Business, Carnegie Mellon University
- Matti Järvisalo, University of Helsinki
- Serdar Kadioglu, Oracle Corporation
- Philip Kilby, Australia National University
- Joris Kinable, Carnegie Mellon University
- Jeff Linderoth, University of Wisconsin-Madison
- Andrea Lodi, École Polytechnique de Montréal
- Ines Lynce, Instituto Superior Técnico, Lisboa
- Laurent Michel, University of Connecticut
- Michela Milano, University of Bologna
- Michele Monaci, University of Bologna
- Siegfried Nijssen, UC Louvain
- Barry O'Sullivan, University College Cork, Insight center
- Claude-Guy Quimper, Université Laval
- Jean-Charles Régin, Université de Nice-Sophia Antipolis
- Louis-Martin Rousseau, École Polytechnique de Montréal
- Ashish Sabharwal, Allen Institute for Artificial Intelligence
- Scott Sanner, University of Toronto
- Pierre Schaus, UC Louvain
- Christian Schulte, KTH Royal Institute of Technology
- Helmut Simonis, University College Cork
- Christine Solnon, INSA Lyon
- Peter-J. Stuckey, University of Melbourne
- Michael Trick, Carnegie Mellon University
- Pascal Van-Hentenryck, University of Michigan
- Willem-Jan Van-Hoeve, Tepper School of Business, Carnegie Mellon University
- Sicco Verwer, Delft University of Technology
- Toby Walsh, University of New South Wales and Data61
- Alessandro Zanarini, ABB CRC
- Yingqian Zhang, TU Eindoven
------------------------------
Message: 4
Date: Mon, 7 Nov 2016 15:14:44 -0500
From: Jochen Koenemann <jochen.konemann@gmail.com>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] Final call for papers: IPCO 2017
Message-ID:
<CAEwg8=74u4aVXiWaR8N5jEDwYMgwuYst_y-DjD80LOTYo_EM-Q@mail.gmail.com>
Content-Type: text/plain; charset=UTF-8
Call for Papers for the Nineteenth
Conference on Integer Programming and Combinatorial Optimization
IPCO XIX, June 26-28, 2017 to be held at the University of Waterloo,
Ontario, Canada.
Submission deadline : November 20, 2016 (23:59 CET)
The IPCO conference is a forum for researchers and practitioners working on
various aspects of integer programming and combinatorial optimization. The
aim is to present recent developments in theory, computation, and
applications. The scope of IPCO is viewed in a broad sense, to include
algorithmic and structural results in integer programming and combinatorial
optimization as well as revealing computational studies and novel
applications of discrete optimization to practical problems.
Authors are invited to submit extended abstracts of their recent work by
November 20, 2016 (23:59 CET); see the conference website for more
information. The Program Committee will select the papers to be presented
on the basis of the submitted extended abstracts. Contributions are
expected to be original, unpublished and not submitted to journals or
conferences with proceedings before the notification date (January 31,
2017). Papers violating these requirements will not be considered by the
Program Committee.
During the conference, approximately 33 papers will be presented in
single-track sessions. Each lecture will be 30 minutes long. The
proceedings will be published as a volume of Springer Lecture Notes in
Computer Science. They will contain extended abstracts of all accepted
submissions. Each participant will receive a copy of the proceedings at the
conference. It is expected that revised and extended versions will
subsequently be submitted for publication in appropriate journals.
More information can be found on the conference webpage
http://www.math.uwaterloo.ca/ipco2017
Programme commitee:
Nikhil Bansal (TU Eindhoven)
Gérard Cornuéjols (Carnegie Mellon University)
Daniel Dadush (CWI Amsterdam)
Santanu Dey (Georgia Institute of Technology)
Fritz Eisenbrand (EPFL, chair)
Samuel Fiorini (Université libre de Bruxelles)
Anupam Gupta (Carnegie Mellon University)
Satoru Iwata (University of Tokyo)
Jochen Koenemann (University of Waterloo, local arrangements chair)
Seffi Naor (Technion)
Kurt Mehlhorn (Max Planck Institute for Computer Science)
Britta Peis (RWTH Aachen)
Laura Sanità (University of Waterloo)
Laurence Wolsey (Université catholique de Louvain)
Rico Zenklusen (ETH Zürich)
------------------------------
Message: 5
Date: Mon, 7 Nov 2016 21:57:53 +0100
From: Adi Rosen <adiro@liafa.univ-paris-diderot.fr>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] postdoctoral positions at IRIF (prev., LIAFA),
Paris, France
Message-ID:
<FC584CF9-C86A-493F-A891-6EEF811B0AF7@liafa.univ-paris-diderot.fr>
Content-Type: text/plain; charset=us-ascii
The Algorithms and Complexity group of IRIF - previously LIAFA -
(CNRS and University ParisDiderot), Paris, France, is seeking excellent
candidates for one or more postdoctoral positions in classical and quantum
computing. Topics of interest include (but are not limited to): algorithms,
streaming algorithms, approximation algorithms, online algorithms, communication
complexity, cryptography (including post-quantum cryptography), computational
game theory, quantum computing, computational applications of logic, randomness
in computing.
IRIF is a joint laboratory of the CNRS (the French National Center
for Scientific Research) and University Paris Diderot - Paris 7.
For more information about IRIF, please see
http://www.irif.univ-paris-diderot.fr ,
and for more information about the Algorithms and Complexity group
please see http://algo.irif.univ-paris-diderot.fr .
Further information may be obtained from any of the permanent
members of the group.
The starting date of the position(s) will usually be in September 2017
but can be negotiated.
The application should include a CV, a summary of research and
names of at least three references. For further instructions on how to
submit applications, please visit the "openings" sections at:
algo.irif.univ-paris-diderot.fr .
The position(s) will be financed either by the team's own resources, or
via joint applications of the candidate and the team to external funding
sources.
Applications should be received by November 15, 2016.
------------------------------
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 105, Issue 7
**************************************
No comments:
Post a Comment