Sciweavers

387 search results - page 19 / 78
» Many Random Walks Are Faster Than One
Sort
View
FSE
2005
Springer
108views Cryptology» more  FSE 2005»
14 years 2 months ago
Unbiased Random Sequences from Quasigroup String Transformations
Abstract. The need of true random number generators for many purposes (ranging from applications in cryptography and stochastic simulation, to search heuristics and game playing) i...
Smile Markovski, Danilo Gligoroski, Ljupco Kocarev
FPGA
2008
ACM
191views FPGA» more  FPGA 2008»
13 years 10 months ago
A hardware framework for the fast generation of multiple long-period random number streams
Stochastic simulations and other scientific applications that depend on random numbers are increasingly implemented in a parallelized manner in programmable logic. High-quality ps...
Ishaan L. Dalal, Deian Stefan
DAM
2006
89views more  DAM 2006»
13 years 9 months ago
First vs. best improvement: An empirical study
When applying the 2-opt heuristic to the travelling salesman problem, selecting the best improvement at each iteration gives worse results on average than selecting the first impr...
Pierre Hansen, Nenad Mladenovic
FSE
2006
Springer
174views Cryptology» more  FSE 2006»
14 years 20 days ago
Distinguishing Attacks on the Stream Cipher Py
The stream cipher Py designed by Biham and Seberry is a submission to the ECRYPT stream cipher competition. The cipher is based on two large arrays (one is 256 bytes and the other ...
Souradyuti Paul, Bart Preneel, Gautham Sekar
ICPR
2004
IEEE
14 years 10 months ago
Large Scale Feature Selection Using Modified Random Mutation Hill Climbing
Feature selection is a critical component of many pattern recognition applications. There are two distinct mechanisms for feature selection, namely the wrapper method and the filt...
Anil K. Jain, Michael E. Farmer, Shweta Bapna