519 search results - page 56 / 104 » A New Approach to Strongly Polynomial Linear Programming |
152
click to vote
BMCBI
2002
15 years 1 months ago
2002
Background: Covariance models (CMs) are probabilistic models of RNA secondary structure, analogous to profile hidden Markov models of linear sequence. The dynamic programming algo...
114
click to vote
CORR
2008
Springer
15 years 1 months ago
2008
Springer
Abstract-- The calculation of network reliability in a probabilistic context has long been an issue of practical and academic importance. Conventional approaches (determination of ...
218
click to vote
POPL
2007
ACM
16 years 1 months ago
2007
ACM
Reuse distance (i.e. LRU stack distance) precisely characterizes program locality and has been a basic tool for memory system research since the 1970s. However, the high cost of m...
DAM
2008
15 years 1 months ago
2008
We investigate the Semidefinite Programming based Sums of squares (SOS) decomposition method, designed for global optimization of polynomials, in the context of the (Maximum) Sati...
128
click to vote
ORL
2006
15 years 1 months ago
2006
The strategic safety stock placement problem is a constrained separable concave minimization problem and so is solvable, in principle, as a sequence of mixed-integer programming p...