6943 search results - page 680 / 1389 » Representations for evolutionary algorithms |
182
click to vote
ASIACRYPT
2000
Springer
15 years 12 months ago
2000
Springer
A discrete-logarithm algorithm is called generic if it does not exploit the specific representation of the cyclic group for which it is supposed to compute discrete logarithms. Su...
208
click to vote
NIPS
2008
15 years 9 months ago
2008
Sampling functions in Gaussian process (GP) models is challenging because of the highly correlated posterior distribution. We describe an efficient Markov chain Monte Carlo algori...
207
click to vote
AAAI
2006
15 years 9 months ago
2006
AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is its sens...
180
Voted
FIMI
2003
15 years 9 months ago
2003
We present a depth-first algorithm, PatriciaMine, that discovers all frequent itemsets in a dataset, for a given support threshold. The algorithm is main-memory based and employs...
178
click to vote
SODA
2004
ACM
15 years 8 months ago
2004
ACM
The analyses of many algorithms and data structures (such as digital search trees) for searching and sorting are based on the representation of the keys involved as bit strings and...