Sciweavers

4342 search results - page 231 / 869
» Improved Algorithms for Optimal Embeddings
Sort
View
168
Voted
DAC
2004
ACM
15 years 9 months ago
Quadratic placement using an improved timing model
The performance of timing-driven placement methods depends strongly on the choice of the net model. In this paper a more precise net model is presented that does not increase nume...
Bernd Obermeier, Frank M. Johannes
EMO
2005
Springer
120views Optimization» more  EMO 2005»
15 years 11 months ago
Multiobjective Optimization on a Budget of 250 Evaluations
Abstract. In engineering and other ‘real-world’ applications, multiobjective optimization problems must frequently be tackled on a tight evaluation budget — tens or hundreds ...
Joshua D. Knowles, Evan J. Hughes
ESA
1995
Springer
127views Algorithms» more  ESA 1995»
15 years 9 months ago
Optimized Binary Search and Text Retrieval
We present an algorithm that minimizes the expected cost of indirect binary search for data with non-constant access costs, such as disk data. Indirect binary search means that sor...
Eduardo F. Barbosa, Gonzalo Navarro, Ricardo A. Ba...
ESA
2008
Springer
124views Algorithms» more  ESA 2008»
15 years 7 months ago
Collusion-Resistant Mechanisms with Verification Yielding Optimal Solutions
A truthful mechanism consists of an algorithm augmented with a suitable payment function which guarantees that the "players" cannot improve their utilities by "chea...
Paolo Penna, Carmine Ventre
ICCAD
2007
IEEE
115views Hardware» more  ICCAD 2007»
16 years 2 months ago
Timing optimization by restructuring long combinatorial paths
—We present an implementation of an algorithm for constructing provably fast circuits for a class of Boolean functions with input signals that have individual starting times. We ...
Jürgen Werber, Dieter Rautenbach, Christian S...