LISTSERV mailing list manager LISTSERV 16.0

Help for EC-DIGEST-L Archives


EC-DIGEST-L Archives

EC-DIGEST-L Archives


EC-DIGEST-L@LISTSERV.GMU.EDU


View:

Message:

[

First

|

Previous

|

Next

|

Last

]

By Topic:

[

First

|

Previous

|

Next

|

Last

]

By Author:

[

First

|

Previous

|

Next

|

Last

]

Font:

Proportional Font

LISTSERV Archives

LISTSERV Archives

EC-DIGEST-L Home

EC-DIGEST-L Home

EC-DIGEST-L  December 2020

EC-DIGEST-L December 2020

Subject:

EC-Digest v34n12

From:

Eric 'Siggy' Scott <[log in to unmask]>

Reply-To:

Evolutionary Computation Digest <[log in to unmask]>

Date:

Thu, 3 Dec 2020 20:01:23 -0500

Content-Type:

text/plain

Parts/Attachments:

Parts/Attachments

text/plain (613 lines)

Evolutionary Computation Digest — Thursday, 03 December 2020, Volume
34: Issue 12

SUBMISSION ADDRESS:    [log in to unmask]
NEW LIST ARCHIVE:      http://listserv.gmu.edu/cgi-bin/wa?A0=EC-DIGEST-L

(UN)SUBSCRIPTION INSTRUCTIONS:  at the bottom of this email

********************************************************************************
Today's Topics:

Announcements:
----
- 04 December: Lecturer Position in Algorithms (University of Sheffield, UK)
- Microsoft Research Postdoc: ML and AI
- Microsoft Research Postdoc: Reinforcement Learning
- PhD Studentship in Multi-task Learning in Deep Neural Networks

 CFPs (with submission deadline)
 ----
 - Call for sessions on Evolutionary and Swarm Optimizatino @ EURO 2021
 - 12 January, 2021: Genetic Improvement Workshop (@ICSE)
 - 25 January, 2021: Conference on Machine Learning, Optimization, and
Data Science (LOD 2021)
 - 31 January, 2021: IEEE Workshop on Parallel/Distributed
Combinatorics and Optimization (PDCO)
 - 30 February, 2021: Book Chapters---Handbook of Nature-Inspired Optimization
 - 28 May, 2021: Call for Entries: 18th Annual "Humies" Awards

********************************************************************************
CALENDAR OF EC-RELATED ACTIVITIES:

April 7–9, 2021, Seville, Spain: EvoStar 2021

July 10–14, 2021, Lille, France: GECCO 2021


********************************************************************************
Sender: Pietro Oliveto <[log in to unmask]>
Subject: Lecturer Position in Algorithms (University of Sheffield, UK)
[Closing Date: 4 December 2020]

This is an exciting opportunity for a Lecturer in Algorithms at the
University of Sheffield, UK,  a world top 100 University. Working in
the Department of Computer Science, you will join our established
Algorithms Group. The group focuses on the design and analysis of
algorithms which provably solve computational problems efficiently.

The Department is embarking on an exciting growth strategy following
our strong performance in the Research Excellence Framework (REF)
2014, in which we were ranked 5th out of 89 computer science
departments in the UK. To build upon our continued success, we seek to
appoint a Lecturer in the design and analysis of algorithms, with
specialist expertise in an area including, but not limited to:

randomised algorithms
streaming algorithms and sublinear-time algorithms
combinatorial optimisation
approximation algorithms
parameterised complexity and fixed-parameter tractable algorithms
distributed computing
graph algorithms analysis
data structures design and analysis
algorithmic game theory
randomised search heuristics

You will hold a PhD in computer science or a related area, and you
will be able to conduct research to the highest standards. You will
secure research funding, publish in high impact journals and
conferences, supervise research students and manage research projects.
As a teacher, you will play a key role in maintaining our reputation
for high-quality teaching by designing, delivering and assessing
undergraduate and postgraduate-level courses in computer science. We
seek candidates who will be able to make a distinctive individual
contribution to our algorithms research portfolio.

We’re one of the best not-for-profit organisations to work for in the
UK. The University’s Total Reward Package includes a competitive
salary, a generous Pension Scheme and annual leave entitlement, as
well as access to a range of learning and development courses to
support your personal and professional development.

We build teams of people from different heritages and lifestyles whose
talent and contributions complement each other to greatest effect. We
believe diversity in all its forms delivers greater impact through
research, teaching and student experience. The Department of Computer
Science holds a Silver Athena SWAN award, in recognition of our
commitment to equality and diversity.

This role has been identified as a full-time post, but we are
committed to exploring flexible working opportunities with our staff
which benefit both the individual and the University. We would be
pleased to consider flexible delivery of the role subject to meeting
the business needs of the post.

For more information:

https://secure-web.cisco.com/186OoROp4sGksA5wpMI6u_hQU3pA5I7d01JoFxwmZ1NiSfXdA1zKzj74UhuAPPsRmo19jOpuacbzi4d2rSRI7k4NXZmUvkUmcJHJCqUraRqMUeFF80qjnWrAyjnPs8fGbuf-pOJfv9ED4mQqqxm9MMeU3CKzXbpIvMnQVldq0qDA4nnUp1_Y5BtqsmdfVTTEWCbpP-dW8StBMCOPGK8adJOWuKfX1j2C2XmUNnbp5TyO9UWnPaZyHWc-N8nXGt_TgvanlDdY4-lENcmg3Y_DThbJLHVBt5rWpT98jsno0chGP0Sr9YT3Ok5UDin4kzktxt5LnSqpTW46BhK4BJi6tF1l4eBGCdRk2Jd04cOI-4NYiVDDwAYDTWgAK8gVi6ntSqM_4pBKQlj6mLuk0MH2NikoXXqBICEuYWdxFTdYOAZX3CKMbchSGG1M-QkxQLbLJ/https%3A%2F%2Fwww.jobs.ac.uk%2Fjob%2FCCJ593%2Flecturer-in-algorithms

https://secure-web.cisco.com/1DN-ZzQa7pU3mjjoibjJkCLYLbrkZn_cyI5xvkvZ6IybgMRL5RtnimKgirsxaT4slo-ZnaFsSy6Lyft3V7Gz84f2iEsGaJ2Xy5gJFQCsH3HSyYj4iSP8SUzIiuVS5rANe7YWMy8Op6no0Yix5RegmoNHQntiru7S0q5tG8nC8pcqguj8Jti8oa1wAK8Or926U57Impknp5oOvd9CFCKgLHkDlyvgbRoe5iywFYLWdeSgul8CuAvI35L0vy4GWEnjm6LmkRR__GMZdcMqvFlyEbm20YWHJ47AxZ1MGi08ar9IpCNmoxO2kksk1lDBvoNwOjfvG5rRhm7CmKEJ93n83mVNNfORqob3SHBcrO6iWJVulobjt48Z2VfV8glOi0ceGh_a36RcwGiMubX-GiJPr3QyN_GM0LKvDl3M-96BrhTaMWUkxrmzVAaHM5-uKAFCbTukrjlIzcjS5Gq8ML0AyFA/https%3A%2F%2Fwww.sheffield.ac.uk%2Fdcs%2Fabout-department%2Fjobs


