Sciweavers

309 search results - page 34 / 62
» A Comparative Revisitation of Some Program Transformation Te...
Sort
View
KBSE
2005
IEEE
14 years 1 months ago
Automated path generation for software fault localization
Localizing the cause(s) of an observable error lies at the heart of program debugging. Fault localization often proceeds by comparing the failing program run with some “successf...
Tao Wang, Abhik Roychoudhury
JMLR
2010
144views more  JMLR 2010»
13 years 2 months ago
Practical Approaches to Principal Component Analysis in the Presence of Missing Values
Principal component analysis (PCA) is a classical data analysis technique that finds linear transformations of data that retain the maximal amount of variance. We study a case whe...
Alexander Ilin, Tapani Raiko
SAC
2008
ACM
13 years 7 months ago
Optimizing code through iterative specialization
Code specialization is a way to obtain significant improvement in the performance of an application. It works by exposing values of different parameters in source code. The availa...
Minhaj Ahmad Khan, Henri-Pierre Charles, Denis Bar...
ATMOS
2007
114views Optimization» more  ATMOS 2007»
13 years 9 months ago
Fast Approaches to Robust Railway Timetabling
The Train Timetabling Problem (TTP) consists in finding a train schedule on a railway network that satisfies some operational constraints and maximizes a profit function which c...
Matteo Fischetti, Arrigo Zanette, Domenico Salvagn...
JSA
2000
175views more  JSA 2000»
13 years 7 months ago
Complete worst-case execution time analysis of straight-line hard real-time programs
In this article, the problem of finding a tight estimate on the worst-case execution time (WCET) of a real-time program is addressed. The analysis is focused on straight-line code...
Friedhelm Stappert, Peter Altenbernd