Sciweavers

2192 search results - page 53 / 439
» Algorithms for Challenging Motif Problems
Sort
View
BMCBI
2007
216views more  BMCBI 2007»
13 years 8 months ago
A replica exchange Monte Carlo algorithm for protein folding in the HP model
Background: The ab initio protein folding problem consists of predicting protein tertiary structure from a given amino acid sequence by minimizing an energy function; it is one of...
Chris Thachuk, Alena Shmygelska, Holger H. Hoos
ISAAC
2000
Springer
135views Algorithms» more  ISAAC 2000»
13 years 11 months ago
On Approximating Minimum Vertex Cover for Graphs with Perfect Matching
It has been a challenging open problem whether there is a polynomial time approximation algorithm for the Vertex Cover problem whose approximation ratio is bounded by a constant l...
Jianer Chen, Iyad A. Kanj
SIAMCOMP
2008
108views more  SIAMCOMP 2008»
13 years 8 months ago
A Primal-Dual Bicriteria Distributed Algorithm for Capacitated Vertex Cover
In this paper we consider the capacitated vertex cover problem which is the variant of vertex cover where each node is allowed to cover a limited number of edges. We present an ef...
Fabrizio Grandoni, Jochen Könemann, Alessandr...
WADS
2009
Springer
298views Algorithms» more  WADS 2009»
14 years 2 months ago
A Comparison of Performance Measures for Online Algorithms
This paper provides a systematic study of several proposed measures for online algorithms in the context of a specific problem, namely, the two server problem on three colinear po...
Joan Boyar, Sandy Irani, Kim S. Larsen
ISDA
2005
IEEE
14 years 1 months ago
Hybrid Fuzzy-Genetic Algorithm Approach for Crew Grouping
Crew grouping is an important problem and formulating a good solution always involves many challenges. For example, grouping soldiers intelligently to tank combat units, we should...
Hongbo Liu, Zhanguo Xu, Ajith Abraham