6266 search results - page 1242 / 1254 » New results on the computability and complexity of points - ... |
EOR
2008
13 years 7 months ago
2008
We consider the separable nonlinear and strictly convex single-commodity network flow problem (SSCNFP). We develop a computational scheme for generating a primal feasible solution...
JUCS
2008
13 years 7 months ago
2008
Abstract: Collaborative learning systems can be constructed following the serviceoriented computing paradigm. This allows educators to integrate external tools, offered as services...
BMCBI
2004
13 years 7 months ago
2004
Background: The general problem of RNA secondary structure prediction under the widely used thermodynamic model is known to be NP-complete when the structures considered include a...
BMCBI
2002
13 years 7 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...
LATIN
2010
Springer
13 years 6 months ago
2010
Springer
A predicate P : {−1, 1}k → {0, 1} can be associated with a constraint satisfaction problem Max CSP(P). P is called “approximation resistant” if Max CSP(P) cannot be approxi...