1862 search results - page 169 / 373 » General Architecture for Hardware Implementation of Genetic ... |
131
Voted
DSD
2010
IEEE
15 years 3 months ago
2010
IEEE
—Although many efficient high-level algorithms have been proposed for the realization of Multiple Constant Multiplications (MCM) using the fewest number of addition and subtract...
114
Voted
GECCO
2005
Springer
15 years 9 months ago
2005
Springer
Overfitting is a fundamental problem of most machine learning techniques, including genetic programming (GP). Canary functions have been introduced in the literature as a concept ...
92
Voted
GECCO
2005
Springer
15 years 9 months ago
2005
Springer
Evaluating GP schema in context is considered to be a complex, and, at times impossible, task. The tightly linked nodes of a GP tree is the main reason behind its complexity. This...
120
Voted
DATE
2008
IEEE
15 years 10 months ago
2008
IEEE
Extending 2-D planar topologies in integrated circuits (ICs) to a 3-D implementation has the obvious benefits of reducing the overall footprint and average interconnection length,...
158
Voted
BIBE
2008
IEEE
15 years 10 months ago
2008
IEEE
— The Smith-Waterman algorithm is a dynamic programming method for determining optimal local alignments between nucleotide or protein sequences. However, it suffers from quadrati...