Sciweavers

1529 search results - page 58 / 306
» Search Space Analysis of the Linear Ordering Problem
Sort
View
GECCO
2005
Springer
125views Optimization» more  GECCO 2005»
14 years 1 months ago
Improving EA-based design space exploration by utilizing symbolic feasibility tests
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...
Thomas Schlichter, Christian Haubelt, Jürgen ...
GECCO
2009
Springer
112views Optimization» more  GECCO 2009»
14 years 2 months ago
Soft memory for stock market analysis using linear and developmental genetic programming
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...
Garnett Carl Wilson, Wolfgang Banzhaf
CVPR
2012
IEEE
11 years 10 months ago
A fast nearest neighbor search algorithm by nonlinear embedding
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...
Yoonho Hwang, Bohyung Han, Hee-Kap Ahn
ICCS
2003
Springer
14 years 27 days ago
Implementation of a Grid-Enabled Problem Solving Environment in Matlab
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 ...
M. Hakki Eres, Graeme E. Pound, Zhuoan Jiao, Jasmi...
CIAC
2000
Springer
105views Algorithms» more  CIAC 2000»
14 years 1 days ago
Algorithms for a Simple Point Placement Problem
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...
Joshua Redstone, Walter L. Ruzzo