Sciweavers

1763 search results - page 4 / 353
» Dependent random choice
Sort
View
BIOINFORMATICS
2007
83views more  BIOINFORMATICS 2007»
13 years 9 months ago
Exploring biological network structure using exponential random graph models
Motivation: The functioning of biological networks depends in large part on their complex underlying structure. When studying their systemic nature many modeling approaches focus ...
Zachary M. Saul, Vladimir Filkov
CP
2007
Springer
14 years 3 months ago
Boosting Probabilistic Choice Operators
Probabilistic Choice Operators (PCOs) are convenient tools to model uncertainty in CP. They are useful to implement randomized algorithms and stochastic processes in the concurrent...
Matthieu Petit, Arnaud Gotlieb
UAI
2004
13 years 10 months ago
An Empirical Evaluation of Possible Variations of Lazy Propagation
As real-world Bayesian networks continue to grow larger and more complex, it is important to investigate the possibilities for improving the performance of existing algorithms of ...
Andres Madsen
BMCBI
2004
143views more  BMCBI 2004»
13 years 8 months ago
Comparing functional annotation analyses with Catmap
Background: Ranked gene lists from microarray experiments are usually analysed by assigning significance to predefined gene categories, e.g., based on functional annotations. Tool...
Thomas Breslin, Patrik Edén, Morten Krogh
GECCO
2004
Springer
14 years 2 months ago
On the Choice of the Population Size
Abstract. Evolutionary Algorithms (EAs) are population-based randomized optimizers often solving problems quite successfully. Here, the focus is on the possible effects of changin...
Tobias Storch