********************************************************************************
Sender: Cyril Zhang <[log in to unmask]>
Subject: ML/AI postdoc positions at Microsoft Research NYC

Microsoft Research in New York City seeks outstanding postdoc
applicants in the areas of machine learning, artificial intelligence,
and related fields.

Microsoft Research offers an exhilarating and supportive environment
for cutting-edge, multidisciplinary research, both theoretical and
applied, with access to an extraordinary diversity of big and small
data sources, an open publications policy, and close links to top
academic institutions around the world. We seek applicants with the
passion and ability to craft and pursue an independent research
program, including a strong publication record at top research venues.
The earliest start date is July 1, 2021.

APPLICATION DEADLINE FOR FULL CONSIDERATION: November 29, 2020.

For more details, and to apply, visit:

https://careers.microsoft.com/us/en/job/924426/Post-Doc-Researcher-ML-AI-Microsoft-Research


********************************************************************************
Sender: Cyril Zhang <[log in to unmask]>
Subject: RL research positions at Microsoft Research

Microsoft Research is expanding its global Reinforcement Learning team
and has multiple openings for researchers (at all levels), postdocs,
and engineers with interest in all aspects of this field, including
theory, empirics and applications. In addition to candidates working
on core RL, we encourage applicants from related research areas such
as deep learning and representation learning, natural language
processing, computer vision, games, dialog systems, online learning,
operations research, systems, and other areas (e.g., theoretical CS
and HCI), as long as their future research agenda overlaps with RL or
sequential decision making. We are hiring in New York, Redmond,
Montreal, Boston, and Cambridge UK.

Microsoft Research wants to enable the next generation of machine
learning using interactive reinforcement-based approaches to solve
real-world problems. We believe that the best solutions will arise by
combining expertise of people with many different backgrounds and this
unique opportunity is part of that effort. To see more details on the
existing people and examples of some of the ongoing RL projects,
please see https://www.microsoft.com/en-us/research/group/reinforcement-learning-group/.
The links to apply for specific positions are:

Postdoctoral positions:
https://careers.microsoft.com/us/en/job/694258/Post-Doc-Researcher
Full-time roles for recent graduates:
https://secure-web.cisco.com/1Ec0r3B1EvsG7NE4XsZeZH2EjiXCwygd9-aKmDsy-IqVTq_a5XhvpalEx-XQbTgiP2H6hdSny3VP1f0NlujabDfusbsYvitKPgQfr9e_jMZXtg0srUaxfctisooydbBwNUojIt8EdJxgCFu8cW4zXbvd2KTTIsIGpa8-krbk11pjk6BLMOQYLg_rPH5vZRUn9KCrlYdBkHBSXiLIu59wSrdbvMJUWXujGVxpGxJ8isLMsbw-ppp57w9rGsKreMit6uR8QGn0zUA1zmNNUwie5IlTO6I6wnDgGgiz_ylmijualNu9rpmgWN__AxCEuSnocVArMt0-mDvNxYR0rOjgFtcqJOyX0_rFVmEWg_MVaDzZ4k6dhV3rDOnJvNJ_znlzVQWaTz9JlJr8d4ZG_pXphF0wh8MCRFms5V-sXVvU8BGaqkvZHmHq3PwdIi9wSJ_5U/https%3A%2F%2Fcareers.microsoft.com%2Fus%2Fen%2Fjob%2F703442%2FSenior-Researcher
Full-time roles for more senior levels:
https://careers.microsoft.com/us/en/job/733335/Principal-Researcher
All positions: https://secure-web.cisco.com/1w0C_OQtaEkEXrRDxS7xx97eZIewz8eNZdcRC5DhgtU4Dv2Ff8wLOfqX9DUAIaRl1v6_Sze_pbQCH98WtFu7yjioZ9lhmzH6kdQCLbiItXbrKn8GLGPd6fVUz-ViJnJsm_B7cpdD_-gGqxfHpy23r2MLBR-IHcJmyzhmcsVbxHncxDHbLMUragwUwlILG_s8vmDMGJUHRsFfMHy9h2AejAgQyWnGIyr_8vcn8hzEjj7IyZ-2Rp_kc53EZ3LCDbyGRMsSdsh-5nabkrypVHT3JoJBcYoyy5bpS5FYduizRt-MxnJNtMu2GeDSn6HgRwgFS0Z3D1IsYxEFeOBpCDKWvN31q_aYMim7ENi7Cf-Jw8p-NShus-ouhfgWYtvwlIYtRcJnvPvSaNej4kmC-wdhaNk1lGAoa21-ngW7iW3ZqCvhkCMmGrilXKJH2YDct465uKaldDaYRyLC5kLm2OkDWOg/https%3A%2F%2Faka.ms%2Frl_hiring


********************************************************************************
Sender: ICAS <[log in to unmask]>
Subject: PhD Studentship in Computer Science - Multi-task Learning in
Deep Neural Networks

PhD Studentship in Computer Science -

Multi-task Learning in Deep Neural Networks

Supervisors: Professor Giuseppe Di Fatta; Professor Xia Hong;

Project Overview:
In AI and Deep Learning a fascinating challenge is to create an agent
that can solve multiple tasks. In the large majority of machine
learning approaches, the trained model is specialised on a single task
and is useless to solve any other problem. Multi-task Learning (MTL)
is an approach to machine learning in which a model is trained to
solve multiple tasks simultaneously. This is similar to the learning
process in humans, who learn general skills useful to multiple tasks:
e.g., hand dexterity is useful to solve many tasks and is improved by
learning many tasks at the same time. In machine learning MTL has been
shown to be particularly effective in generating better generalised
models that take advantage of the similarities and differences across
tasks. Its effectiveness is also very useful in solving a group of
problems altogether, each of which with a limited number of training
records.
In this PhD project MTL methods will be investigated to identify the
best approaches for Deep Neural Networks and, in particular, for
training the networks with evolutionary algorithms instead of a more
classic gradient descent strategy. The overarching aim of this project
is to contribute to theory and applications of machine learning with
effective deep Neuroevolution algorithms and non-linear optimization
methods. A key enabling factor to understand deep neural networks is
to consider neural networks as complex networks, this PhD project will
try to decipher the complex neural networks by the information
theoretic learning principle, in general, and the information
bottleneck, in particular.
Multi-task Deep Neuroevolution will be applied to classic and recent
testbeds for deep learning (e.g., CIFAR-100, Atari games, XTREME,
StarCraftII) as well as real-world problems, such as the prediction of
neurodegenerative diseases (dementia) from human brain images or
synthetic motor control for modelling  rich and diverse motor
behaviours across multiple tasks at humanoid scale.
The project will be guided by a team of experienced supervisors with
extensive competence in this area and will have access to
state-of-the-art computing facilities.

