4047 search results - page 140 / 810 » The Discrete Basis Problem |
101
Voted
DCC
2002
IEEE
16 years 10 days ago
2002
IEEE
We show that the problem of optimal bit allocation among a set of independent discrete quantizers given a budget constraint is equivalent to the multiple choice knapsack problem (...
111
click to vote
COCOA
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. We present a branch-and-bound (bb) algorithm for the multiple sequence alignment problem (MSA), one of the most important problems in computational biology. The upper bou...
110
Voted
COCOA
2007
Springer
15 years 7 months ago
2007
Springer
The Two-Sided Crossing Minimization (TSCM) problem calls for minimizing the number of edge crossings of a bipartite graph where the two sets of vertices are drawn on two parallel l...
106
Voted
CCCG
2008
15 years 2 months ago
2008
In this paper we showed that a p( 2)-center location problem in general networks can be transformed to the well known Klee's measure problem [5]. This resulted in an improved...
99
Voted
ESWA
2010
14 years 11 months ago
2010
Most previous research into the job-shop scheduling problem has concentrated on finding a single optimal solution (e.g., makespan), even though the actual requirement of most prod...