Sciweavers

867 search results - page 133 / 174
» Optimizing synthesis with metasketches
Sort
View
DATE
2009
IEEE
102views Hardware» more  DATE 2009»
14 years 5 months ago
Register placement for high-performance circuits
—In modern sub-micron design, achieving low-skew clock distributions is facing challenges for high-performance circuits. Symmetric global clock distribution and clock tree synthe...
Mei-Fang Chiang, Takumi Okamoto, Takeshi Yoshimura
AUSSOIS
2001
Springer
14 years 3 months ago
An Augment-and-Branch-and-Cut Framework for Mixed 0-1 Programming
In recent years the branch-and-cut method, a synthesis of the classical branch-and-bound and cutting plane methods, has proven to be a highly successful approach to solving large-s...
Adam N. Letchford, Andrea Lodi
GECCO
2007
Springer
192views Optimization» more  GECCO 2007»
14 years 2 months ago
A new crossover technique for Cartesian genetic programming
Genetic Programming was first introduced by Koza using tree representation together with a crossover technique in which random sub-branches of the parents' trees are swapped ...
Janet Clegg, James Alfred Walker, Julian Francis M...
JEI
2006
162views more  JEI 2006»
13 years 10 months ago
Markovian segmentation and parameter estimation on graphics hardware
In this paper, we show how Markovian strategies used to solve well-known segmentation problems such as motion estimation, motion detection, motion segmentation, stereovision, and c...
Pierre-Marc Jodoin, Max Mignotte
ICCAD
2003
IEEE
109views Hardware» more  ICCAD 2003»
14 years 7 months ago
Large-Scale Circuit Placement: Gap and Promise
Placement is one of the most important steps in the RTLto-GDSII synthesis process, as it directly defines the interconnects, which have become the bottleneck in circuit and syste...
Jason Cong, Tim Kong, Joseph R. Shinnerl, Min Xie,...