2434 search results - page 284 / 487 » Algorithmic Randomness of Closed Sets |
143
click to vote
GECCO
2008
Springer
15 years 5 months ago
2008
Springer
Deceptive problems have always been considered difficult for Genetic Algorithms. To cope with this characteristic, the literature has proposed the use of Parallel Genetic Algorith...
148
click to vote
ICRA
2010
IEEE
15 years 2 months ago
2010
IEEE
— We present an algorithm that probabilistically covers a bounded region of the state space of a nonlinear system with a sparse tree of feedback stabilized trajectories leading t...
152
click to vote
CIKM
2006
Springer
15 years 7 months ago
2006
Springer
We consider the problem of finding highly correlated pairs in a large data set. That is, given a threshold not too small, we wish to report all the pairs of items (or binary attri...
140
click to vote
SDM
2007
SIAM
15 years 5 months ago
2007
SIAM
In recent years, spectral clustering method has gained attentions because of its superior performance compared to other traditional clustering algorithms such as K-means algorithm...
164
click to vote
CPM
2007
Springer
15 years 10 months ago
2007
Springer
Extracting motifs from a set of DNA sequences is important in computational biology. Occurrence probability is a common used statistics to evaluate the statistical significance of...