22018 search results - page 4259 / 4404 » or 2004 |
178
click to vote
COCO
2004
Springer
15 years 10 months ago
2004
Springer
Based on the framework of parameterized complexity theory, we derive tight lower bounds on the computational complexity for a number of well-known NP-hard problems. We start by pr...
180
click to vote
COCO
2004
Springer
15 years 10 months ago
2004
Springer
We initiate the study of the computational complexity of the covering radius problem for point lattices, and approximation versions of the problem for both lattices and linear cod...
200
click to vote
CODES
2004
IEEE
15 years 10 months ago
2004
IEEE
The high transistor density afforded by modern VLSI processes have enabled the design of embedded processors that use clustered execution units to deliver high levels of performan...
186
click to vote
CODES
2004
IEEE
15 years 10 months ago
2004
IEEE
As a result of improvements in process technology, more and more components are being integrated into a single System-on-Chip (SoC) design. Communication between these components ...
209
click to vote
CODES
2004
IEEE
15 years 10 months ago
2004
IEEE
For complex System-on-chips (SoCs) fabricated in nanometer technologies, the system-level on-chip communication architecture is emerging as a significant source of power consumpti...