Sciweavers

815 search results - page 33 / 163
» Complexity classes for membrane systems
Sort
View
COR
2008
122views more  COR 2008»
13 years 8 months ago
First steps to the runtime complexity analysis of ant colony optimization
: The paper presents results on the runtime complexity of two ant colony optimization (ACO) algorithms: Ant System, the oldest ACO variant, and GBAS, the first ACO variant for whic...
Walter J. Gutjahr
FOCS
2007
IEEE
14 years 3 months ago
Parameterized Proof Complexity
We propose a proof-theoretic approach for gaining evidence that certain parameterized problems are not fixedparameter tractable. We consider proofs that witness that a given prop...
Stefan S. Dantchev, Barnaby Martin, Stefan Szeider
JCC
2006
110views more  JCC 2006»
13 years 8 months ago
Using internal and collective variables in Monte Carlo simulations of nucleic acid structures: Chain breakage/closure algorithm
: This article describes a method for solving the geometric closure problem for simplified models of nucleic acid structures by using the constant bond lengths approximation. The r...
Heinz Sklenar, Daniel Wüstner, Remo Rohs
BMCBI
2008
110views more  BMCBI 2008»
13 years 8 months ago
Finding microRNA regulatory modules in human genome using rule induction
Background: MicroRNAs (miRNAs) are a class of small non-coding RNA molecules (20
Dang Hung Tran, Kenji Satou, Tu Bao Ho
COCO
2009
Springer
117views Algorithms» more  COCO 2009»
14 years 3 months ago
The Proof Complexity of Polynomial Identities
Devising an efficient deterministic – or even a nondeterministic sub-exponential time – algorithm for testing polynomial identities is a fundamental problem in algebraic comp...
Pavel Hrubes, Iddo Tzameret