Sciweavers

7519 search results - page 111 / 1504
» Optimizing Generic Functions
Sort
View
ICCAD
2005
IEEE
83views Hardware» more  ICCAD 2005»
16 years 1 months ago
Post-placement rewiring and rebuffering by exhaustive search for functional symmetries
Separate optimizations of logic and layout have been thoroughly studied in the past and are well documented for common benchmarks. However, to be competitive, modern circuit optim...
Kai-Hui Chang, Igor L. Markov, Valeria Bertacco
GECCO
2006
Springer
195views Optimization» more  GECCO 2006»
15 years 8 months ago
Studying XCS/BOA learning in Boolean functions: structure encoding and random Boolean functions
Recently, studies with the XCS classifier system on Boolean functions have shown that in certain types of functions simple crossover operators can lead to disruption and, conseque...
Martin V. Butz, Martin Pelikan
GECCO
2009
Springer
141views Optimization» more  GECCO 2009»
15 years 9 months ago
Benchmarking the NEWUOA on the BBOB-2009 function testbed
The NEWUOA which belongs to the class of Derivative-Free optimization algorithms is benchmarked on the BBOB-2009 noisefree testbed. A multistart strategy is applied with a maximum...
Raymond Ros
COCO
2010
Springer
149views Algorithms» more  COCO 2010»
15 years 8 months ago
The Gaussian Surface Area and Noise Sensitivity of Degree-d Polynomial Threshold Functions
Abstract. We prove asymptotically optimal bounds on the Gaussian noise sensitivity of degree-d polynomial threshold functions. These bounds translate into optimal bounds on the Gau...
Daniel M. Kane
EUROGP
1999
Springer
105views Optimization» more  EUROGP 1999»
15 years 9 months ago
How to Invent Functions
The paper presents the abstraction transformation which is a fundaethod for creating functions in ADATE. The use of abstraction turns out to be similar to evolution by gene duplic...
Roland Olsson