1964 search results - page 91 / 393 » Partitioning Based Algorithms for Some Colouring Problems |
WEA
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. The maximum diversity problem (MDP) consists of identifying optimally diverse subsets of elements from some larger collection. The selection of elements is based on the d...
ICDE
2012
IEEE
11 years 10 months ago
2012
IEEE
—Sequence analysis is very important in our daily life. Typically, each sequence is associated with an ordered list of elements. For example, in a movie rental application, a cus...
IJAIT
2010
13 years 6 months ago
2010
Many real world industrial applications involve finding a Hamiltonian path with minimum cost. Some instances that belong to this category are transportation routing problem, scan c...
FSTTCS
2004
Springer
14 years 1 months ago
2004
Springer
The Genome Halving Problem is motivated by the whole genome duplication events in molecular evolution that double the gene content of a genome and result in a perfect duplicated ge...
ANTSW
2006
Springer
13 years 11 months ago
2006
Springer
There are two reasons for parallelizing a metaheuristic if one is interested in performance: (i) given a fixed time to search, the aim is to increase the quality of the solutions f...