An important challenge within hyper-heuristic research is to design search methodologies that work well, not only across different instances of the same problem, but also across di...
Edmund K. Burke, Timothy Curtois, Matthew R. Hyde,...
We describe a procedure which finds a hierarchical clustering by hillclimbing. The cost function we use is a hierarchical extension of the -means cost; our local moves are tree...
— We present a distributed scheduling algorithm for provisioning of guaranteed link bandwidths in ad hoc mesh networks. The guaranteed link bandwidths are necessary to provide de...
In this paper, we propose new pipelined request-grant-accept (RGA) and request-grant (RG) maximal size matching (MSM) algorithms to achieve speedup in combined input and output qu...
This paper presents an algorithm, called JustIn-Case Scheduling, for building robust schedules that tend not to break. The algorithm implements the common sense idea of being prep...