Sciweavers

967 search results - page 171 / 194
» Probabilistic Predicative Programming
Sort
View
IEEEPACT
2000
IEEE
15 years 4 months ago
A Lightweight Algorithm for Dynamic If-Conversion during Dynamic Optimization
Dynamic Optimization is an umbrella term that refers to any optimization of software that is performed after the initial compile time. It is a complementary optimization opportuni...
Kim M. Hazelwood, Thomas M. Conte
DEXA
1999
Springer
87views Database» more  DEXA 1999»
15 years 4 months ago
SECONDO/QP: Implementation of a Generic Query Processor
: In an extensible database system, evaluation of a query plan is done in cooperation between a collection of operator implementation functions and a component of the DBMS that we ...
Ralf Hartmut Güting, Stefan Dieker, Claudia F...
SIGGRAPH
1993
ACM
15 years 3 months ago
Global visibility algorithms for illumination computations
The most expensive geometric operation in image synthesis is visibility determination. Classically this is solved with hidden surface removal algorithms that render only the parts...
Seth J. Teller, Pat Hanrahan
CASES
2006
ACM
15 years 3 months ago
Reaching fast code faster: using modeling for efficient software thread integration on a VLIW DSP
When integrating software threads together to boost performance on a processor with instruction-level parallel processing support, it is rarely clear which code regions should be ...
Won So, Alexander G. Dean
DATE
2004
IEEE
175views Hardware» more  DATE 2004»
15 years 3 months ago
Breaking Instance-Independent Symmetries in Exact Graph Coloring
Code optimization and high level synthesis can be posed as constraint satisfaction and optimization problems, such as graph coloring used in register allocation. Graph coloring is...
Arathi Ramani, Fadi A. Aloul, Igor L. Markov, Kare...