Sciweavers

952 search results - page 14 / 191
» Computational complexity of stochastic programming problems
Sort
View
CMSB
2004
Springer
14 years 4 months ago
Modelling Metabolic Pathways Using Stochastic Logic Programs-Based Ensemble Methods
In this paper we present a methodology to estimate rates of enzymatic reactions in metabolic pathways. Our methodology is based on applying stochastic logic learning in ensemble le...
Huma Lodhi, Stephen Muggleton
ISAAC
2010
Springer
253views Algorithms» more  ISAAC 2010»
13 years 8 months ago
Solving Two-Stage Stochastic Steiner Tree Problems by Two-Stage Branch-and-Cut
Abstract. We consider the Steiner tree problem under a 2-stage stochastic model with recourse and finitely many scenarios (SSTP). Thereby, edges are purchased in the first stage wh...
Immanuel M. Bomze, Markus Chimani, Michael Jü...
BMCBI
2011
13 years 5 months ago
Multithreaded comparative RNA secondary structure prediction using stochastic context-free grammars
Background: The prediction of the structure of large RNAs remains a particular challenge in bioinformatics, due to the computational complexity and low levels of accuracy of state...
Zsuzsanna Sukosd, Bjarne Knudsen, Morten Vaerum, J...
ECAL
2007
Springer
14 years 5 months ago
Turing Complete Catalytic Particle Computers
The Bare Bones language is a programming language with a minimal set of operations that exhibits universal computation. We present a conceptual framework, Chemical Bare Bones, to c...
Anthony M. L. Liekens, Chrisantha Thomas Fernando
IOR
2010
86views more  IOR 2010»
13 years 9 months ago
Disjunctive Decomposition for Two-Stage Stochastic Mixed-Binary Programs with Random Recourse
This paper introduces disjunctive decomposition for two-stage mixed 0-1 stochastic integer programs (SIPs) with random recourse. Disjunctive decomposition allows for cutting plane...
Lewis Ntaimo