Sciweavers

2434 search results - page 289 / 487
» Algorithmic Randomness of Closed Sets
Sort
View
CEC
2007
IEEE
16 years 22 days ago
Parameter calibration using meta-algorithms
— 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...
W. A. de Landgraaf, A. E. Eiben, Volker Nannen
ICA
2007
Springer
15 years 10 months ago
Compact Representations of Market Securities Using Smooth Component Extraction
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...
Hariton Korizis, Nikolaos Mitianoudis, Anthony G. ...
UAI
2003
15 years 7 months ago
An Empirical Study of w-Cutset Sampling for Bayesian Networks
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 ...
Bozhena Bidyuk, Rina Dechter
CIBCB
2009
IEEE
15 years 7 months ago
rnaDesign: Local search for RNA secondary structure design
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 ...
Denny C. Dai, Herbert H. Tsang, Kay C. Wiese
PVLDB
2010
84views more  PVLDB 2010»
15 years 4 months ago
Processing Top-k Join Queries
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...
Minji Wu, Laure Berti-Equille, Amélie Maria...