Sciweavers

1383 search results - page 63 / 277
» On the Complexity of the Interlace Polynomial
Sort
View
BIOCOMP
2007
15 years 7 months ago
Prediction of trans-antisense Transcripts in Arabidopsis thaliana
Background: Natural antisense transcripts (NATs) are coding or non-coding RNAs with sequence complementarity to other transcripts (sense transcripts). These RNAs could potentially...
Huan Wang, Nam-Hai Chua, Xiu-Jie Wang
CEC
2009
IEEE
16 years 28 days ago
Rigorous time complexity analysis of Univariate Marginal Distribution Algorithm with margins
—Univariate Marginal Distribution Algorithms (UMDAs) are a kind of Estimation of Distribution Algorithms (EDAs) which do not consider the dependencies among the variables. In thi...
Tianshi Chen, Ke Tang, Guoliang Chen, Xin Yao
FOCS
2006
IEEE
16 years 7 days ago
On the time complexity of 2-tag systems and small universal Turing machines
We show that 2-tag systems efficiently simulate Turing machines. As a corollary we find that the small universal Turing machines of Rogozhin, Minsky and others simulate Turing ma...
Damien Woods, Turlough Neary
CEC
2005
IEEE
15 years 11 months ago
On the complexity of overcoming gaps with isotropic mutations and elitist selection
We consider the (1+λ) evolution strategy, an evolutionary algorithm for minimization in Rn , using isotropic mutations. Thus, for instance, Gaussian mutations adapted by the 1/5-r...
Jens Jägersküpper
MOR
2008
83views more  MOR 2008»
15 years 6 months ago
Extensive-Form Correlated Equilibrium: Definition and Computational Complexity
Abstract: This paper defines the extensive form correlated equilibrium (EFCE) for extensive games with perfect recall. The EFCE concept extends Aumann's strategic-form correla...
Bernhard von Stengel, Françoise Forges