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. computational optimization (Stefka Fidanova)
2. CFP: EXPLORE 2016 @ AAMAS 2016: The 3rd Workshop on Exploring
Beyond the Worst Case in Computational Social Choice (David Manlove)
3. Postdoctoral Positions at U. de Chile (Jose Correa)
----------------------------------------------------------------------
Message: 1
Date: Mon, 14 Dec 2015 10:04:47 +0200
From: Stefka Fidanova <stefka.fidanova@gmail.com>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] computational optimization
Message-ID:
<CAAL360t=diXJYHgPB0PcRgHczfxprMzSwq_XyseJo5MAsSa-jw@mail.gmail.com>
Content-Type: text/plain; charset=UTF-8
------------
Call for Papers
9th International Workshop on Computational Optimization (WCO 2016)
Gdansk, Poland, September 11 - 14, 2016)
organized in the framework of FEDERATED CONFERENCE ON COMPUTER SCIENCE
AND INFORMATION SYSTEMS
FedCSIS - 2016
====================
We invite original contributions related with both theoretical and
practical aspects of optimization methods.
The list of topics includes, but is not limited to:
* unconstrained and constrained optimization
* combinatorial optimization
* continues optimization
* global optimization
* multiobjective optimization
* optimization in dynamic and/or noisy environments
* large scale optimization
* parallel and distributed approaches in optimization
* random search algorithms, simulated annealing, tabu search and other
derivative free optimization methods
* nature inspired optimization methods (evolutionary algorithms, ant
colony optimization, particle swarm optimization, immune artificial
systems etc)
* hybrid optimization algorithms involving natural computing
techniques and other global and local optimization methods
*computational biology and optimization
* distance geometry and applications
* optimization methods for learning processes and data mining
* application of optimization methods on real life and industrial problems
* computational optimization methods in statistics, econometrics,
finance, physics, chemistry, biology, medicine, engineering etc.
====================
Important dates:
18.04.2016 (April 18, 2016) – Full paper submission
30.05.2016 (May 30, 2016) - Position paper submission
13.06.2016 (June 13, 2016) – Notification of acceptance
04.07.2016 (July 04, 2016) – Camera-ready version of the accepted paper
====================
Submission and Publication
* Authors should submit draft papers as PDF.
* The total length of a paper should not exceed 10 pages for full
paper and 4 pages for short papers (IEEE style). IEEE style templates
are available at http://www.fedcsis.org/.
* Papers will be refereed and accepted on the basis of their
scientific merit and relevance to the workshop.
* Accepted and Presented paper will be published in the Conference
Proceedings and included in the IEEE Xplore database (pending) and
indexed in the DBLP.
* Extended versions of selected papers presented during the conference
will be published as Special Issue(s) of Springer Studies of
Computational Intelligence.
====================
If you have any question do not hesitate to send a mail to wco2016@fedcsis.org .
Organizing Committee
Stefka Fidanova, Bulgarian Academy of Science, Bulgaria
Daniela Zaharie, West University of Timisoara, Romania
Antonio Mucherino, IRISA, France
--
Assoc. Prof. Stefka Fidanova
IICT-BAS
Acad. G. Bonchev str. bl.25A
1113 Sofia Bulgaria
Ph. +359-2-9796642
------------------------------
Message: 2
Date: Mon, 14 Dec 2015 08:44:59 +0000
From: David Manlove <David.Manlove@glasgow.ac.uk>
To: "dmanet@zpr.uni-koeln.de" <dmanet@zpr.uni-koeln.de>
Subject: [DMANET] CFP: EXPLORE 2016 @ AAMAS 2016: The 3rd Workshop on
Exploring Beyond the Worst Case in Computational Social Choice
Message-ID:
<6E4BAC4BE29C91439F73E175D4B227953A07DAFB@CMS08-02.campus.gla.ac.uk>
Content-Type: text/plain; charset="iso-8859-1"
CFP: EXPLORE 2016 @ AAMAS 2016: The 3rd Workshop on Exploring Beyond the Worst Case in Computational Social Choice
To be held at the 15th Conference for Autonomous Agents and Multi-Agent Systems, AAMAS 2016
May 9th or 10th, 2016
Singapore
http://www.explore-2016.preflib.org/
Computational Social Choice (ComSoc) is a rapidly developing field at the intersection of computer science, economics, social choice, and political science. Many, often disjoint, groups of researchers both outside and within computer science study group decision making and preference aggregation. The computer science view of social choice focuses on computational aspects of social choice and importing ideas from social choice into computer science, broadly. While the surge of research in this area has created dramatic benefits in the areas of market matchings, recommendation systems, and preference aggregation, much of the ComSoc community remains focused on worst case assumptions.
As ComSoc evolves there is an increased need to relax or revise some of the more common assumptions in the field: worst case complexity, complete information, and overly-restricted domains, among others. This means going beyond traditional algorithmic and complexity results and providing a more nuanced look, using real data, parameterized algorithms, and human and agent experimentation to provide a fresh and impactful view of group decision making. This goes hand in hand with highlighting the practical applications of much of the theoretical research - as much of the most impactful work in ComSoc does. It also involves looking at more complex preference aggregation settings that help model real world requirements.
We encourage research related to:
* Algorithms
* Empirical Studies
* Average case analysis
* Identification of tractable sub-cases
* Fixed parameter complexity analysis
* Benchmarking and analysis from the preference handling and recommendation systems
* Studies of matching and auction mechanisms
* Crowd-sourcing and other real-world data aggregation domains.
Many of these tools, techniques, and studies are concentrated in a particular sub-field and researchers in other areas of ComSoc and related communities may be keen to import some of the tools and techniques developed in other areas.
Program Notes
-------------
The workshop is currently scheduled for a full day. We plan for the program to include an invited talk from a local researcher and possibly a short tutorial.
Important Dates
---------------
Paper Submission Deadline: February 1, 2016
Author Notification: March 1, 2016
Conference and Workshop: May 9 or 10, 2016
Organization Committee
----------------------
Haris Aziz, Data61 and UNSW
Felix Brandt, Technische Universität München
David Manlove, University of Glasgow
Nicholas Mattei, Data61 and UNSW
Submission Instructions
-----------------------
Submissions will be handled by EasyChair, the site is available at https://easychair.org/conferences/?conf=explore2016.
Papers should be in AAMAS format, allowing 8 pages of text plus 1 page for references.
Travel and Attendance Information
---------------------------------
The workshop will be held in conjunction with AAMAS 2016 in Singapore. Please see the AAMAS website for more information regarding registration, travel, and accommodations: http://sis.smu.edu.sg/aamas2016.
We hope to see you there.
--Haris, Felix, David, and Nicholas
------------------------------
Message: 3
Date: Mon, 14 Dec 2015 12:40:47 -0300
From: Jose Correa <joser.correa@gmail.com>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] Postdoctoral Positions at U. de Chile
Message-ID:
<CAEhp_TWbJ4ny4YZyaTxrJPKVCvVOMu69dxq8QTs9rNXHRZe=bg@mail.gmail.com>
Content-Type: text/plain; charset=UTF-8
Two postdoctoral positions are available at the Department of
Industrial Engineering of Universidad de Chile (Santiago) starting in
April 2016, or by mutual agreement at any date thereafter. The
positions emerge as a joint venture between the Institute for Market
Imperfections and Public Policy <http://mipp.cl>, led by professor
Juan Escobar <http://www.dii.uchile.cl/~jescobar/>, and the Millennium
Nucleus Information and Coordination in Networks
<http://acgo.uchile.cl>, led by professor Jose Correa
<http://www.dii.uchile.cl/~jcorrea/>.
The selected candidates will devote fully to research, spending a
significant fraction of their time working on a large scale and high
impact project related to matching markets and market design. The
appointment will be for a period of 12 months, renewable by mutual
agreement, with a gross monthly salary of 1.700.000 CLP. Shorter
periods may also be considered. Travel support is available.
Applicants must hold a recent (or be close to completion) PhD in Computer
Science, Economics, Operations Research or related fields and should have
provable
research expertise in game theory. Knowledge and background on
matching theory is a plus though not a requirement. Applications
including curriculum vitae, list of publications, research plan (1
page), and names of references with their e-mail addresses, should be
sent electronically to Jose Correa or Juan Escobar. To ensure full
consideration the application should be sent before the deadline of
January 15th, 2016. Late applications will be considered on a case by
case basis.
------------------------------
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 94, Issue 13
**************************************
No comments:
Post a Comment