Sciweavers

674 search results - page 68 / 135
» Explanation Based Program Transformation
Sort
View
TPDS
1998
124views more  TPDS 1998»
13 years 9 months ago
Using Recorded Values for Bounding the Minimum Completion Time in Multiprocessors
—The way the processes in a parallel program are scheduled on the processors of a multiprocessor system affects the performance significantly. Finding a schedule of processes to ...
Lars Lundberg, Håkan Lennerstad
EDBT
2009
ACM
98views Database» more  EDBT 2009»
14 years 4 months ago
A runtime approach to model-independent schema and data translation
A runtime approach to model-generic translation of schema and data is proposed. It is based on our previous work on MIDST, a platform conceived to perform translations in an off-...
Paolo Atzeni, Luigi Bellomarini, Francesca Bugiott...
ASPDAC
2006
ACM
119views Hardware» more  ASPDAC 2006»
14 years 4 months ago
Using speculative computation and parallelizing techniques to improve scheduling of control based designs
Recent research results have seen the application of parallelizing techniques to high-level synthesis. In particular, the effect of speculative code transformations on mixed contr...
Roberto Cordone, Fabrizio Ferrandi, Marco D. Santa...
CVPR
2008
IEEE
14 years 12 months ago
A polynomial-time bound for matching and registration with outliers
We present a framework for computing optimal transformations, aligning one point set to another, in the presence of outliers. Example applications include shape matching and regis...
Carl Olsson, Olof Enqvist, Fredrik Kahl
ICLP
2005
Springer
14 years 3 months ago
Modeling Systems in CLP
We present a methodology for the modeling of complex program behavior in CLP. In the first part we present an informal description about how to represent a system in CLP. At its ...
Joxan Jaffar, Andrew E. Santosa, Razvan Voicu