Sciweavers

7228 search results - page 46 / 1446
» From Algorithmic to Subjective Randomness
Sort
View
FSE
2007
Springer
263views Cryptology» more  FSE 2007»
15 years 3 months ago
Bad and Good Ways of Post-processing Biased Physical Random Numbers
Algorithmic post-processing is used to overcome statistical deficiencies of physical random number generators. We show that the quasigroup based approach for post-processing rando...
Markus Dichtl
OOPSLA
2007
Springer
15 years 3 months ago
Randoop: feedback-directed random testing for Java
RANDOOP FOR JAVA generates unit tests for Java code using feedback-directed random test generation. Below we describe RANDOOP’s input, output, and test generation algorithm. We ...
Carlos Pacheco, Michael D. Ernst
DIALM
2008
ACM
168views Algorithms» more  DIALM 2008»
14 years 11 months ago
Local broadcasting in the physical interference model
In this work we analyze the complexity of local broadcasting in the physical interference model. We present two distributed randomized algorithms: one that assumes that each node ...
Olga Goussevskaia, Thomas Moscibroda, Roger Watten...
STOC
2007
ACM
92views Algorithms» more  STOC 2007»
15 years 10 months ago
Tight bounds for asynchronous randomized consensus
A distributed consensus algorithm allows n processes to reach a common decision value starting from individual inputs. Wait-free consensus, in which a process always terminates wi...
Hagit Attiya, Keren Censor
AI
2006
Springer
15 years 1 months ago
On the Quality and Quantity of Random Decisions in Stochastic Local Search for SAT
Stochastic local search (SLS) methods are underlying some of the best-performing algorithms for certain types of SAT instances, both from an empirical as well as from a theoretical...
Dave A. D. Tompkins, Holger H. Hoos