3838 search results - page 170 / 768 » Techniques for Optimization of Net Algorithms |
122
click to vote
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
Finding binary sequences with low autocorrelation is a very hard problem with many practical applications. In this paper we analyze several metaheuristic approaches to tackle the ...
148
click to vote
ADC
2003
Springer
15 years 9 months ago
2003
Springer
Selectivity estimation of queries not only provides useful information to the query processing optimization but also may give users a preview of processing results. In this paper,...
115
click to vote
EURODAC
1994
IEEE
15 years 8 months ago
1994
IEEE
We consider a switch module routing problem for symmetric array FPGAs. The work is motivated by two applications. The rst is that of eciently evaluating switch module designs [8]...
117
click to vote
GECCO
2006
Springer
15 years 7 months ago
2006
Springer
When an evolutionary algorithm addresses a sequence of instances of the same problem, it can seed its population with solutions that it found for previous instances. This techniqu...
125
click to vote
SIAMJO
2008
15 years 4 months ago
2008
This paper describes a Parallel Space Decomposition (PSD) technique for the Mesh Adaptive Direct Search (MADS) algorithm. MADS extends Generalized Pattern Search for constrained n...