| Metaheuristics "In the Large" | 0 | 0.34 | 2022 |
| Stochastic synthesis of recursive functions made easy with bananas, lenses, envelopes and barbed wire | 0 | 0.34 | 2019 |
| A hybrid metaheuristic approach to a real world employee scheduling problem | 0 | 0.34 | 2019 |
| Quantum Program Synthesis - Swarm Algorithms and Benchmarks. | 1 | 0.41 | 2019 |
| Solving the Multi-objective Flexible Job-Shop Scheduling Problem with Alternative Recipes for a Chemical Production Process. | 0 | 0.34 | 2019 |
| Implementing Digital Twins Of Smart Factories With Interval Algebra | 0 | 0.34 | 2019 |
| Extending the 'Open-Closed Principle' to Automated Algorithm Configuration. | 0 | 0.34 | 2019 |
| Counterexample-Driven Genetic Programming: Stochastic Synthesis of Provably Correct Programs. | 1 | 0.37 | 2018 |
| The Text-Based Adventure AI Competition. | 3 | 0.43 | 2018 |
| Subtype polymorphism à la carte via machine learning on dependent types. | 0 | 0.34 | 2018 |
| Counterexample-Driven Genetic Programming: Heuristic Program Synthesis from Formal Specifications. | 0 | 0.34 | 2018 |
| Value-based manufacturing optimisation in serverless clouds for industry 4.0. | 1 | 0.36 | 2018 |
| Deep Parameter Tuning of Concurrent Divide and Conquer Algorithms in Akka. | 0 | 0.34 | 2017 |
| Polytypic Genetic Programming. | 0 | 0.34 | 2017 |
| Search-Based Energy Optimization of Some Ubiquitous Algorithms. | 0 | 0.34 | 2017 |
| Dependency Injection for Programming by Optimization. | 0 | 0.34 | 2017 |
| Sparse, Continuous Policy Representations for Uniform Online Bin Packing via Regression of Interpolants. | 1 | 0.35 | 2017 |
| Counterexample-driven genetic programming. | 0 | 0.34 | 2017 |
| Discovering Relational Structure in Program Synthesis Problems with Analogical Reasoning. | 0 | 0.34 | 2016 |
| Iterated local search using an add and delete hyper-heuristic for university course timetabling | 6 | 0.41 | 2016 |
| Distance Metric Ensemble Learning and the Andrews-Curtis Conjecture. | 0 | 0.34 | 2016 |
| Iterative Cartesian Genetic Programming: Creating General Algorithms for Solving Travelling Salesman Problems. | 1 | 0.34 | 2016 |
| Metaheuristic Design Pattern: Surrogate Fitness Functions | 4 | 0.43 | 2015 |
| The 'Blackboard Pattern' for Metaheuristics | 1 | 0.38 | 2015 |
| Hyperion2: a toolkit for {meta-, hyper-} heuristic research | 0 | 0.34 | 2014 |
| The executable experimental template pattern for the systematic comparison of metaheuristics: Extended Abstract | 0 | 0.34 | 2014 |
| Benchmarks that matter for genetic programming | 2 | 0.52 | 2014 |
| The 'composite' design pattern in metaheuristics | 4 | 0.41 | 2014 |
| Template method hyper-heuristics | 8 | 0.50 | 2014 |
| Contrasting meta-learning and hyper-heuristic research: the role of evolutionary algorithms | 43 | 1.03 | 2014 |
| Searching the Hyper-heuristic Design Space. | 18 | 0.76 | 2014 |
| Effective learning hyper-heuristics for the course timetabling problem. | 24 | 0.77 | 2014 |
| Guiding Evolutionary Learning by Searching for Regularities in Behavioral Trajectories: A Case for Representation Agnosticism | 2 | 0.37 | 2013 |
| Pattern-guided genetic programming | 16 | 0.86 | 2013 |
| The automatic generation of mutation operators for genetic algorithms | 17 | 0.84 | 2012 |
| A Comparison of Acceptance Criteria for the Daily Car-Pooling Problem. | 2 | 0.38 | 2012 |
| Fitness Landscapes And The Andrews-Curtis Conjecture | 4 | 0.82 | 2012 |
| HYPERION: a recursive hyper-heuristic framework | 16 | 0.70 | 2011 |
| Efficiency issues in the kbmag procedure | 0 | 0.34 | 2011 |
| A Syntactic Approach to Prediction. | 1 | 0.34 | 2011 |
| Automatically designing selection heuristics | 13 | 0.91 | 2011 |
| Automated Schematization for Web Service Applications | 7 | 0.70 | 2007 |
