14165 search results - page 58 / 2833 » The generalized two-server problem |
131
click to vote
BICOB
2009
Springer
15 years 10 months ago
2009
Springer
Several applications require the joint display of two phylogenetic trees whose leaves are matched by inter-tree edges. This issue arises, for example, when comparing gene trees and...
114
click to vote
SAT
2004
Springer
15 years 9 months ago
2004
Springer
Kolaitis and Vardi pointed out that constraint satisfaction and conjunctive query containment are essentially the same problem. We study the Boolean conjunctive queries under a mor...
107
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
For the multi-peg Tower of Hanoi problem with k 4 pegs, so far the best solution is obtained by the Stewart's algorithm [15] based on the the following recurrence relation: ...
140
Voted
ALT
2004
Springer
16 years 14 days ago
2004
Springer
The decomposition method is currently one of the major methods for solving the convex quadratic optimization problems being associated with support vector machines. For a special c...
135
Voted
APPROX
2006
Springer
15 years 7 months ago
2006
Springer
A central problem in the algorithmic study of lattices is the closest vector problem: given a lattice v represented by some basis, and a target point y, nd the lattice point close...