1421 search results - page 43 / 285 » Algorithms for subsequence combinatorics |
97
Voted
COCOON
2008
Springer
15 years 4 months ago
2008
Springer
A strong hyperbox-respecting coloring of an n-dimensional hyperbox partition is a coloring of the corners of its hyperboxes with 2n colors such that any hyperbox has all the colors...
113
Voted
COCOON
2008
Springer
15 years 4 months ago
2008
Springer
Given two sets of points in the plane, we are interested in locating a highway h such that an objective function on the city distance between points of the two sets is minimized (w...
117
Voted
COCOON
2008
Springer
15 years 4 months ago
2008
Springer
In this paper, we study the spectrum assignment problem for wireless access networks. Opportunistic spectrum usage is a promising technology. However, it could suffer from the self...
167
Voted
COCOON
2010
Springer
15 years 1 months ago
2010
Springer
The problem of sorting permutations by double-cut-and-joins (SBD) arises when we perform the double-cut-and-join (DCJ) operations on pairs of unichromosomal genomes without the gen...
129
Voted
TNN
1998
15 years 2 months ago
1998
— In this paper, we present a novel approach to partitioning pattern spaces using a multiobjective genetic algorithm for identifying (near-)optimal subspaces for hierarchical lea...