Sciweavers

1686 search results - page 76 / 338
» Programs as polygraphs: computability and complexity
Sort
View
BMCBI
2010
175views more  BMCBI 2010»
14 years 10 months ago
Towards high performance computing for molecular structure prediction using IBM Cell Broadband Engine - an implementation perspe
Background: RNA structure prediction problem is a computationally complex task, especially with pseudo-knots. The problem is well-studied in existing literature and predominantly ...
S. P. T. Krishnan, Sim Sze Liang, Bharadwaj Veerav...
ICCS
2005
Springer
15 years 3 months ago
Evolutionary Discovery of Arbitrary Self-replicating Structures
In this paper we describe our recent use of genetic programming methods to automatically discover CA rule sets that produce self-replication of arbitrary given structures. Our init...
Zhijian Pan, James A. Reggia
BMCBI
2007
161views more  BMCBI 2007»
14 years 10 months ago
Efficient classification of complete parameter regions based on semidefinite programming
Background: Current approaches to parameter estimation are often inappropriate or inconvenient for the modelling of complex biological systems. For systems described by nonlinear ...
Lars Kuepfer, Uwe Sauer, Pablo A. Parrilo
JMLR
2008
127views more  JMLR 2008»
14 years 9 months ago
Incremental Identification of Qualitative Models of Biological Systems using Inductive Logic Programming
The use of computational models is increasingly expected to play an important role in predicting the behaviour of biological systems. Models are being sought at different scales o...
Ashwin Srinivasan, Ross D. King
LICS
2008
IEEE
15 years 4 months ago
Reachability Games and Game Semantics: Comparing Nondeterministic Programs
We investigate the notions of may- and mustapproximation in Erratic Idealized Algol (a nondeterministic extension of Idealized Algol), and give explicit characterizations of both ...
Andrzej S. Murawski