Sciweavers

254 search results - page 22 / 51
» Efficient Implementation of the Generalized Tunstall Code Ge...
Sort
View
DAGSTUHL
2006
13 years 8 months ago
Coxeter Lattice Paths
Supercomputing applications usually involve the repeated parallel application of discretized differential operators. Difficulties arise with higher-order discretizations their com...
Thomas J. Ashby, Anthony D. Kennedy, Stephen M. Wa...
DAC
2009
ACM
14 years 7 months ago
Context-sensitive timing analysis of Esterel programs
Traditionally, synchronous languages, such as Esterel, have been compiled into hardware, where timing analysis is relatively easy. When compiled into software ? e.g., into sequent...
Lei Ju, Bach Khoa Huynh, Samarjit Chakraborty, Abh...
GECCO
2005
Springer
159views Optimization» more  GECCO 2005»
14 years 8 days 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
WWW
2006
ACM
14 years 7 months ago
Interactive wrapper generation with minimal user effort
While much of the data on the web is unstructured in nature, there is also a significant amount of embedded structured data, such as product information on e-commerce sites or sto...
Utku Irmak, Torsten Suel
TPDS
2002
136views more  TPDS 2002»
13 years 6 months ago
Automatic Partitioning of Parallel Loops with Parallelepiped-Shaped Tiles
In this paper, an efficient algorithm to implement loop partitioning is introduced and evaluated. We start from results of Agarwal et al. [1] whose aim is to minimize the number of...
Fabrice Rastello, Yves Robert