3136 search results - page 206 / 628 » Comparison of Clique-Listing Algorithms |
185
click to vote
ISCI
1998
15 years 6 months ago
1998
: This paper describes the successful parallel implementation of genetic programming on a network of processing nodes using the transputer architecture. With this approach, researc...
191
click to vote
ML
2002
ACM
15 years 6 months ago
2002
ACM
We provide an analytical comparison between discounted and average reward temporal-difference (TD) learning with linearly parameterized approximations. We first consider the asympt...
183
click to vote
GECCO
2010
Springer
15 years 5 months ago
2010
Springer
In this paper, the performances of the NEW Unconstrained Optimization Algorithm (NEWUOA) on some noiseless functions are compared to those of the BI-POPulation Covariance Matrix A...
175
click to vote
ISITA
2010
15 years 4 months ago
2010
In this paper we propose a modication of the Hopeld neural networks for vector precoding, based on Lenstra, Lenstra, and Lov`asz lattice basis reduction. This precoding algorithm c...
171
click to vote
ACL
2009
15 years 4 months ago
2009
Iterative bootstrapping algorithms are typically compared using a single set of handpicked seeds. However, we demonstrate that performance varies greatly depending on these seeds,...