Sciweavers

4670 search results - page 71 / 934
» Testing that distributions are close
Sort
View
CEC
2009
IEEE
15 years 4 months ago
Rigorous time complexity analysis of Univariate Marginal Distribution Algorithm with margins
—Univariate Marginal Distribution Algorithms (UMDAs) are a kind of Estimation of Distribution Algorithms (EDAs) which do not consider the dependencies among the variables. In thi...
Tianshi Chen, Ke Tang, Guoliang Chen, Xin Yao
ISSRE
2003
IEEE
15 years 3 months ago
Using a Log-normal Failure Rate Distribution for Worst Case Bound Reliability Prediction
Prior research has suggested that the failure rates of faults follow a log normal distribution. We propose a specific model where distributions close to a log normal arise natural...
Peter G. Bishop, Robin E. Bloomfield
93
Voted
COMBINATORICS
2002
76views more  COMBINATORICS 2002»
14 years 10 months ago
On the Number of Distributive Lattices
We investigate the numbers dk of all (isomorphism classes of) distributive lattices with k elements, or, equivalently, of (unlabeled) posets with k antichains. Closely related and...
Marcel Erné, Jobst Heitzig, Jürgen Rei...
DIS
2008
Springer
14 years 12 months ago
Unsupervised Classifier Selection Based on Two-Sample Test
We propose a well-founded method of ranking a pool of m trained classifiers by their suitability for the current input of n instances. It can be used when dynamically selecting a s...
Timo Aho, Tapio Elomaa, Jussi Kujala
BIOINFORMATICS
2008
172views more  BIOINFORMATICS 2008»
14 years 10 months ago
Fitting a geometric graph to a protein-protein interaction network
Motivation: Finding a good network null model for protein-protein interaction (PPI) networks is a fundamental issue. Such a model would provide insights into the interplay between...
Desmond J. Higham, Marija Rasajski, Natasa Przulj