Rigorous Research Foundations of Bio-Inspired Computing

About Rigorous Research

The Rigorous Research team was established in March 2015 in the Algorithms research group of the Department of Computer Science at the University of Sheffield. It is led by Dr. Pietro S. Oliveto. Rigorous Research focuses on understanding how computers may imitate processes occurring successfully in nature to automatically solve complex computational problems.

→ About Rigorous Research

Activities

AAAI-18

The Thirty-Second AAAI Conference on Artificial Intelligence will be held February 2–7, 2018 in New Orleans, Lousiana, USA.

We will present the On the Time and Space Complexity of Genetic Programming for Evolving Boolean Conjunctions paper by A. Lissovoi and P.S. Oliveto.

ACM GECCO 2018

The Genetic and Evolutionary Computation Conference will be held July 15th-19th 2018 in Kyoto, Japan.

An introductory tutorial to the runtime analysis of evolutionary algorithms will be presented by Pietro S. Oliveto and Per Kristian Lehre on July 15th, 2018.

We welcome submissions to the ImAppNIO working group 3 (WG3) Black Box Discrete Optimization Benchmarking Workshop.
Submission deadline: 27 March 2018.

IEEE WCCI 2018

The IEEE Congress on Evolutionary Computation 2018 takes place July 8th to 13th in Rio de Janeiro, Brazil.

We encourage submissions of high-quality foundational papers to our CEC special session on the Theoretical Foundations of Bio-inspired Computation.

COST Action

ImAppNIO is a platform where theoreticians and practitioners can meet and exchange insights, ideas and needs. It aims to improve the applicability of all kinds of nature-inspired optimisation methods. To contribute to the COST action, join a working group.

We invite both practitioners and theoreticians to contribute to the set of benchmarks currently being set up by working group 3 (WG3) of the COST Action. To contribute, join WG3 by e-mailing Pietro S. Oliveto.

We welcome submissions to the working group 3 (WG3) Black Box Discrete Optimization Benchmarking Workshop held at ACM GECCO 2018.
Submission deadline: 27 March 2018.

IEEE Theory Task Force

If you would like to broaden your audience to non-theoreticians and practitioners, join the IEEE CIS task force on Theoretical Foundations of Bio-inspired Computation.

IEEE FOCI'17

IEEE Symposium on Foundations of Computational Intelligence took place at SSCI 2017 in Honolulu, Hawaii, USA, from November 27th to December 1st, 2017.

Frank Neumann presented the Parameterized Analysis of Bio-inspired Computing keynote on November 28th at FOCI.

The Gentle Introduction to the Time Complexity Analysis of Evolutionary Algorithms (slides PDF) tutorial was presented by Pietro S. Oliveto on November 27th.

ThRaSH 2015

The 9th Workshop on Theory of Randomized Search Heuristics was held in Sheffield in September 2015.

Upcoming events

AAAI-18
February 2–7, 2018.
GECCO'18
July 15th–19th, 2018.
PPSN'18
September 8th–18th, 2018.

Join Rigorous Research

PhD positions are currently available.

We provide the necessary support for postdoctoral Marie Curie Fellowship applications. Qualified individuals with appropriate research plans can send an email to Pietro Oliveto.

If you would like to visit us as a guest researcher, contact Pietro Oliveto.

Current Research Topics

News

15/12/2017 | GP Tutorial at PPSN A. Lissovoi and P.S. Oliveto will be giving a tutorial on runtime analysis of genetic programming algorithms at PPSN'18 in Coimbra, Portugal.
15/12/2017 | BB-DOB@PPSN The second Black-Box Discrete Optimization Benchmarking Workshop (BB-DOB) will take place at PPSN'18 in Coimbra, Portugal.
07/12/2017 | BB-DOB@GECCO The first Black-Box Discrete Optimization Benchmarking Workshop (BB-DOB) will take place at GECCO 2018 in Kyoto, Japan.
05/12/2017 | Runtime analysis tutorial at GECCO P.K. Lehre and P.S. Oliveto will be giving a tutorial on runtime analysis of evolutionary algorithms at GECCO'18 in Kyoto, Japan.
27/11/2017 | FOCI'17 Tutorial Slides Slides from the Gentle Introduction to the Time Complexity Analysis of Evolutionary Algorithms tutorial at FOCI'17 are now available.
09/11/2017 | AAAI-18 Paper Accepted A. Lissovoi, P. S. Oliveto.
On the Time and Space Complexity of Genetic Programming for Evolving Boolean Conjunctions [pdf]
11/08/2017 | Algorithmica Paper Accepted P. S. Oliveto, T. Paixão, J. Pérez Heredia, D. Sudholt, B. Trubenová.
How to Escape Local Optima in Black Box Optimisation: When Non-Elitism Outperforms Elitism. [pdf]
05/08/2017 | IEEE TEVC Paper Accepted D. Corus, P.S. Oliveto
Standard Steady State Genetic Algorithms Can Hillclimb Faster than Mutation-only Evolutionary Algorithms [pdf]

Follow us on Twitter