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.
The Gentle Introduction to the Time Complexity Analysis of Evolutionary Algorithms tutorial will be presented by Pietro S. Oliveto.
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 are organising the ImAppNIO working group 3 (WG3) Black Box Discrete Optimization Benchmarking Workshop at GECCO.
A tutorial on the computational complexity analysis of genetic programming will be presented by Pietro S. Oliveto and Andrei Lissovoi.
We are organising the ImAppNIO working group 3 (WG3) Black Box Discrete Optimization Benchmarking Workshop at PPSN.
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 presented the On the Time and Space Complexity of Genetic Programming for Evolving Boolean Conjunctions paper by A. Lissovoi and P.S. Oliveto.
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.
Join Rigorous ResearchPhD 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
On the Time and Space Complexity of Genetic Programming for Evolving Boolean Conjunctions [pdf]
How to Escape Local Optima in Black Box Optimisation: When Non-Elitism Outperforms Elitism. [pdf]
Standard Steady State Genetic Algorithms Can Hillclimb Faster than Mutation-only Evolutionary Algorithms [pdf]