17967 search results - page 154 / 3594 » Functional timing optimization |
CORR
2008
Springer
13 years 8 months ago
2008
Springer
One way to find closest pairs in large datasets is to use hash functions [6], [12]. In recent years locality-sensitive hash functions for various metrics have been given: projecti...
ISCC
2006
IEEE
14 years 2 months ago
2006
IEEE
Genetic Algorithms are very powerful search methods that are used in different optimization problems. Parallel versions of genetic algorithms are easily implemented and usually in...
ALP
1997
Springer
14 years 13 days ago
1997
Springer
Abstract. We show that non-determinism simplifies coding certain problems into programs. We define a non-confluent, but well-behaved class of rewrite systems for supporting non-...
GECCO
2003
Springer
14 years 1 months ago
2003
Springer
Abstract. This paper introduces a new technique called adaptive elitistpopulation search method for allowing unimodal function optimization methods to be extended to efficiently lo...
GECCO
2000
Springer
13 years 12 months ago
2000
Springer
The integration of genetic algorithms (GAs) and tabu search is one of traditional problems in function optimization in the GA literature. However, most proposed methods have utili...