Sciweavers

14518 search results - page 183 / 2904
» Two Problems for Sophistication
Sort
View
EVOW
2004
Springer
14 years 4 months ago
Binary Merge Model Representation of the Graph Colouring Problem
This paper describes a novel representation and ordering model that, aided by an evolutionary algorithm, is used in solving the graph k-colouring problem. Its strength lies in redu...
István Juhos, Attila Tóth, Jano I. v...
EVOW
2003
Springer
14 years 4 months ago
A Genetic Algorithm for the Index Selection Problem
This paper considers the problem of minimizing the response time for a given database workload by a proper choice of indexes. This problem is NP-hard and known in the literature as...
Jozef Kratica, Ivana Ljubic, Dusan Tosic
ESA
2001
Springer
145views Algorithms» more  ESA 2001»
14 years 3 months ago
Grouping Techniques for Scheduling Problems: Simpler and Faster
In this paper we describe a general grouping technique to devise faster and simpler approximation schemes for several scheduling problems. We illustrate the technique on two diff...
Aleksei V. Fishkin, Klaus Jansen, Monaldo Mastroli...
GECCO
2010
Springer
168views Optimization» more  GECCO 2010»
14 years 2 months ago
Elementary landscapes of frequency assignment problems
We analyze various forms of the Frequency Assignment Problem using the theory of elementary landscapes. We show that three variants of the Frequency Assignment Problem are either ...
L. Darrell Whitley, J. Francisco Chicano, Enrique ...
CSC
2008
14 years 6 days ago
Multilevel Approaches applied to the Capacitated Clustering Problem
- This paper presents two multilevel refinement algorithms for the capacitated clustering problem. Multilevel refinement is a collaborative technique capable of significantly aidin...
Demane Rodney, Alan Soper, Chris Walshaw