2542 search results - page 162 / 509 » Computing Cartograms with Optimal Complexity |
111
click to vote
EGH
2005
Springer
15 years 6 months ago
2005
Springer
Complex shaders must be partitioned into multiple passes to execute on GPUs with limited hardware resources. Automatic partitioning gives rise to an NP-hard scheduling problem tha...
117
click to vote
DATE
2000
IEEE
15 years 5 months ago
2000
IEEE
∗∗ Functional BIST is a promising solution for self-testing complex digital systems at reduced costs in terms of area and performance degradation. The present paper addresses t...
122
click to vote
TCAD
2008
15 years 1 months ago
2008
Latency-insensitive protocols allow system-on-chip (SoC) engineers to decouple the design of the computing cores from the design of the intercore communication channels while follo...
110
click to vote
NIPS
2007
15 years 2 months ago
2007
Point-based algorithms have been surprisingly successful in computing approximately optimal solutions for partially observable Markov decision processes (POMDPs) in high dimension...
102
click to vote
DAC
2002
ACM
16 years 2 months ago
2002
ACM
Aim of this paper is to propose a methodology for the definition of an instruction-level energy estimation framework for VLIW (Very Long Instruction Word) processors. The power mo...