Sciweavers

1618 search results - page 71 / 324
» Testing random number generators
Sort
View
IACR
2011
113views more  IACR 2011»
14 years 5 months ago
KISS: A Bit Too Simple
KISS (‘Keep it Simple Stupid’) is an efficient pseudo-random number generator originally specified by G. Marsaglia and A. Zaman in 1993. G. Marsaglia in 1998 posted a C versio...
Greg Rose
EOR
2010
113views more  EOR 2010»
15 years 3 months ago
Combining integer programming and the randomization method to schedule employees
: We describe a method to find low cost shift schedules with a time-varying service level that is always above a specified minimum. Most previous approaches used a two-step procedu...
Armann Ingolfsson, Fernanda Campello, Xudong Wu, E...
APPROX
2005
Springer
84views Algorithms» more  APPROX 2005»
15 years 11 months ago
The Tensor Product of Two Codes Is Not Necessarily Robustly Testable
There has been significant interest lately in the task of constructing codes that are testable with a small number of random probes. Ben-Sasson and Sudan show that the repeated te...
Paul Valiant
ICANNGA
2007
Springer
161views Algorithms» more  ICANNGA 2007»
15 years 10 months ago
Evolutionary Induction of Decision Trees for Misclassification Cost Minimization
Abstract. In the paper, a new method of decision tree learning for costsensitive classification is presented. In contrast to the traditional greedy top-down inducer in the proposed...
Marek Kretowski, Marek Grzes
CAI
2004
Springer
15 years 6 months ago
An Evolvable Combinational Unit for FPGAs
A complete hardware implementation of an evolvable combinational unit for FPGAs is presented. The proposed combinational unit consisting of a virtual reconfigurable circuit and evo...
Lukás Sekanina, Stepan Friedl