708 search results - page 61 / 142 » Timing closure: the solution and its problems |
COMPGEOM
2011
ACM
14 years 1 months ago
2011
ACM
We consider the offset-deconstruction problem: Given a polygonal shape Q with n vertices, can it be expressed, up to a tolerance ε in Hausdorff distance, as the Minkowski sum o...
ICIP
2008
IEEE
15 years 11 months ago
2008
IEEE
We consider the problem of reconstructing time sequences of spatially sparse signals (with unknown and time-varying sparsity patterns) from a limited number of linear "incohe...
GECCO
2004
Springer
15 years 3 months ago
2004
Springer
Genetic algorithms require relatively large computation time to solve optimization problems, especially in VLSI CAD such as module placement. Therefore, island-based parallel GAs a...
133
click to vote
CINQ
2004
Springer
15 years 1 months ago
2004
Springer
The conflict between resource consumption and query performance in the data mining context often has no satisfactory solution. This not only stands in sharp contrast to the need of...
FPL
2008
Springer
14 years 11 months ago
2008
Springer
Due to continuous improvements in the resources available on FPGAs, it is becoming increasingly possible to accelerate floating point algorithms. The solution of a system of linea...