Sciweavers

3680 search results - page 606 / 736
» cases 2010
Sort
View
OOPSLA
2010
Springer
15 years 3 months ago
Random testing for higher-order, stateful programs
Testing is among the most effective tools available for finding bugs. Still, we know of no automatic technique for generating test cases that expose bugs involving a combination ...
Casey Klein, Matthew Flatt, Robert Bruce Findler
OOPSLA
2010
Springer
15 years 3 months ago
Collaborative model merging
Models are important artifacts in the software development life-cycle and are often the result of a collaborative activity of multiple developers. When multiple developers modify ...
Maximilian Koegel, Helmut Naughton, Jonas Helming,...
RSA
2010
107views more  RSA 2010»
15 years 3 months ago
Continuum limits for classical sequential growth models
A random graph order, also known as a transitive percolation process, is defined by taking a random graph on the vertex set {0, . . . , n − 1}, and putting i below j if there i...
Graham Brightwell, Nicholas Georgiou
SIAMCOMP
2010
100views more  SIAMCOMP 2010»
15 years 3 months ago
Algorithmic Enumeration of Ideal Classes for Quaternion Orders
We provide algorithms to count and enumerate representatives of the (right) ideal classes of an Eichler order in a quaternion algebra defined over a number field. We analyze the ...
Markus Kirschmer, John Voight
SIAMDM
2010
149views more  SIAMDM 2010»
15 years 3 months ago
Formal Theory of Noisy Sensor Network Localization
Graph theory has been used to characterize the solvability of the sensor network localization problem. If sensors correspond to vertices and edges correspond to sensor pairs betwee...
Brian D. O. Anderson, Iman Shames, Guoqiang Mao, B...