Sciweavers

2297 search results - page 220 / 460
» Production of Large Computer Programs
Sort
View
SI3D
2009
ACM
16 years 1 months ago
Approximating dynamic global illumination in image space
Physically plausible illumination at real-time framerates is often achieved using approximations. One popular example is ambient occlusion (AO), for which very simple and efficie...
Tobias Ritschel, Thorsten Grosch, Hans-Peter Seide...
APLAS
2009
ACM
16 years 25 days ago
Asymptotic Resource Usage Bounds
When describing the resource usage of a program, it is usual to talk in asymptotic terms, such as the well-known “big O” notation, whereby we focus on the behaviour of the prog...
Elvira Albert, Diego Alonso, Puri Arenas, Samir Ge...
ASPLOS
2006
ACM
16 years 9 days ago
HeapMD: identifying heap-based bugs using anomaly detection
We present the design, implementation, and evaluation of HeapMD, a dynamic analysis tool that finds heap-based bugs using anomaly detection. HeapMD is based upon the observation ...
Trishul M. Chilimbi, Vinod Ganapathy
CEC
2005
IEEE
15 years 12 months ago
Fast evolution of custom machine representations
Described are new approaches for evaluating computer program representations for use in automated search methodologies such as the evolutionary design of software. Previously, prog...
Lorenz Huelsbergen
FPGA
2003
ACM
125views FPGA» more  FPGA 2003»
15 years 11 months ago
I/O placement for FPGAs with multiple I/O standards
In this paper, we present the first exact algorithm to solve the constrained I/O placement problem for FPGAs that support multiple I/O standards. We derive a compact integer line...
Wai-Kei Mak