Sciweavers

7106 search results - page 265 / 1422
» Restricted Complexity, General Complexity
Sort
View
SODA
1992
ACM
252views Algorithms» more  SODA 1992»
15 years 5 months ago
A General Approximation Technique for Constrained Forest Problems
We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph wit...
Michel X. Goemans, David P. Williamson
ENVSOFT
2008
78views more  ENVSOFT 2008»
15 years 4 months ago
A general water supply planning model: Evaluation of decentralized treatment
Increasing population, diminishing supplies and variable climatic conditions can cause difficulties in meeting water demands; especially in arid regions where water resources are ...
G. Chung, K. Lansey, P. Blowers, P. Brooks, W. Ela...
BMCBI
2005
87views more  BMCBI 2005»
15 years 4 months ago
Efficient decoding algorithms for generalized hidden Markov model gene finders
Background: The Generalized Hidden Markov Model (GHMM) has proven a useful framework for the task of computational gene prediction in eukaryotic genomes, due to its flexibility an...
William H. Majoros, Mihaela Pertea, Arthur L. Delc...
JCC
2002
127views more  JCC 2002»
15 years 4 months ago
Effective Born radii in the generalized Born approximation: The importance of being perfect
: Generalized Born (GB) models provide, for many applications, an accurate and computationally facile estimate of the electrostatic contribution to aqueous solvation. The GB models...
Alexey Onufriev, David A. Case, Donald Bashford
ICTAI
2009
IEEE
15 years 2 months ago
A Generalized Cyclic-Clustering Approach for Solving Structured CSPs
We propose a new method for solving structured CSPs which generalizes and improves the Cyclic-Clustering approach [4]. First, the cutset and the tree-decomposition of the constrai...
Cédric Pinto, Cyril Terrioux