Sciweavers

1560 search results - page 119 / 312
» Order Functions and Evaluation Codes
Sort
View
CAV
2006
Springer
146views Hardware» more  CAV 2006»
14 years 1 months ago
Termination Analysis with Calling Context Graphs
We introduce calling context graphs and various static and theorem proving based analyses that together provide a powerful method for proving termination of programs written in fea...
Panagiotis Manolios, Daron Vroon
EUSFLAT
2003
13 years 11 months ago
Self-dual types of cycle-transitivity
A general framework for studying the transitivity of reciprocal relations is presented. The key feature is the cyclic evaluation of transitivity: triangles (i.e. any three points)...
Bernard De Baets, Hans De Meyer, Bart De Schuymer
CPHYSICS
2010
195views more  CPHYSICS 2010»
13 years 10 months ago
Fast spherical Bessel transform via fast Fourier transform and recurrence formula
We propose a new method for the numerical evaluation of the spherical Bessel transform. A formula is derived for the transform by using an integral representation of the spherical...
Masayuki Toyoda, Taisuke Ozaki
MICRO
2005
IEEE
126views Hardware» more  MICRO 2005»
14 years 3 months ago
Cost Sensitive Modulo Scheduling in a Loop Accelerator Synthesis System
Scheduling algorithms used in compilers traditionally focus on goals such as reducing schedule length and register pressure or producing compact code. In the context of a hardware...
Kevin Fan, Manjunath Kudlur, Hyunchul Park, Scott ...
GECCO
2005
Springer
159views Optimization» more  GECCO 2005»
14 years 3 months ago
Using evolutionary algorithms for the unit testing of object-oriented software
As the paradigm of object orientation becomes more and more important for modern IT development projects, the demand for an automated test case generation to dynamically test obje...
Stefan Wappler, Frank Lammermann