Sciweavers

895 search results - page 171 / 179
» An Indirect Genetic Algorithm for Set Covering Problems
Sort
View
ANOR
2005
160views more  ANOR 2005»
13 years 7 months ago
Packing r-Cliques in Weighted Chordal Graphs
In Hell et al. (2004), we have previously observed that, in a chordal graph G, the maximum number of independent r-cliques (i.e., of vertex disjoint subgraphs of G, each isomorphic...
Pavol Hell, Sulamita Klein, Loana Tito Nogueira, F...
EOR
2006
135views more  EOR 2006»
13 years 7 months ago
Principles of scatter search
Scatter search is an evolutionary method that has been successfully applied to hard optimization problems. The fundamental concepts and principles of the method were first propose...
Rafael Martí, Manuel Laguna, Fred Glover
SAT
2009
Springer
117views Hardware» more  SAT 2009»
14 years 1 months ago
Dynamic Symmetry Breaking by Simulating Zykov Contraction
Abstract. We present a new method to break symmetry in graph coloring problems. While most alternative techniques add symmetry breaking predicates in a pre-processing step, we deve...
Bas Schaafsma, Marijn Heule, Hans van Maaren
ASIAN
2004
Springer
153views Algorithms» more  ASIAN 2004»
13 years 11 months ago
Chi-Square Matrix: An Approach for Building-Block Identification
This paper presents a line of research in genetic algorithms (GAs), called building-block identification. The building blocks (BBs) are common structures inferred from a set of sol...
Chatchawit Aporntewan, Prabhas Chongstitvatana
ISBI
2008
IEEE
14 years 8 months ago
Chromosome pairing for karyotyping purposes using mutual information
Cytogenetics is the preferred tool in the diagnosis of genetic diseases such as leukemia and detection of aquired chromosomal abnormalities, such as translocations, deletions, mon...
Artem Khmelinskii, João Sanches, Rodrigo Ve...