119 search results - page 19 / 24 » Hyperreconfigurable Architectures for Fast Run Time Reconfig... |
DAC
2006
ACM
15 years 10 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...
VLSID
2008
IEEE
15 years 3 months ago
2008
IEEE
We present a lightweight scheme for watermarking or annotating video clips with information describing the workload that would be incurred while decoding the clip. This informatio...
ISCC
2005
IEEE
15 years 3 months ago
2005
IEEE
—A framework for designing a family of novel fast CRC generation algorithms is presented. Our algorithms can ideally read arbitrarily large amounts of data at a time, while optim...
DAC
1996
ACM
15 years 1 months ago
1996
ACM
Iterative-improvement 2-way min-cut partitioning is an important phase in most circuit partitioning tools. Most iterative improvement techniques for circuit netlists like the Fidd...
100
click to vote
EWSPT
2001
Springer
15 years 2 months ago
2001
Springer
We describe an approach based upon software process technology to on-the-fly monitoring, redeployment, reconfiguration, and in general dynamic adaptation of distributed software ap...