1474 search results - page 203 / 295 » Exploiting Locality in a TMS |
135
click to vote
CGO
2005
IEEE
15 years 10 months ago
2005
IEEE
Register allocation is one of the most important optimizations a compiler performs. Conventional graphcoloring based register allocators are fast and do well on regular, RISC-like...
141
click to vote
CIMCA
2005
IEEE
15 years 10 months ago
2005
IEEE
Minimal Switching Graph (MSG) is a graphical model for the constrained via minimization problem — a combinatorial optimization problem in integrated circuit design automation. F...
195
Voted
DSN
2005
IEEE
15 years 10 months ago
2005
IEEE
This paper proposes and evaluates strategies to build reliable and secure wireless ad hoc networks. Our contribution is based on the notion of inner-circle consistency, where loca...
159
click to vote
HOTI
2005
IEEE
15 years 10 months ago
2005
IEEE
: The exposed memory hierarchies employed in many network processors (NPs) are expensive in terms of meeting the worst-case processing requirement. Moreover, it is difficult to ef...
119
Voted
ICMCS
2005
IEEE
15 years 10 months ago
2005
IEEE
In this paper, we propose a multiple objective frame rate up conversion algorithm (MOFRUC), which utilizes two different models. The first model is a constant velocity model that ...