4524 search results - page 705 / 905 » The Complexity of Global Constraints |
218
click to vote
ISPD
2004
ACM
16 years 20 days ago
2004
ACM
VLSI placement tools usually work in two steps: First, the cells that have to be placed are roughly spread out over the chip area ignoring disjointness (global placement). Then, i...
218
click to vote
CBSE
2004
Springer
16 years 19 days ago
2004
Springer
According to Szyperski, “a software component is a unit of composition with contractually specified interfaces and explicit context dependencies only”. But it is well known tha...
194
click to vote
DATE
2003
IEEE
16 years 15 days ago
2003
IEEE
This paper presents a new algorithm for on-the-fly data compression in high performance VLIW processors. The algorithm aggressively targets energy minimization of some of the domi...
266
click to vote
HLK
2003
IEEE
16 years 15 days ago
2003
IEEE
It’s common experience for human vision to perceive full 3D shape and scene from a single 2D image with the occluded parts “filled-in” by prior visual knowledge. In this pa...
219
click to vote
WECWIS
2002
IEEE
16 years 4 days ago
2002
IEEE
Despite the large amounts of runtime needed to adequately solve a combinatorial auction (CA), existing iterative CA auction protocols require winner determination during every rou...