1529 search results - page 58 / 306 » Search Space Analysis of the Linear Ordering Problem |
152
Voted
GECCO
2005
Springer
15 years 9 months ago
2005
Springer
This paper will propose a novel approach in combining Evolutionary Algorithms with symbolic techniques in order to improve the convergence of the algorithm in the presence of larg...
140
Voted
GECCO
2009
Springer
15 years 10 months ago
2009
Springer
Recently, a form of memory usage was introduced for genetic programming (GP) called “soft memory.” Rather than have a new value completely overwrite the old value in a registe...
151
Voted
CVPR
2012
IEEE
13 years 6 months ago
2012
IEEE
We propose an efficient algorithm to find the exact nearest neighbor based on the Euclidean distance for largescale computer vision problems. We embed data points nonlinearly on...
148
Voted
ICCS
2003
Springer
15 years 9 months ago
2003
Springer
In many areas of design search and optimisation one needs to utilize Computational Fluid Dynamics (CFD) methods in order to obtain numerical solution of the flow field in and/or ...
117
Voted
CIAC
2000
Springer
15 years 8 months ago
2000
Springer
We consideralgorithms for a simple one-dimensionalpoint placement problem: given N points on a line, and noisy measurements of the distances between many pairs of them, estimate th...