2434 search results - page 289 / 487 » Algorithmic Randomness of Closed Sets |
134
click to vote
CEC
2007
IEEE
15 years 10 months ago
2007
IEEE
— Calibrating an evolutionary algorithm (EA) means finding the right values of algorithm parameters for a given problem. This issue is highly relevant, because it has a high imp...
139
click to vote
ICA
2007
Springer
15 years 7 months ago
2007
Springer
Independent Component Analysis (ICA) is a statistical method for expressing an observed set of random vectors as a linear combination of statistically independent components. This...
122
click to vote
UAI
2003
15 years 5 months ago
2003
The paper studies empirically the time-space trade-off between sampling and inference in the cutset sampling algorithm. The algorithm samples over a subset of nodes in a Bayesian ...
145
click to vote
CIBCB
2009
IEEE
15 years 5 months ago
2009
IEEE
Abstract-- The RNA secondary structure design (SSD) problem is a recently emerging research topic motivated by applications such as customized drug design and the self-assembly of ...
123
click to vote
PVLDB
2010
15 years 2 months ago
2010
We consider the problem of efficiently finding the top-k answers for join queries over web-accessible databases. Classical algorithms for finding top-k answers use branch-and-b...