Sciweavers

591 search results - page 49 / 119
» Global delay optimization using structural choices
Sort
View
DAC
2003
ACM
16 years 4 months ago
An O(nlogn) time algorithm for optimal buffer insertion
The classic algorithm for optimal buffer insertion due to van Ginneken has time and space complexity O(n2 ), where n is the number of possible buffer positions. We present a new a...
Weiping Shi, Zhuo Li
GECCO
2005
Springer
156views Optimization» more  GECCO 2005»
15 years 8 months ago
Parameterized versus generative representations in structural design: an empirical comparison
Any computational approach to design, including the use of evolutionary algorithms, requires the transformation of the domain-specific knowledge into a formal design representatio...
Rafal Kicinger, Tomasz Arciszewski, Kenneth A. De ...
COCOS
2003
Springer
139views Optimization» more  COCOS 2003»
15 years 8 months ago
Inter-block Backtracking: Exploiting the Structure in Continuous CSPs
This paper details a technique, called inter-block backtracking (IBB), which improves interval solving of decomposed systems with non-linear equations over the reals. This techniqu...
Bertrand Neveu, Christophe Jermann, Gilles Trombet...
MIAR
2006
IEEE
15 years 9 months ago
Statistics of Pose and Shape in Multi-object Complexes Using Principal Geodesic Analysis
Abstract. A main focus of statistical shape analysis is the description of variability of a population of geometric objects. In this paper, we present work in progress towards mode...
Martin Styner, Kevin Gorczowski, P. Thomas Fletche...
KDD
2010
ACM
249views Data Mining» more  KDD 2010»
15 years 5 months ago
Semi-supervised sparse metric learning using alternating linearization optimization
In plenty of scenarios, data can be represented as vectors mathematically abstracted as points in a Euclidean space. Because a great number of machine learning and data mining app...
Wei Liu, Shiqian Ma, Dacheng Tao, Jianzhuang Liu, ...