Graphplan and heuristic state space planners such as HSP-R and UNPOP are currently two of the most effective approaches for solving classical planning problems. These approaches h...
A hyperheuristic is a high level procedure which searches over a space of low level heuristics rather than directly over the space of problem solutions. The sequence of low level h...
Abstract. In this paper we develop a localized value-ordering heuristic for distributed resource allocation problems. We show how this value ordering heuristics can be used to achi...
The quadratic multiple knapsack problem extends the quadratic knapsack problem with K knapsacks, each with its own capacity Ck. A greedy heuristic fills the knapsacks one at a tim...
Background: The study of genome rearrangements has become a mainstay of phylogenetics and comparative genomics. Fundamental in such a study is the median problem: given three geno...
Vaibhav Rajan, Andrew Wei Xu, Yu Lin, Krister M. S...