Eligibility:
Applicants should hold or expect to gain a minimum of a 2:1 Bachelor
Degree or equivalent in Mathematics or Computer Science.

Funding Details:
Starts January 2021 or soon after
3 year award
Funding covers full tuition fees plus UKRI stipend

How to apply:
To apply for this studentship please submit an application for a PhD
in Computer Science at
http://secure-web.cisco.com/1l5Er4qaOUVNyyIGi9XnM1hxqeusuVro9o0R0c918mbDtFVcA2gxkwg5VOZf4uxEJsnnXtUOh_GJSh0MsBpRrZor8DFtvUfTZGFyOzS3be5rhyDZQ7Mgh_8KKHoRoisVp-wSrBEEa6y5oWCbumxfNeQ63I-12lzaqwX8vNPLQzzI3v5V5NGsTzEhIBdXCHH-KPmYyE_T58kWGM3neXuTSsF2NC62UYQLdB1g8kltn89bGZwrDa4PBKU7AILorkQwMqofs78mq91jvdvHj8e_hb7Nk0PoBjBDUS51AprYdZYWUIWc5eaAf6kUTMD15PMMzrClhsYqrdtXck-keinkxt8d86vWt4ED7eKJpuiyWMWn-I2pbwHV6-sct98xpnIlbvI06DQRBaeyGcgeJIhqZzOirVmPrp7PJ7Wt1GdGI8mOy05f4Kd2Zpy8rZkjWofW1/http%3A%2F%2Fwww.reading.ac.uk%2Fgraduateschool%2Fprospectivestudents%2Fgs-how-to-apply.aspx.

*Important notes*

Please quote the reference ‘GS20-097’ in the ‘Scholarships applied
for’ box which appears within the Funding Section of your on-line
application.
When you are prompted to upload a research proposal, please submit a
personal statement (max 1 page) to present your interest, motivation
and suitability for this project

Further Enquiries:
Please note that, where a candidate is successful in being awarded
funding, this will be confirmed via a formal studentship award letter;
this will be provided separately from any Offer of Admission and will
be subject to standard checks for eligibility and other criteria.
For further details please contact [log in to unmask], quoting
the reference ‘GS20-097’ in the email subject.


********************************************************************************
Sender: Patrick Siarry <[log in to unmask]>
Subject: Call for sessions on topics associated with the stream
“Evolutionary and Swarm Optimization ” of EURO 2021 _ Athens, Greece,
11-14 July 2021

