Sciweavers

1158 search results - page 183 / 232
» Software is discrete mathematics
Sort
View
COMPUTING
2008
174views more  COMPUTING 2008»
13 years 9 months ago
Multilevel algorithms for Rannacher-Turek finite element approximation of 3D elliptic problems
Generalizing the approach of a previous work [15] the authors present multilevel preconditioners for three-dimensional (3D) elliptic problems discretized by a family of Rannacher ...
Ivan Georgiev, Johannes Kraus, Svetozar Margenov
CORR
2010
Springer
135views Education» more  CORR 2010»
13 years 9 months ago
Information Distance
While Kolmogorov complexity is the accepted absolute measure of information content in an individual finite object, a similarly absolute notion is needed for the information distan...
Charles H. Bennett, Péter Gács, Ming...
COR
2008
122views more  COR 2008»
13 years 9 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
BMCBI
2007
172views more  BMCBI 2007»
13 years 9 months ago
Bayesian approaches to reverse engineer cellular systems: a simulation study on nonlinear Gaussian networks
Background: Reverse engineering cellular networks is currently one of the most challenging problems in systems biology. Dynamic Bayesian networks (DBNs) seem to be particularly su...
Fulvia Ferrazzi, Paola Sebastiani, Marco Ramoni, R...
BIOINFORMATICS
2005
152views more  BIOINFORMATICS 2005»
13 years 9 months ago
Intervention in context-sensitive probabilistic Boolean networks
Motivation: Intervention in a gene regulatory network is used to help it avoid undesirable states, such as those associated with a disease. Several types of intervention have been...
Ranadip Pal, Aniruddha Datta, Michael L. Bittner, ...