Sciweavers

2370 search results - page 283 / 474
» The Characterization of Data-Accumulating Algorithms
Sort
View
ASPLOS
2010
ACM
16 years 1 months ago
A randomized scheduler with probabilistic guarantees of finding bugs
This paper presents a randomized scheduler for finding concurrency bugs. Like current stress-testing methods, it repeatedly runs a given test program with supplied inputs. Howeve...
Sebastian Burckhardt, Pravesh Kothari, Madanlal Mu...
IPSN
2010
Springer
16 years 1 months ago
Self-identifying sensor data
Public-use sensor datasets are a useful scientific resource with the unfortunate feature that their provenance is easily disconnected from their content. To address this we intro...
Stephen Chong, Christian Skalka, Jeffrey A. Vaugha...
ICML
2009
IEEE
16 years 1 months ago
Grammatical inference as a principal component analysis problem
One of the main problems in probabilistic grammatical inference consists in inferring a stochastic language, i.e. a probability distribution, in some class of probabilistic models...
Raphaël Bailly, François Denis, Liva R...
TACAS
2009
Springer
122views Algorithms» more  TACAS 2009»
16 years 1 months ago
Test Input Generation for Programs with Pointers
Software testing is an essential process to improve software quality in practice. Researchers have proposed several techniques to automate parts of this process. In particular, sym...
Dries Vanoverberghe, Nikolai Tillmann, Frank Piess...
WG
2009
Springer
16 years 1 months ago
Sub-coloring and Hypo-coloring Interval Graphs
In this paper, we study the sub-coloring and hypo-coloring problems on interval graphs. These problems have applications in job scheduling and distributed computing and can be used...
Rajiv Gandhi, Bradford Greening, Sriram V. Pemmara...