Sciweavers

2996 search results - page 161 / 600
» Numberings and Randomness
Sort
View
153
Voted
GECCO
2004
Springer
15 years 11 months ago
The Royal Road Not Taken: A Re-examination of the Reasons for GA Failure on R1
Previous work investigating the performance of genetic algorithms (GAs) has attempted to develop a set of fitness landscapes, called “Royal Roads” functions, which should be id...
Brian Howard, John Sheppard
COCOON
2007
Springer
15 years 9 months ago
An Improved Algorithm for Online Unit Clustering
Abstract. We revisit the online unit clustering problem in one dimension which we recently introduced at WAOA'06: given a sequence of n points on the line, the objective is to...
Hamid Zarrabi-Zadeh, Timothy M. Chan
MST
2008
80views more  MST 2008»
15 years 5 months ago
A Revised Transformation Protocol for Unconditionally Secure Secret Key Exchange
Abstract The transformation protocol can allow two players to share an unconditionally secure secret key using a random deal of cards. A sufficient condition on the number of cards...
Koichi Koizumi, Takaaki Mizuki, Takao Nishizeki
ICPADS
2008
IEEE
15 years 12 months ago
Integrity-Preserving Replica Coordination for Byzantine Fault Tolerant Systems
The use of good random numbers is essential to the integrity of many mission-critical systems. However, when such systems are replicated for Byzantine fault tolerance, a serious i...
Wenbing Zhao
ICVGIP
2008
15 years 7 months ago
Fast, Processor-Cardinality Agnostic PRNG with a Tracking Application
As vision algorithms mature with increasing inspiration from the learning community, statistically independent pseudo random number generation (PRNG) becomes increasingly importan...
Andrew Janowczyk, Sharat Chandran, Srinivas Aluru