Sciweavers

4037 search results - page 131 / 808
» Routing without ordering
Sort
View
HPCA
2007
IEEE
14 years 9 months ago
Improving Branch Prediction and Predicated Execution in Out-of-Order Processors
If-conversion is a compiler technique that reduces the misprediction penalties caused by hard-to-predict branches, transforming control dependencies into data dependencies. Althou...
Eduardo Quiñones, Joan-Manuel Parcerisa, An...
POPL
2010
ACM
14 years 6 months ago
A Relational Modal Logic for Higher-Order Stateful ADTs
The method of logical relations is a classic technique for proving the equivalence of higher-order programs that implement the same observable behavior but employ different intern...
Derek Dreyer, Georg Neis, Andreas Rossberg, Lars B...
POPL
2010
ACM
14 years 6 months ago
Static Determination of Quantitative Resource Usage for Higher-Order Programs
We describe a new automatic static analysis for determining upper-bound functions on the use of quantitative resources for strict, higher-order, polymorphic, recursive programs de...
Steffen Jost, Hans-Wolfgang Loidl, Kevin Hammond, ...
VISUALIZATION
2005
IEEE
14 years 2 months ago
Rendering Tetrahedral Meshes with Higher-Order Attenuation Functions for Digital Radiograph Reconstruction
This paper presents a novel method for computing simulated x-ray images, or DRRs (digitally reconstructed radiographs), of tetrahedral meshes with higher-order attenuation functio...
Ofri Sadowsky, Jonathan D. Cohen, Russell H. Taylo...
EMSOFT
2004
Springer
14 years 2 months ago
Making mechatronic agents resource-aware in order to enable safe dynamic resource allocation
Mechatronic systems are embedded software systems with hard real-time requirements. Predictability is of paramount importance for these systems. Thus, their design has to take the...
Sven Burmester, Matthias Gehrke, Holger Giese, Sim...