Composing problem solvers for simulation experimentation: a case study on steady state estimation.
Ontology highlight
ABSTRACT: Simulation experiments involve various sub-tasks, e.g., parameter optimization, simulation execution, or output data analysis. Many algorithms can be applied to such tasks, but their performance depends on the given problem. Steady state estimation in systems biology is a typical example for this: several estimators have been proposed, each with its own (dis-)advantages. Experimenters, therefore, must choose from the available options, even though they may not be aware of the consequences. To support those users, we propose a general scheme to aggregate such algorithms to so-called synthetic problem solvers, which exploit algorithm differences to improve overall performance. Our approach subsumes various aggregation mechanisms, supports automatic configuration from training data (e.g., via
SUBMITTER: Leye S
PROVIDER: S-EPMC3976265 | biostudies-literature | 2014
REPOSITORIES: biostudies-literature
ACCESS DATA