We present an "adaptive multi-start" genetic algorithm for the Euclidean traveling salesman problem that uses a population of tours locally optimized by the Lin-Kernigha...
Dan Bonachea, Eugene Ingerman, Joshua Levy, Scott ...
Abstract. Many data mining approaches focus on the discovery of similar (and frequent) data values in large data sets. We present an alternative, but complementary approach in whic...
Jeff Edmonds, Jarek Gryz, Dongming Liang, Ren&eacu...
In most computer systems, page fault rate is currently minimized by generic page replacement algorithms which try to model the temporal locality inherent in programs. In this pape...
Karlton Sequeira, Mohammed Javeed Zaki, Boleslaw K...
Typically, sequence signatures, such as motifs and domains, are assumed to be localized in one region of a sequence or are derived as combinations of the former. We generalize the...
In this paper we tackle the task assignment problem (TSAP) in heterogeneous computer systems. The TSAP consists of assigning a given distributed computer program formed by a numbe...