256 search results - page 44 / 52 » Approximation of the worst-case execution time using structu... |
ISVLSI
2007
IEEE
15 years 6 months ago
2007
IEEE
Abstract— Time-to-Market plays a central role on System-ona-Chip (SoC) competitiveness and the quality of the final product is a matter of concern as well. As SoCs complexity in...
112
click to vote
APN
1994
Springer
15 years 3 months ago
1994
Springer
In this paper we describe a modelling project to improve a nuclear waste management program in charge of the creation of a new system for the permanent disposal of nuclear waste. S...
120
click to vote
EGH
2010
Springer
14 years 9 months ago
2010
Springer
The k-D tree is a well-studied acceleration data structure for ray tracing. It is used to organize primitives in a scene to allow efficient execution of intersection operations be...
JMM2
2007
14 years 11 months ago
2007
—Optical flow algorithms are difficult to apply to robotic vision applications in practice because of their extremely high computational and frame rate requirements. In most case...
PLDI
2010
ACM
15 years 4 months ago
2010
ACM
Dynamic correctness checking tools (a.k.a. lifeguards) can detect a wide array of correctness issues, such as memory, security, and concurrency misbehavior, in unmodified executa...