Sciweavers

5580 search results - page 116 / 1116
» Randomized priority algorithms
Sort
View
GECCO
2006
Springer
141views Optimization» more  GECCO 2006»
15 years 1 months ago
Towards effective adaptive random testing for higher-dimensional input domains
Adaptive Random Testing subsumes a class of algorithms that detect the first failure with less test cases than Random Testing. The present paper shows that a "reference metho...
Johannes Mayer
ERSA
2006
150views Hardware» more  ERSA 2006»
14 years 11 months ago
An Area Time Efficient Field Programmable Mersenne Twister Uniform Random Number Generator
Reconfigurable computing offers an attractive solution to accelerating infrared scene simulations. In infrared scene simulations, the modeling of a number of atmospheric and optic...
Vinay Sriram, David Kearney
SODA
2004
ACM
144views Algorithms» more  SODA 2004»
14 years 11 months ago
Covering minimum spanning trees of random subgraphs
We consider the problem of finding a sparse set of edges containing the minimum spanning tree (MST) of a random subgraph of G with high probability. The two random models that we ...
Michel X. Goemans, Jan Vondrák
APJOR
2010
118views more  APJOR 2010»
14 years 8 months ago
Alternative Randomization for Valuing American Options
This paper provides a fast and accurate randomization algorithm for valuing American puts and calls on dividend-paying stocks and their early exercise boundaries. The primal focus...
Toshikazu Kimura
ALT
2008
Springer
15 years 6 months ago
Prequential Randomness
This paper studies Dawid’s prequential framework from the point of view of the algorithmic theory of randomness. The main result is that two natural notions of randomness coincid...
Vladimir Vovk, Alexander Shen