John H. Drake
YOU?
Author Swipe
View article: An investigation of F-Race training strategies for cross domain optimisation with memetic algorithms
An investigation of F-Race training strategies for cross domain optimisation with memetic algorithms Open
View article: Natural SQL: Making SQL Easier to Infer from Natural Language Specifications
Natural SQL: Making SQL Easier to Infer from Natural Language Specifications Open
Addressing the mismatch between natural language descriptions and the corresponding SQL queries is a key challenge for text-to-SQL translation. To bridge this gap, we propose an SQL intermediate representation (IR) called Natural SQL (NatS…
View article: Natural SQL: Making SQL Easier to Infer from Natural Language Specifications
Natural SQL: Making SQL Easier to Infer from Natural Language Specifications Open
Addressing the mismatch between natural language descriptions and the corresponding SQL queries is a key challenge for text-to-SQL translation. To bridge this gap, we propose an SQL intermediate representation (IR) called Natural SQL (NatS…
View article: A multimodal particle swarm optimization-based approach for image segmentation
A multimodal particle swarm optimization-based approach for image segmentation Open
View article: Recent advances in selection hyper-heuristics
Recent advances in selection hyper-heuristics Open
Hyper-heuristics have emerged as a way to raise the level of generality of search techniques for computational search problems. This is in contrast to many approaches, which represent customised methods for a single problem domain or a nar…
View article: Effective reinforcement learning based local search for the maximum k-plex problem
Effective reinforcement learning based local search for the maximum k-plex problem Open
The maximum k-plex problem is a computationally complex problem, which emerged from graph-theoretic social network studies. This paper presents an effective hybrid local search for solving the maximum k-plex problem that combines the recen…
View article: Counterexample-Driven Genetic Programming: Stochastic Synthesis of Provably Correct Programs
Counterexample-Driven Genetic Programming: Stochastic Synthesis of Provably Correct Programs Open
Genetic programming is an effective technique for inductive synthesis of programs from tests, i.e. training examples of desired input-output behavior. Programs synthesized in this way are not guaranteed to generalize beyond the training se…
View article: Impact of the 340B Pharmacy Program on Services and Supports for Persons Served by Hemophilia Treatment Centers in the United States
Impact of the 340B Pharmacy Program on Services and Supports for Persons Served by Hemophilia Treatment Centers in the United States Open
View article: A hyper-heuristic approach to automated generation of mutation operators for evolutionary programming
A hyper-heuristic approach to automated generation of mutation operators for evolutionary programming Open
View article: A choice function hyper-heuristic framework for the allocation of maintenance tasks in Danish railways
A choice function hyper-heuristic framework for the allocation of maintenance tasks in Danish railways Open
A new signalling system in Denmark aims at ensuring fast and reliable train operations, however imposes very strict time limits on recovery plans in the event of failure. As a result, it is necessary to develop a new approach to the entire…
View article: A hybrid Constraint Programming/Mixed Integer Programming framework for the preventive signaling maintenance crew scheduling problem
A hybrid Constraint Programming/Mixed Integer Programming framework for the preventive signaling maintenance crew scheduling problem Open
This research has been carried out as part of the PhD research project funded by Technical University of Denmark and Banedanmark company which is responsible for the operation and maintenance of the Danish railway network. This work has be…
View article: Sparse, Continuous Policy Representations for Uniform Online Bin Packing via Regression of Interpolants
Sparse, Continuous Policy Representations for Uniform Online Bin Packing via Regression of Interpolants Open
View article: A self-adaptive Multimeme Memetic Algorithm co-evolving utility scores to control genetic operators and their parameter settings
A self-adaptive Multimeme Memetic Algorithm co-evolving utility scores to control genetic operators and their parameter settings Open
View article: Automatically Designing More General Mutation Operators of Evolutionary Programming for Groups of Function Classes Using a Hyper-Heuristic
Automatically Designing More General Mutation Operators of Evolutionary Programming for Groups of Function Classes Using a Hyper-Heuristic Open
In this study we use Genetic Programming (GP) as an offline hyper-heuristic to evolve a mutation operator for Evolutionary Programming. This is done using the Gaussian and uniform distributions as the terminal set, and arithmetic operators…
View article: A modified choice function hyper-heuristic controlling unary and binary operators
A modified choice function hyper-heuristic controlling unary and binary operators Open
Hyper-heuristics are a class of high-level search methodologies which operate on a search space of low-level heuristics or components, rather than on solutions directly. Traditional iterative selection hyper-heuristics rely on two key comp…
View article: A comparison of crossover control mechanisms within single-point selection hyper-heuristics using HyFlex
A comparison of crossover control mechanisms within single-point selection hyper-heuristics using HyFlex Open
Hyper-heuristics are search methodologies which operate at a higher level of abstraction than traditional search and optimisation techniques. Rather than operating on a search space of solutions directly, a hyper-heuristic searches a space…
View article: Comments on: An overview of curriculum-based course timetabling
Comments on: An overview of curriculum-based course timetabling Open
View article: A Case Study of Controlling Crossover in a Selection Hyper-heuristic Framework Using the Multidimensional Knapsack Problem
A Case Study of Controlling Crossover in a Selection Hyper-heuristic Framework Using the Multidimensional Knapsack Problem Open
Hyper-heuristics are high-level methodologies for solving complex problems that operate on a search space of heuristics. In a selection hyper-heuristic framework, a heuristic is chosen from an existing set of low-level heuristics and appli…