16596 search results - page 184 / 3320 » Generalized Assignment Problems |
121
click to vote
BICOB
2009
Springer
15 years 9 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...
108
click to vote
SAT
2004
Springer
15 years 7 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...
130
Voted
PODS
2008
ACM
16 years 2 months ago
2008
ACM
There is an increasing quantity of data with uncertainty arising from applications such as sensor network measurements, record linkage, and as output of mining algorithms. This un...
CORR
2010
Springer
15 years 2 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: ...
130
Voted
ALT
2004
Springer
15 years 11 months 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...