EURO 2021, the 31st European Conference on Operational Research
Athens, Greece, 11-14 July 2021 (https://secure-web.cisco.com/14SwEZpicPClgbGDn73etlIjH-Dd-jYVDs7HjkBr0xdk6LagMUgihaquqsA0BjKP3z6B0Jc3Z5jM2c3W3BBYuPrY5mWh_4_whGUX9x4e76Ps93Y7iw2hK6fiyjU4tPwDL62WsEWUqn87hZ2awPgYsPzLc1UiX94_ASrM9TTITQWgMq9Mxo6NuhzBdur-Cw9SFKSWTcHB5s9aKW2yts602YwC0l5TuyHlwCXVpcGW7tSlAGwLSydWtCx0Tk_PNi6OvlPbsy05N9f5bDfzYcW-HgvJqlh6pl0r9YdustSYc2mdPGYm9AXS64EfDEYZEq-dsjDlMNEuzhrQGVpScnavRMgZPNuFiSagSodebxC97Nvjz8b9NI17kugD1IcMebFCdUngWleJhC5r9AR4epDK8-a0xoAFwhxc9mFc1IUCZR7oQCYeKcw4whUMgxyZyusOqE-aKnSY5yKLQGV4pzwLRaQ/https%3A%2F%2Feuro2021athens.com%2F%29
=======================================
 «  Evolutionary and Swarm Optimization » Stream
“Discrete Optimization Algorithms” Area
=======================================

We invite proposals for sessions on topics associated with the Stream
“Evolutionary and Swarm Optimization ” which falls within the Area
“Discrete Optimization Algorithms”. If you are interested in running a
session with this stream, please email us with details of your
proposal (including the session title and names of the potential
organizers). Sessions could, for example, specialise in particular
problem areas (e.g. transportation, timetabling, energy management
etc) or examine the application of a particular technique that employs
Evolutionary or Swarm principles, such as illumination algorithms,
distributed algorithms or performance comparisons across techniques.

Best Wishes,

Laetitia Jourdan - [log in to unmask]
Patrick Siarry - [log in to unmask]
Neil Urquhart - [log in to unmask]


********************************************************************************
Sender: w langdon <[log in to unmask]>
Subject: GI-2021 deadline 12 Jan 2021 Genetic Improvement workshop CFP

10th International Workshop on the Repair and Optimisation of Software
                          using Computational Search

                              23-29 May 2021

                 http://secure-web.cisco.com/1aUUAPSNWfTMxpMrddSMtIiBCC_Q-jCBCUwZIUD0_c0-vdIX4Zyh-p9CJS5eG9xtq65CzGR2TBp2Kw5Z4UnvxDKECmH5CW5wwqInkKv1fhPTHPLnQoLyt8RMrONBGrljBUg9Dhjt3B-ftx2QheclxSrBU5pXTCiZnTBJ2gz7UtVc55EsIezXJE6axFYXRuTVrKD6YiE4qyJDt7EOyzqP52RGFrvlXVgLw80P4HW5rSabHFR4ie1rebpe9a3U7m9m0b-siR_ulBNTB8RSgEUQ6FbuR85G9Un_FN2ntQSxrQnT5mrIDpodeFZxNuu_lxn-lwnIniO64sdYwZYSkTTcts7K_jsDxG5nW9QaLrlRh3UKdAvj5fQz34jP4n4dks8mCTJapRqD9R_Rt6XQwVzI1YMaj1OYOar534Q8kNg0g64CG6YoFKhQ9DKEm_IeYLzB-L7JvckDk3VpEhnZn1mi212x3NQHMdKwX9DCISgldbKs/http%3A%2F%2Fgeneticimprovementofsoftware.com%2F
                twitter https://twitter.com/gi2021 @gi2021

  Co-located with the 43rd International Conference on Software Engineering,
  ICSE 2021, Madrid, Spain, and virtually.

Paper submission deadline: 12 January 2021

Call for Submissions:

We invite submissions that discuss recent developments in all areas of
research on, and applications of, Genetic Improvement.

GI is the premier workshop in the field and provides an opportunity
for researchers interested in automated program repair and software
optimisation to disseminate their work, exchange ideas and discover
new research directions.

Topics of interest include both the theory and practice of
Genetic Improvement. Applications include, but are not limited to,
using GI to:

 * Improve efficiency
 * Decrease memory consumption
 * Decrease energy consumption
 * Transplant new functionality
 * Specialise software
 * Translate between programming languages
 * Generate multiple versions of software
 * Repair bugs

Key Dates:

    Submission    12 January  2021 (Tue)
    Notification  22 February 2021 (Mon)
    Camera-ready  12 March    2021 (Fri)
    Workshop      23-29 May 2021


********************************************************************************
Sender: ICAS <[log in to unmask]>
Subject: Save the Date: The 7th Online & Onsite Int. Conf. on Machine
Learning, Optimization & Data Science

Save the Date:
The 7th Online & Onsite International Conference on Machine Learning,
Optimization, and Data Science – LOD 2021
June 29 - July 2, Grasmere, Lake District, England – UK

Dear Colleague,

The 7th International Online & Onsite Conference on Machine Learning,
Optimization, and Data Science – LOD 2021, June 29 - July 2, Grasmere,
Lake District, England – UK

https://secure-web.cisco.com/1IJl1FODqvZLJTkNZZESQvc_Jg_w2VBhkLGfHYClBIoCc7qVM1HkbHjLahKKTUNopIdin3EgmAhRtNowKvTgrnOjDpCvh2L-ipasenVOHWUjQENmTATBnpQEz5utV6umbngE5uiJ8zCgzkYEIFXuUjc6SNOC0YKRcziCdf7dnayNAeHkf3SkWBKgblNaNKuE95mwpdp_B2qoaxgAgzmb4ZKNipMS_mR3rz-eGP_l5uI2Tfbm-OOgetYYdQWvZOmPoU3NCd9AACKJw5Q5lXZn7Pepwl5GmAanQMrRT4yttelLM7DENokqpP40RrVN8Ov5NluYg_WhuoxOgT3bt1ZcMUf3zf5mzznApo1aUWwY1-3BxbbhL6rw9H_LJ0Lx8qgds-0fkcJGCyPxet0xnpkRovQsoxPgbAGazEhXqun-qnDqHBGHxBph22h6QumVEQ-gmvG6-xDe-8T2Uxae1PwI_WA/https%3A%2F%2Flod2021.icas.cc

[log in to unmask]

Important Dates:
* Special Session Proposals: Monday December 14, 2020.
* Paper Submission Deadline: Monday January 25, 2021 – Anywhere on Earth.

https://easychair.org/conferences/?conf=lod2021
https://secure-web.cisco.com/1-dktixMY0aecT_ek6vmRT6ssN4yqpFRRgsbxJEyh7eZ2goa2-TqWSfzkKcmTA0tUgXonmoW63n276LQFQu3yIhLfyhS8SmN57tihBaVVu3RFNhrv1J2VfqVQh6L60Rva5QKWc7eOIqulOvAuHjJbHxcaNQQUVyvKIuOLxFvC5FyBndOtagZLOIpq_dhH0Stqma_V_v1trYjXzt9jTWRVH8NHh9-YZ6K5MSZtU58AOX4CYsw1Y0_0qGXWyJ9wwZIJMKy-WvMCPtrS1Zwoh-3BCIga28Km-6f1bGRhauKH6vp7irXxmFtD20j_2Z1o_BjcERU3LwLrZ6SM2yHmdMrJ3KjZWMkApCCtNXpZLubCpTvNJ761_Rd5si3Y3sITgIRSzcVg_xntzUMjQ1NACg7DdPkZMcCqQ8oJdf8mCNYmAw9uuFhycLLYRNyJHDFqhOBtRQsTFfCGV2JtI1KodKlBPQ/https%3A%2F%2Flod2021.icas.cc%2Fdeadlines%2F


********************************************************************************
Sender: "Grégoire DANOY" <[log in to unmask]>
Subject: CFP - 11th IEEE Workshop on Parallel / Distributed
Combinatorics and Optimization (PDCO) in conjunction with IEEE IPDPS
2021

The 11th IEEE Workshop on Parallel / Distributed
               Combinatorics and Optimization (PDCO 2021)

                 https://secure-web.cisco.com/11bRiUCx82Uetrt-1YV3WM8nU1wgP_l2JENY6xxZVKwm1DSSVvEPPjcGFVfiXUUkWgIhfq_NL6sAgaJrSb8Ec6s4SjVnHaIYrOrfYkhvHndTg9_a-gHSXcxAPGGIS-9OdvDU2d0zvS5KBDfsX5HvToIRA5fpcqkfzLNnf5v6o__QFHj74iJjLI_c2OwNpVRnJvV1YuKSBx6A4xptxTw8EUpMlZ98a1EaKcidCXc9QVkIXDYAxm3mcpILS3q5HKu7TAe1etbRTsl0m6UhBNRyvJ5PUl4FVBdvaT_pq4xPJT8lK28VMo_Et-Gl_ZjW8ohGBXnWBcz0gJh7BgXtR9I6ayEu0hL0tt_hDIgMUaD8f-FYxrWitE9Ln9h333QAAUaOVM6bf68ogXnY1gfD-WKbaUH1A1As-B4CbGU1Lpb34C_buyRi-4fpPo7loZuQ5sy0Dct6myG5NMKSATf9NWLOkRA/https%3A%2F%2Fpdco2021.sciencesconf.org%2F

                             held in conjunction with
                           the 35th IEEE International
   Parallel and Distributed Processing Symposium (IPDPS'2021)
                                   May 17-21, 2021

                                     Portland, USA
                                http://secure-web.cisco.com/1eCWPpWAIuEO6Fs8VYXBuLvDNFiOmS-DWq7i7FBycLrMPGEiMa3DjSJnYlib4vsQQRGC-4GPU5V0md2aVT54zYsrbv0xn_ry_w_skzX7AmXSBQ9Z2ZqirnVN03HveHucnxQAqjBIciBkjtx5G56D5No9BEjU_3CfMeJ-PCf1N_MUWfE6B4WEr2SJUXbk5JMPA8JzxHKD90dBlIIZ_TTT3CCUN2f9pzD6Vx86fBcVw_8DlNP1smeA_YYN_W8KqwqfJ_BKTm3dq81I05rWD0Ccy-P22cM62wYXw5oKbTPaCyjEe1exhYwsqBLANccphzgHk_9FZqckTgARsjEt8f4cTYJtx0-oC-xdZnTLf5jZvCO61LZok9YkuI-FUn94-Xw2C8Th0zEC0FYgNuUjqI2U7oeuunKkyvZ13dPqmXAmBYrXtzCt-euQozcNV3bzgM0aZM6LolC-vHkSBJTnO2lhFeQ/http%3A%2F%2Fwww.ipdps.org

Scope:
======
The IEEE Workshop on Parallel / Distributed Combinatorics and
Optimization aims at providing a forum for scientific researchers and
engineers on recent advances in the field of parallel or distributed
combinatorics for difficult optimization problems, ranging from
theoretical to applied problems. The latter include for instance 0-1
multidimensional knapsack problems and cutting stock problems, large
scale linear programming problems, nonlinear optimization problems,
global optimization and scheduling problems.

Emphasis will be placed on new techniques for solving difficult
optimization problems, like cooperative methods for integer
programming problems, nature-inspired techniques and hybrid methods.
Aspects related to Combinatorial Scientific Computing (CSC) will also
be treated. We also solicit submissions of original manuscripts on
sparse matrix computations and related topics (including graph
algorithms); and related methods and tools for their efficiency on
different parallel systems. Applications combining traditional
parallel and distributed combinatorics and optimization techniques as
well as theoretical issues (convergence, complexity, etc.) are
welcome.

Application domains of interest include (but are not limited to) cloud
computing, planning, logistics, manufacturing, finance,
telecommunications and computational biology.


Topics:
=======
* Exact methods, heuristics, metaheuristics, hybrid methods;
* Parallel / distributed algorithms for combinatorial optimization;
* Parallel / distributed  metaheuristics;
* Nature inspired parallel / distributed computing;
* Integer programming, linear programming, nonlinear programming;
* Global optimization, polynomial optimization;
* Cooperative methods, hybrid methods;
* Parallel sparse matrix computations, graph algorithms, load balancing;
* Applications: cloud computing, planning, logistics, manufacturing,
finance, telecommunications, computational biology, combinatorial
algorithms in high performance computing.

Important Dates:
================
- Submission deadline: January 31, 2021
- Decision notification: March 1, 2021
- Camera-Ready papers due: March 15, 2021
- Workshop: May 17, 2021


********************************************************************************
Sender: "[log in to unmask]" <[log in to unmask]>
Subject: IEEE CIS School ; Call for Book Chapters ;

Dear Colleague,

We look forward to your participations in the following activities.

1.   IEEE CIS Summer School at IIT Indore:  We’re delighted to inform
that IIT Indore is organizing a 4 days IEEE Computational Intelligence
Society (CIS) Summer School (online mode) on "Emerging Research Trends
in Computational Intelligence – Theory and Applications" during
November 26-29, 2020. Details of the summer school are available at
 http://secure-web.cisco.com/1jaEyR-Znd90objajbWFWFW8OCqn8afUbnUFmV7UJ2QuvFW_eylPRmb3fMN-D_DHmXo4YJsRCQuhVZhyYJ3OLjtRa9hYw-MkXWPsOHu-xMQQjLCjzT4ZMa4cFKQxX2xH-WL8Yre3GHXX6T8ofela4v81AVb8N1i41qTftOM-iAb13lZaeKSn6F1UQVXD_eGCUP5elSF6iVuSZrCVgDh3YS1gEePDk8ij7g67tvoWbg3w_Fr2cat0Ei-KtXq9x3q6P0Cn1qG0V6vpnerakxBHOuwJIVLH1MfdWJ_7sjzAH2ftS5Tz8N-fJDUckhQivZ5AylvE2BFXpo1UH68KczLFFvN9-4_2lXXAp7rvt89ulONKrNx67xMVAdeYGjVMIoHQ3oILq2aHGtO2dL8Y0L25K5DM4bwR1YN7r3cyWy-0GtIgaTTbWEWnirvNrUhvN_3PnUeg585Cq9YKsTOi18ptygA/http%3A%2F%2Fevents.iiti.ac.in%2Fieee-cis-summer-school%2Fdocs%2FCIS-Summer_School_Program_Schedule.pdf
        http://secure-web.cisco.com/1Gfu8-H_V1LfLeOBfUXFeVhB7WnxQJhR7wAmaJzwBPZKCK6YsIMRCOz70K8aq5iXCVe92HZCdSTbLNW951RBH_wdp1fFvcNDfh1pMC22qU57qGc1VfZZzbAUkDmFPfk-idgicIrHzKVoL7QXhkcOa-M6xSC7ggx0rU1fvCRxEO5qaUaGEY6E7lJGWWHAlY2o8U97HPrdcLRzRcb8JDIAcav0jYJysuEAa1IGIHHcZGvTf_imlFpPKZZT-eV-Jtid3m1ySlvWkX2YFUN535BME-gnZ4qx_XxAHozzNQChxfiab6UbyZ4fj2frBqO0EjH7EzgYlK8zfEin6uUpCU0ZwRY-UvYEieSjzw9UXlnbvi64BYQ0mrtXcheRyWi1DDdxHafShdduZFPLDbIaZ9dtqvekmNAOMZ9ta8xUq8NdI7Yf74euL0Q1ZmU6YQMG-WgxWVllg2tNdyFU58o5HWWW8hg/http%3A%2F%2Fevents.iiti.ac.in%2Fieee-cis-summer-school%2Fregistration


2.  Call for Book Chapters (Springer Book):  Handbook of
Nature-Inspired Optimization Algorithms: The State of the Art Volume
I: Solving Single Objective Bound-Constrained Real-Parameter Numerical
Optimization Problems
https://secure-web.cisco.com/1EI0oJusJxKbZ1qJvkQL0V7gMBGkeWQJQdSPYW6rWp6Ej7gsMnDPJqDcbSYp32H_g_XOc7FzEd0cFzYmnohwSZmJ2HR30UQQ2Lr-WfQtSxtE46Am-GmJnmywu6WxYFVnC89d6L4-AMK-XR6kCTVUxM7HLoPC0yvJHSMTj5RlIHEIOrGS3kZyRyUAb7XTSVF0oGmvDh1RQgMf1BEaPN8Vr4TQu-fwi6Ka5o3thox7FvNwW8pp7vax6LsUpKNZKwYybzP8U5VrI8v04nkBEzTZvKUp6Id4_L0-5vAsrQwFn54yUSrX3X_GpsTO7jJVWqCVooctviFEBJpBIjskQhziRzGDcEoN4h0URYZOiEyMNLYmEMZrpDbhi1RoO7175HBPukaBGcdNjBV-2k33LxXmCj82V_M6pNrLUIXYcG_NRrD7N5volFCanH9D23JPc_bT7XVz4DCGOJ5mOcm0NI8n9Zg/https%3A%2F%2Fwww3.ntu.edu.sg%2Fhome%2Fepnsugan%2Findex_files%2FHB-Vol-1.pdf


3.   Call for Book Chapters (Springer Book):   Handbook of
Nature-Inspired Optimization Algorithms: The State of the Art Volume
II: Solving Single Objective Constrained Real-Parameter Optimization
Problems
https://secure-web.cisco.com/1rVUdBgKqf6u6pOGIYpISrO7wdZolpza47JKJgojsTJMY_cyMloCotSOddN5TJws2X11opwwD0hw-BwSU7ZSn8IYVWmEQPM1ptwxktC4xBUTRTep_WfoBaWsaSZW65xXMzQkDRITj9fyAnw6-F8sG4fnahSWO3VSHNxMVk2gXDfjDP5Xv5LeSamcX_vzCVRlqR82ViuaIaobHA6WTeCzhn0sbtFw3z8NQfvOMXKSgch8MAtv2y6WXvJKx11-7Nz9XqMIFWszdLS3ieAS5l0BFZEtFdJEAUkpMbh5fjDSok8VmsIcIuiwy057ILUcFdeMJH7S0ovvZdyq2Pmv_w1gQ7r3UeVP6BZlPOueHEu0veti-8s3hZbhjejoUuPcTqxw0ZpnEgB4S9QCL3ztYBcRfWG0-bfFvy4w652dnUap_kcyt02io2xegPUGQZukkjR38xgUNkXJN_gsMerm8QR_p-A/https%3A%2F%2Fwww3.ntu.edu.sg%2Fhome%2Fepnsugan%2Findex_files%2FHB-Vol-2.pdf


4.  Three CEC 2021 Competitions with associated Special Sessions
(SS-37 & SS-46) in Krakow, Poland in June-July 2021 (
https://secure-web.cisco.com/1aja5c1NcMVOV_A8Kx_G61j6VquYoAKKmiDMH92NpbqzvFQGzW_ZckIRZ7clfrmsaSIN1QNyPzlislaldLOAtfmZYhtuq-0j9yw5h84zRmT7vieCF_aIyDrw8cWPKfnSH8MvHV4CWsm_HiB77QmzicfJ1P0it2Im9VaLAK6k2ldVmpG2cXK91_FuJz4Khrg8UrwfjoBqbMsBpB1iOlA6WmyvPaF6g3Zq_mzbatbB6vaarjprfsQWzUyIZKWRfCW5gI6juWwuPnI-hNAywe9oJdoqTLOuQh10qsTXMhHr81z5Exr9yTksKlGeHBC7JqVsyKM0qEFt-9iCS5PUEiDUqPVIeMmWB47q_O5a2JP22TMRKf92nDfcil2R3VkyDxJeHFCDWt8GyJEkDiX7IqBvJcLD57AJcsBgGE04BBbheDRbX-WlEuFrjB4RezqZbIt07DM9b49Wi3w1L9NCSzCqfpg/https%3A%2F%2Fcec2021.mini.pw.edu.pl%2Fen ):

(a)  Real-World Multiobjective Constrained Optimization:
https://secure-web.cisco.com/18h4KeacpJhld7HOub16UQX-OKXCQZWVkUgXnjWw_Reonvz8OBJXVOS__avA0NT2tZyYPHgJ611MVcaLdAaH0PRyaoXl88H4SzjFRFgj04bxRyyvYQR-5dZbJaURM7gH9pvkE2StXCmRs4-b_I634CQMlcP7SblhZ0yORDw3dRVOLhTA-ooT825Ag-GNuNxgyh70vmbIk9u4yWiQmEfEJv_SFdOqC9S7EOop-Wqc5jhpsSgelU4I8b5v6suhAHqmF7asH7N1BiNX3G_ZwMcYAQw-e8Gt2jSrQFWzTkKskm3ID0DSnTR17-luEyqLJ9z3GQN8Wpq5k1nW78Q_D7DKXZ_ZK9VJJ_aeZVrzzCE2Jy1187_Jyrrj7vUAz-9THyFzR-1jU7c5ZZBB0BiXZ2RIsTPlogasRH9p3pJR-E0P0a2itRPqQ1YjBVChNzP9rxwstoauPwE52VfzPdCWJDDKzww/https%3A%2F%2Fwww3.ntu.edu.sg%2Fhome%2Fepnsugan%2Findex_files%2FCEC2021%2FCEC2021-1.htm

 (b)   Real Parameter Single Objective Bound Constrained Optimization:
   https://secure-web.cisco.com/1s4Se3wb17qZ5D6LDwmUk4gQo1CghMg5PGlxPysFZHTezT3ti0J8t11O_L9ypXZuVXklINEWL6ekkbOix6s025anvW_-4ifpdPcdRpVm7ZEyFhAZIte0MzNi8d9OfTSl9h8Ho7DldaSl09gQeYoYNJtDheDMQ8xyf-FK32KNoSJu_hTMvXUzyh49Yo5pQw0zX996-zWHULGLLGi7SDhpDOGiu4DUqLBi_L-ZWCHIVlJYcT1lcNZHRbKawbi1l-6Yj9WQj0EBUWhyvA62_2ZW73G8rVNOEW_3PBY8_3T4gs0Xk-WAGaCYyz-aAHts38i6M-hUyNvmbA-89vBa_4yGGPugj355bag9ys68WXm_w3Xbetx3e5fiky-v_ZTVeK3r226aVl3XlCv9V8nf6lFMnnmOsGLS6PoK243PEauQRjuO5u_qMijMWd6gaYNnSIhSXiB1onB3GI3tfo0fobj_0Lw/https%3A%2F%2Fwww3.ntu.edu.sg%2Fhome%2Fepnsugan%2Findex_files%2FCEC2021%2FCEC2021-2.htm

 (c)   Multimodal Multiobjective Path Planning Optimization:
http://secure-web.cisco.com/1KKdYn-3M-53x0jkPNWMHfBaB5M8eeNV9V0bqmF9xYzTp3CWbGTE8UtlzuHOiBs1Zo1TuNZa_iDhVxm4ts8Da7U0JIq6VuXL-TQp44rZUsMr3OLmnYS1667YbJgQQQzkkU-t_l_AV6wQpxGE8T565SlB4m5nl914dhYqwpUwMQt7Cvey494LnS7ajI2_P9Q6DLjjmRONO9HfPmZQC0kj-rrO8F2u5MwyHpB9IfuYLWL92AyoEtvmQk1Nwd6ma6CGq1dyrMNtMI-5USRv1t1LUB8j0ip6hd1ryB9g2zksuRXdOTlg4lx4DQIypS8d11GHuXO856UYPKjOIXS3_Y4dmQmlUpyhKAOI0eIRQdGKDvzbukpOG7dNtHe6XCjqeO5zo4I3yYal7eFGbu4eDXT9hTaCyyYhQLC3ybaq0NS7RlBcaQaR0Kpv3ggH5kNy_KO6d-LJii96AA9VsnFiEgOGScg/http%3A%2F%2Fwww5.zzu.edu.cn%2Fecilab%2Finfo%2F1036%2F1251.htm


5.   Surveys   &     Benchmarks For Evolutionary & Swarm Algorithms:
       https://secure-web.cisco.com/1V4iW4jE2v6ozL5WcsAg-Y2foWK0L9gUSmqOJHoyB91HKfZhuwlMcHRq0BumBPgFctxSpESfzTRPlyF0hKAF3KPUl7Mh_VWrHBfjTMURoz0eiunoaO3uaG45RvTPJqA1KGRpfQ3ic9RwIMS6FszZN8Yo4jgvuX9OicUxvRZjGsScjj9pOvRoivyAcI1W85GxJGA_2QeJqLiL__OjeYk3cU3TompQC_EwAh7HE3ag7sGE2ZAbh0qP17vrNPWQsLA389df2AknRP0QOv-jkpXeMyO2fFFEF6ym-ny9sugsvpzZ3Kc6J-IiWKyoUg_1lgYQjVV0YU-P0OY0HDKMU-Qwmn43nkOuV9MXcgJ1XV4Ts1B_WDFgYINh0KUptf17up3oYyzki7U8CUux4YPHivoIlW-qEMdpqSxF9BkK4LkcRVxh9n5guzc52wkkH-HWVSKo3/https%3A%2F%2Fwww.ntu.edu.sg%2Fhome%2Fepnsugan%2Findex_files%2Fsurveys-tutorials.htm
       https://secure-web.cisco.com/1PR4ndds2ioKOFmqVD5t63WSu5xP0CAQChWzNDITt-FDUaKQbwVQhtNx1sw8nFQ3bNEiPvvqG9GwZL-0Cee0CNpe-7CPm1543GSYfrqSKlApk2wOPUoTE4J6rHtuT3wvWsIgHEdqX_gKYd2iVf7CfYPUbHVcWOogLf54757S9CKVDrcvcYUApWgvtEqQUoSm-DPs-mmFfij_6WsLVB--GMebJQoiNWKtzTsPpjglB9-4bJ6Vw0izEt_XyyzlsuDQX0o46ITQwr8KsJW1WrnfRabe0-us8OZKaqiFBYSws8WPV4tmdIK80aT_lmQ9jeMqKr3oGUjdZUhnmPnuwdhPaNnoiNB0mon_7tjwEAObDGZpdos_ztRWCVANttbZGreopYWqGR9KxqI_BRze_O5JQlsbf6PL1nSRa7C6MUjpU0agSM_MLn-CO31f-VBjX2uI3/https%3A%2F%2Fwww.ntu.edu.sg%2Fhome%2Fepnsugan%2Findex_files%2Fcec-benchmarking.htm

6.       Codes/software of our publications available for downloading:
          https://secure-web.cisco.com/1aePghforuvGvo5SNoeXZrQ2MkB5V_2xE6yyBr9vHR6WS0w6OUHkJlZr23LinaenSEDVUSQmo19sMIuMmXx7Cm7XqfNw3cTtFeqsZB1xEJaujTg9Cz-RmEEYhod6wBNBKnwOFugEoMCTaUIjqjJwUgC2hInlMB0NyMVlPpjmFtSuW1MAtbl8Si3mI-DpXhlFtCaL2rTWwDCYVoorCp0wqz1i2S8pKwCyuqX7yG4z4Xf1z7i3zVvjw0JVLkumoQ6Y1XofUtlLuDd5rE9Q4rBNpuvbeEJat_UPbN1j8DkbqVZKgiaW7APOecALINvDBsmY-EzAtrivM8xUU1GehfCF8e5qc62yqxlJFunGbkJ5GQUfaRVy1TvTAsD4dG4MRl_lcNqcD5dvYWV32d3SO2j9rE0DUUxLj5oR9_b7_WjSC-Gsx9Aea2R9XC2HudBJv0vN6eMbIz5vn-PhxAX4235KKdg/https%3A%2F%2Fwww3.ntu.edu.sg%2Fhome%2Fepnsugan%2Findex_files%2Fpublications.htm
         https://secure-web.cisco.com/1Lpr7QKBYw-RSA9-mNArSJ5GJoKck7cC2-Q3jVACqcra2p1ocxOguCyPCCnjfMJTdc3AXHbiC49YcmXI5USq2eOtD2BR3BsHg7VYAWRiyGy-UwU6URS5oICGdSfY9wFh-YWvW6Xw35f44Hz8M59kDA5A0M6bpW4cJ6LwBRJMkXpMwyn6WAOBrGjojwgo4Qv2m-r-80YKF6b6rhkCDL4wYIBSs1UXXu9RKG6_8qPIpuwMnNDRZkzmr5f_lMhQNlQUh7peNKnP4oeoTe3Ui-fl4rG8pW93XCX1Zj4RtyioP9p3VtUFZjfCrL_7PLd2qRQ0_A_U3y24TWFR8eugZlT-QOuFtJ0D-MH3nwr-vTNIJrmgBfbpOTEUkhEXc2nT6kF7R_qGaCDMzWejPjT-4feW8caBr4ohFJeGXFH1DNMlemFyJKfUdxQhlGXgzU0JoMAH_A7yUMHwAdOck-YL_cV_Ygg/https%3A%2F%2Fgithub.com%2FP-N-Suganthan


********************************************************************************
Sender: w langdon <[log in to unmask]>
Subject: Call For Entries 18th Annual (2021) "Humies" Awards


      Call For Entries
                    18th Annual (2021) "Humies" Awards
For Human-Competitive Results Produced by Genetic and Evolutionary Computation


To be held as part of:

Genetic and Evolutionary Computation Conference (GECCO)
July 10-14, 2021 (Saturday - Wednesday)
Lille, France

See the latest, updated information at http://secure-web.cisco.com/1s6ePAbijkKxJ-_dVM6MhK53vUIb5m7aYYAfYnDNUK0PPGTzGmpgGQ5tgWQU98VFtPgrfVYVkeD7a12MaEO6Jga6403UyivgEL12mZJZcSjRWbwkCGjLzcVZ6f1Jxjy-pnoglmvN6ajNyB-rPCBFnIwLw7X2ejK8jCHA1uxdU3UCaCYsi2zlHWWKgc1CNZKguF_TtXk-MRhflpc73cvQbmru312PBBXZwPM7Z4ZzGda-1EEEfzDmgMG559RrJjyoP6enX6BuvHCpkyETTNbSE2yg7mHPVj2ofhspCiQcV2tACnWRPYKMQ3jmBxBN4BVGkHf2tFEt2QzmPDssKS40prhE3dH1-COzTlpVuS8IIHawjjn2Mr24PmSq6zH9kO_LnI7YE0KA6BMobM5Y0IoTSuAkDXkVSQH0pT9iQbSWTO7dgKMZTeqc6z7SkH36k-29fTogP_9cEmicrHe6Qf7XLaA/http%3A%2F%2Fwww.human-competitive.org%2F

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.

This information is also available at the GECCO-2021 website, under
the "Calls" dropdown at top of the main page, which takes you to
https://secure-web.cisco.com/1h227dO86fv47AazHrakv3HhSM7a9QwaJ-qlX3ZTOCX7-3Zq8BccsRkNCG0r8tQSexInSnXjsQT_ibjUR6cLnfFT9tmpzP4h9VOQhrAcvpF8k34tAu_daTthoygS0x4k6HhRj-D0WFhiokHwROsXjY-8Wu428Bc6ggOaJnS804B5WOAQ-8LeO_YF1Xt9SZ0UebXEFL4QCbXPmjhEfhvQQJPnooY4Z-BCjrD9xdHhDU-twLOjupVPbqEp2tWIhgpnd3FhsYZew63utefFwxES__kUNupqLpj1us73v8EZBhkaeHmPBq8C6yxOBrfQi-EDDyz9q1wTHCUXjvs9nGOEsGfB7hrQrqYUEtfeCLUL-l_gNXzwxrm7KospFqO6wO7WOY5q61R8FiwVkR0SfxA2w89r70mLL_Ltfsx-UG-LCGuykpN0wysHxvQL2POuJ74-n5XpeIY-LCG28o-lTK58cKw/https%3A%2F%2Fgecco-2021.sigevo.org%2FHumies.  At least one author of the
submission must be registered for GECCO, although there is no
requirement to present a paper there--only the in-person or video
presentation of the Humies entry.


Important Dates:

 * Friday May 28, 2021
   Deadline for entries (consisting of one TEXT file, PDF files for
   one or more papers, and possible "in press" documentation. Please
   send entries to goodman at msu dot edu

 * Friday June 11, 2021
   Finalists will be notified by e-mail

 * Friday, June 25, 2021
   Finalists not presenting in person must submit a 10-minute video
   presentation to goodman at msu dot edu.

 * July 10-14, 2021 (Saturday - Wednesday)
   GECCO conference
   (the schedule for the Humies session is not yet final, so please
   check the GECCO program as it is updated)

 * Monday, July 12, 2021, 13:40-15:20
   Presentation session, where 10-minute videos will be available for
   viewing.

 * Wednesday, July 14, 2021
   Announcement of awards at plenary session of the GECCO conference


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
must be a refereed publication in the open literature (e.g., the GECCO
conference, any another reviewed conference or workshop, journal, or
chapter in edited book). Submission of more than one entry by a single
person or team is allowed.

The competition is open to any paper

 (1) published in the open literature between May 29, 2020
(the deadline for the previous year's competition) and May 28, 2021
(the deadline for this competition), (explicitly including GECCO-2000) 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.

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.

Please find the full call for entries and detailed instructions for at
the following URL:
http://secure-web.cisco.com/1A2SrFgk0IgfXoqTW9JTM6thuu7AOMf37yZun_1xgairINvJ6H45AoZgYrsWvFsh4dz9JdsCuWKrcPHGQSHcNXfm8GHj78jyPMoGLtsqjArah2R3SsbT0bYsJ4VaxMXA1I3hueO2sCYXmDUQB6Vly2_p62AOZ63vd-v3AL_Y5dfjxd_Gi1AgVZ8Ja3kds4TwWTxaDJlKbCl7Fbzb9QtDZN5Qieg4Mg3D5wVUQybCK7-oD1bCylRfM6mUnritOsuVo60FUhQ0EF6Yju1DPV4s8r5XSxymyV9tsesHBejrAmL69uNdm_fmkRv4uA4BEgo4h7ZOoLISa2phCLFqXPyxPX87bLZp1H0Z9SzG1jZFilCTaAUx7GPOwRC0aO4ErIJEpT4c63xcQKJJGBZGS0kzYAfYjyWexsrMrtPEzQkbiUaDX5VbNT5J6xO3ZQTQdoeoIDlIgIsrOrSLpIwkg8XsvHg/http%3A%2F%2Fwww.human-competitive.org%2Fcall-for-entries


Bill
        Prof. W. B. Langdon
        Department of Computer Science
        University College London
        Gower Street, London WC1E 6BT, UK
        http://secure-web.cisco.com/1AOr8BPKq5meCabJqQP61rsKOgz9u8aVZCO2ABG9PhsURInut94xdCjM9QIkhxRsosUJlD0nkM5nYk3TMKkxzy2HyePwzQexlFU3qNRqZ9Pfp5Snm1oX1m2BzgEszRvwUcr-B4QLfuGEFeWpaAArPAkYt-kCXJcrSh5w6qSE3ziGsVDQW3cmZWrjvD8D1ilUcfBQIkmKdtQTvbx45ImpA1MhSTw3aPM5Cm615-0s9m5FHiyf86A_dowZQY73Y3cWPA3oyHHPYoVIow5Cnqqg4f4pgZoFB1VD-msOy-iMDp0PQMFPMm0ZLWSJX4k0PgMFopf2vsVaUM0Z900WXIalB_NY1_JMBAPopE59Dry4XE3t0ET0yLXS05L0kHW_iWDPilfpTZ9gWPwocyvZ2JgFAmY3tVBQ0VRo-YyGyYeVRzk8F42A1QDNQmCL2jQ_RlykinmrtcwOYTXdFWVJb7JbuFw/http%3A%2F%2Fwww0.cs.ucl.ac.uk%2Fstaff%2FW.Langdon%2F


********************************************************************************
(UN)SUBSCRIPTION INSTRUCTIONS:

 - Send submissions (articles) to [log in to unmask]
 DO NOT send submissions to the [log in to unmask] address.

 - To subscribe send email to [log in to unmask] containing the
 following text in the body of the message:

   subscribe ec-digest-l <Your Name (up to 4 words)>

 - To unsubscribe send email to [log in to unmask] containing the
 following text in the body of the message:

   unsubscribe ec-digest-l

 - To change your email address, simply unsubscribe the old address
 and subscribe the new one.

 - Send other administrative requests to [log in to unmask]

********************************************************************************
 End of Evolutionary Computation Digest
********************************************************************************

Top of Message | Previous Page | Permalink

Advanced Options


Options

Log In

Log In

Get Password

Get Password


Search Archives

Search Archives


Subscribe or Unsubscribe

Subscribe or Unsubscribe


Archives

August 2021
May 2021
March 2021
January 2021
December 2020
November 2020
October 2020
September 2020
July 2020
June 2020
May 2020
April 2020
February 2020
January 2020
March 2019
February 2019
March 2018
February 2018
January 2018
November 2017
October 2017
September 2017
August 2017
July 2017
June 2017
May 2017
April 2017
March 2017
January 2017
December 2016
November 2016
September 2016
July 2016
June 2016
May 2016
April 2016
March 2016
January 2016
September 2015
May 2015
March 2015
October 2014
September 2014
August 2014
June 2013
May 2013
March 2013
February 2013
January 2013
August 2012
June 2012
February 2012
January 2012
December 2011
November 2011
October 2011
September 2011
August 2011
July 2011
June 2011
April 2011
March 2011
February 2011
January 2011
December 2010
November 2010
October 2010
September 2010
August 2010
July 2010
June 2010
May 2010
April 2010
March 2010
February 2010
January 2010
December 2009
November 2009
October 2009
September 2009
August 2009
July 2009
April 2009
March 2009
February 2009
January 2009

ATOM RSS1 RSS2



LISTSERV.GMU.EDU

CataList Email List Search Powered by the LISTSERV Email List Manager