480 search results - page 4 / 96 » Algorithmic tests and randomness with respect to a class of ... |
RANDOM
1999
Springer
13 years 9 months ago
1999
Springer
We present a randomized algorithm to nd a minimum spanning forest (MSF) in an undirected graph. With high probability, the algorithm runs in logarithmic time and linear work on an...
ISSTA
2006
ACM
13 years 11 months ago
2006
ACM
There are several problem areas that must be addressed when applying randomization to unit testing. As yet no general, fully automated solution that works for all units has been p...
ISSTA
2004
ACM
13 years 10 months ago
2004
ACM
Object oriented programming promotes reuse of classes in multiple contexts. Thus, a class is designed and implemented with several usage scenarios in mind, some of which possibly ...
CP
2000
Springer
13 years 9 months ago
2000
Springer
Random Noise and Random Walk algorithms are local search strategies that have been used for the problem of satisfiability testing (SAT). We present a Markov-chain based analysis o...
ISCIS
2005
Springer
13 years 10 months ago
2005
Springer
Dense subgraphs of sparse graphs (communities), which appear in most real-world complex networks, play an important role in many contexts. Computing them however is generally expe...