5606 search results - page 187 / 1122 » Randomization Techniques for Graphs. |
ISSTA
2006
ACM
15 years 6 months ago
2006
ACM
Test campaigns usually require only a restricted subset of paths in a program to be thoroughly tested. As random testing (RT) offers interesting fault-detection capacities at low ...
109
click to vote
ICPP
2006
IEEE
15 years 6 months ago
2006
IEEE
stractions are extensively used to understand and solve challenging computational problems in various scientific and engineering domains. They have particularly gained prominence...
125
click to vote
RSA
2008
15 years 5 days ago
2008
We study the random composition of a small family of O(n3 ) simple permutations on {0, 1}n . Specifically we ask how many randomly selected simple permutations need be composed to...
132
Voted
CORR
2006
Springer
15 years 22 days ago
2006
Springer
We provide a tight approximate characterization of the n-dimensional product multicommodity flow (PMF) region for a wireless network of n nodes. Separate characterizations in term...
153
Voted
SODA
2012
ACM
13 years 3 months ago
2012
ACM
Motivated by online ad allocation, we study the problem of simultaneous approximations for the adversarial and stochastic online budgeted allocation problem. This problem consists...