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. Extended deadline: 1 September 2015, Special Issue in
Evolutionary Computation Journal (MIT Press) on Combinatorial
Optimization Problems (José Francisco Chicano García)
2. BCTCS 2015, September 14-18, Middlesex University, London.
(Michele Zito)
3. Positions available in Fleetmatcs / Florence (Italy)
(Fabio Schoen)
4. symposium "GRAPHS" - ICNAAM 2015 (Vojislav Petrovic)
----------------------------------------------------------------------
Message: 1
Date: Mon, 20 Jul 2015 20:51:18 +0200
From: José Francisco Chicano García <chicano@lcc.uma.es>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] Extended deadline: 1 September 2015, Special Issue
in Evolutionary Computation Journal (MIT Press) on Combinatorial
Optimization Problems
Message-ID: <E2F7A468-AE30-4583-A5A2-DED5AB12C951@lcc.uma.es>
Content-Type: text/plain; charset=utf-8
===============================================================
Special Issue in Evolutionary Computation Journal, MIT Press
on Combinatorial Optimization Problems
http://ecj.fhv.at
===============================================================
** DESCRIPTION
Combinatorial Optimization Problems consist in finding an optimal solution (according to some objective function) from a finite search space. These problems arise in Industry and Academia and, unfortunately, most of them cannot be solved efficiently, that is, they are NP-hard and no polynomial time algorithm is known to solve them. For this reason, in the last decades researches have investigated the use of stochastic search algorithms to find near optimal solutions to these problems. In particular, a great research effort has been devoted to the development of metaheuristic algorithms to solve combinatorial optimization problems.
Successfully solved problems include scheduling, timetabling, network design, transportation and distribution problems, vehicle routing, travelling salesman, graph problems, satisfiability, energy optimization problems, packing problems and planning problems.
Prominent examples of metaheuristics include evolutionary algorithms, simulated annealing, tabu search, scatter search, memetic algorithms, ant colony optimization, particle swarm optimization, variable neighbourhood search, iterated local search, greedy randomized adaptive search procedures, estimation of distribution algorithms, hyperheuristics and hybrid algorithms.
We encourage authors to submit original high-quality research on the application of metaheuristic algorithms to combinatorial optimization problems or theoretical aspects of this application.
** SUBMISSION GUIDELINES
All submissions have to be prepared according to the "guidelines for authors" as published in the journal website at http://ecj.fhv.at . Authors should submit their manuscripts to the Evolutionary Computation Editorial Manager at http://ecj.fhv.at . When submitting a paper, please send at the same time an email to Francisco Chicano (chicano@lcc.uma.es) and a copy to ecj@fhv.at mentioning the special issue, the paper title, and author list to inform about the submission.
** TENTATIVE SCHEDULE
1 September 2015 submission deadline (extended)
15 December 2015 authors notification
15 March 2016 authors' revisions
1 July 2016 final notification
15 July 2016 final manuscript
Winter 2016 tentative publication
** GUEST EDITORS
Francisco Chicano
e-mail: chicano@lcc.uma.es
Universidad de Malaga, Spain
Christian Blum
e-mail: christian.blum@ehu.es
University of the Basque Country, Spain
Gabriela Ochoa
e-mail: gabriela.ochoa@cs.stir.ac.uk
University of Stirling, Scotland, UK
------------------------------
Message: 2
Date: Tue, 21 Jul 2015 09:16:27 +0100 (BST)
From: Michele Zito <Michele@liverpool.ac.uk>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] BCTCS 2015, September 14-18, Middlesex University,
London.
Message-ID: <alpine.LRH.2.11.1507210916010.17769@ssh2.csc.liv.ac.uk>
Content-Type: TEXT/PLAIN; CHARSET=UTF-8; FORMAT=flowed
British Colloquium for Theoretical Computer Science
Middlesex University, Hendon, London, UK
14th--18th September 2015
http://www.cs.mdx.ac.uk/foundations/bctcs2015/
CALL FOR PARTICIPATION
The 31st British Colloquium for Theoretical Computer Science will be
hosted by the Foundations of Computing Group, Department of
Computer Science, Middlesex University, from 14th to 18th September,
2015.
Associated with the meeting, on Thursday 17th September, is the
London Mathematical Society (LMS) Algorithms & Cryptography Day. The
LMS will celebrate its 150th anniversary as BCTCS celebrates its 30th
with its first visit to the capital.
The purpose of BCTCS is to provide a forum in which researchers in
theoretical computer science can meet, present research findings, and
discuss developments in the field. It also aims to provide an
environment in which PhD students can gain experience in presenting
their work, and benefit from contact with established researchers.
The scope of the colloquium includes all aspects of theoretical
computer science, including automata theory, algorithms, complexity
theory, semantics, formal methods, concurrency, types, languages and
logics. Both computer scientists and mathematicians are welcome to
attend, as are participants from outside of the UK.
The colloquium features both invited and contributed talks. This year
the invited speakers currently include the following (with one or two
more to be added).
Samson Abramsky, Oxford University, UK.
Timothy Gowers, Cambridge University (tbc).
Tony Hoare, Microsoft Research.
Thomas Hales, University of Pittsburgh, USA, (LMS Keynote).
Per Martin-Lof, Stockholm University, Sweden.
Joseph Sifakis, University of Grenoble, France.
The LMS meeting on Thursday also has eminent speakers.
Lance Fortnow, Georgia Tech, USA.
Shafi Goldwasser, MIT, USA.
Jon Kleinberg, Cornell University, USA.
Mike Paterson, University of Warwick.
Adi Shamir, Weizmann Institute, Israel (tbc).
Nigel Smart, University of Bristol.
Registration is now open from the following link:
The registration fee is £140 plus £40 for the conference dinner (note
the receipt will not be itemised). We are grateful for support from the
Heilbronn Institute for Mathematical Research which will provide
bursaries for 18 students to cover registration fees and accommodation.
Please register for free at the same link and please send titles and
abstracts of contributed talks to g.primiero@mdx.ac.uk
The deadline for registration is 14th August.
We have reserved a number of rooms at Hendon Hall Hotel at £110 per
night (please contact barnabymartin@gmail.com). However, there is the
possibility to stay at many hotels within a short bus journey and these
rooms are cheaper when booked by individuals (we tried unsuccessfully
to obtain discounts).
Barnaby Martin, Raja Nagarajan and Giuseppe Primiero.
Organising Committee.
---2146799616-856649149-1437466525=:17769--
------------------------------
Message: 3
Date: Tue, 21 Jul 2015 10:39:17 +0200
From: Fabio Schoen <fabio.schoen@gmail.com>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] Positions available in Fleetmatcs / Florence (Italy)
Message-ID:
<CAFPkRR5qC_Vun3Tpt_8sU9TfEG_1AZM701pErG01-yafdYtUww@mail.gmail.com>
Content-Type: text/plain; charset=UTF-8
Research Engineer in Florence, Italy
Fleetmatics (www.fleetmatics.com) has an immediate need for a Research
Engineer to facilitate the design and development of our award winning web
application suite.
This role will be responsible for the in-house research and development of
both internal and external service offerings that support Fleetmatics
customers and integration partners.
It will use state-of-the-art machine learning and data mining algorithms to
analyse our massive datasets.
A strong technical background is expected, and successful applicants will
also exhibit leadership or organizational strengths.
Basic Qualifications:
Master's Degree in computer science or equivalent education;
Strong computer science fundamentals (Algorithms and Data Structures);
Familiar with Microsoft and Unix/Linux environments;
Excellent understanding of algorithm design, implementation and testing.
Ability to read advanced scientific papers and extract the main ideas.
Excellent communications skills to clearly articulate complex technical
issues to all levels of the organization (both technical and
non-technical).
Results oriented with a strong / demonstrated track record of successful
delivery.
Fluent in English.
Essential Qualifications:
2+ year's scientific research experience in the field of Computer Science,
Data Analytics or Operations Research;
2+ Years Programming experience with C++, C#, Java or other relevant OOP
languages;
Hands-on experience with predictive modeling, machine learning, data
mining, and parallel computing.
Desired Qualifications:
PhD in Computer Science, Data Analytics or Operations Research.
Advanced knowledge of algorithms and data structures for large scale
optimization problems; parallel and distributed programming;
Experience with R (r-project.org) and Big Data Analytics tools (Hadoop,
Spark or similar).
If you are interested, you can contact info@kkt.it or email directly to
me (I will forward your request)
Fabio Schoen
--
Fabio Schoen
Professor of Operations Research <http://www.scienceofbetter.org/>
Dip. Ingegneria dell'Informazione <http://www.dinfo.unifi.it/> - Univ.
di Firenze <http://www.unifi.it/>
via di S.Marta 3, 50139 FIRENZE (Italy)
<http://maps.google.it/maps?f=q&source=s_q&hl=it&geocode=&q=via+di+S.Marta+3,+50139+FIRENZE+%28Italy%29&aq=&sll=43.773668,11.26929&sspn=0.010443,0.01929&ie=UTF8&hq=&hnear=Via+di+Santa+Marta,+3,+50139+Firenze,+Toscana&z=16>
New telephone: +39 055 275 8512
Adjunct professor of Operations Management
New York University <http://www.nyu.edu/> (Florence campus villa La Pietra
<http://www.nyu.edu/global/lapietra/>)
Links:
- my public agenda
<http://www.google.com/calendar/embed?src=t2qhhqunll2imfrlev263lqu50@group.calendar.google.com>
- Global Optimization Laboratory "Gerardo Poggiali"
<http://webgol.dinfo.unifi.it/>
- Mailing List "Ricerca Operativa"
<https://www.di.unito.it/listserver/info/ricercaoperativa>
-
------------------------------
Message: 4
Date: Tue, 21 Jul 2015 14:40:07 +0200
From: "Vojislav Petrovic" <vojpet@dmi.uns.ac.rs>
To: <dmanet@zpr.uni-koeln.de>
Subject: [DMANET] symposium "GRAPHS" - ICNAAM 2015
Message-ID: <000301d0c3b2$6056f150$2104d3f0$@uns.ac.rs>
Content-Type: text/plain; charset="us-ascii"
LAST CALL FOR PARTICIPATION
Symposium GRAPHS, ICNAAM 2015 (International Conference
of Numerical Analysis and Applied Mathematics 2015),
23-29 September 2015, Rodos Palace Hotel, Rhodes, Greece
Organizer: Vojislav Petrovic (DMI Novi Sad)
Topics:
- scores in graphs and digraphs
- Eulerian and Hamiltonian graphs and digraphs
- planar graphs
- graph factors and decompositions
- graph colorings
- extremal graphs
- graph spectra
- tournaments and hypertournaments
- graph algorithms
Email to vojpet@dmi.uns.ac.rs or vojpet@gmail.com to announce
registration.
For further information
vojpet@dmi.uns.ac.rs or vojpet@gmail.com
or visit
Vojislav Petrovic
------------------------------
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 89, Issue 16
**************************************
No comments:
Post a Comment