867 search results - page 115 / 174 » Optimizing synthesis with metasketches |
75
Voted
ICCAD
1997
IEEE
15 years 4 months ago
1997
IEEE
Technology-independenttimingoptimizationis animportantproblem in logic synthesis. Although many promising techniques have been proposed in the past, unfortunately they are quite s...
110
Voted
ICCAD
1994
IEEE
15 years 4 months ago
1994
IEEE
A simple extension of the critical path method is presented which allows more accurate optimization of circuits with level-sensitive latches. The extended formulation provides a s...
132
Voted
CVPR
2007
IEEE
16 years 2 months ago
2007
IEEE
Many computer vision applications rely on the efficient optimization of challenging, so-called non-submodular, binary pairwise MRFs. A promising graph cut based approach for optim...
85
Voted
DAC
2006
ACM
16 years 1 months ago
2006
ACM
Design space exploration during high level synthesis is often conducted through ad-hoc probing of the solution space using some scheduling algorithm. This is not only time consumi...
223
Voted
ICFP
2009
ACM
16 years 1 months ago
2009
ACM
re a popular form of abstract computation. Being more general than monads, they are more broadly applicable, and in parare a good abstraction for signal processing and dataflow co...