Sciweavers

2266 search results - page 60 / 454
» Some Solutions to the Ignoring Problem
Sort
View
GECCO
2010
Springer
181views Optimization» more  GECCO 2010»
15 years 6 months ago
Evolving neural networks in compressed weight space
We propose a new indirect encoding scheme for neural networks in which the weight matrices are represented in the frequency domain by sets of Fourier coefficients. This scheme exp...
Jan Koutnik, Faustino J. Gomez, Jürgen Schmid...
4OR
2004
63views more  4OR 2004»
15 years 1 months ago
A note on robust 0-1 optimization with uncertain cost coefficients
Abstract. Based on the recent approach of Bertsimas and Sim (2004, 2003) to robust optimization in the presence of data uncertainty, we prove an easily computable and simple bound ...
Mustafa Ç. Pinar
TCAD
2010
112views more  TCAD 2010»
14 years 8 months ago
Multilayer Global Routing With Via and Wire Capacity Considerations
Global routing for modern large-scale circuit designs has attracted much attention in the recent literature. Most of the state-of-the-art academic global routers just work on a sim...
Chin-Hsiung Hsu, Huang-Yu Chen, Yao-Wen Chang
AI
2010
Springer
15 years 1 months ago
Elicitation strategies for soft constraint problems with missing preferences: Properties, algorithms and experimental studies
We consider soft constraint problems where some of the preferences may be unspecified. This models, for example, settings where agents are distributed and have privacy issues, or ...
Mirco Gelain, Maria Silvia Pini, Francesca Rossi, ...
ESOP
2001
Springer
15 years 5 months ago
On the Complexity of Constant Propagation
Constant propagation (CP) is one of the most widely used optimizations in practice (cf. [9]). Intuitively, it addresses the problem of statically detecting whether an expression al...
Markus Müller-Olm, Oliver Rüthing