2109 search results - page 131 / 422 » Solving Necklace Constraint Problems |
185
click to vote
CONSTRAINTS
2008
15 years 6 months ago
2008
Submodular function minimization is a polynomially-solvable combinatorial problem. Unfortunately the best known general-purpose algorithms have high-order polynomial time complexi...
167
click to vote
INFOCOM
2005
IEEE
15 years 11 months ago
2005
IEEE
— We consider the problem of scheduling multiple users sharing a time-varying wireless channel. (As an example, this is a model of scheduling in 3G wireless technologies, such as...
144
click to vote
IJON
2008
15 years 6 months ago
2008
Nonnegative Matrix Factorization (NMF) solves the following problem: find such nonnegative matrices A RI
188
click to vote
AIPS
2003
15 years 7 months ago
2003
Despite a number of similarities, vehicle routing problems and scheduling problems are typically solved with different techniques. In this paper, we undertake a systematic study o...
190
click to vote
BMCBI
2004
15 years 5 months ago
2004
Background: The protein structure prediction problem is one of the most challenging problems in biological sciences. Many approaches have been proposed using database information ...