Sciweavers

5580 search results - page 103 / 1116
» Randomized priority algorithms
Sort
View
FSE
2007
Springer
263views Cryptology» more  FSE 2007»
15 years 4 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
DAGM
1995
Springer
15 years 1 months ago
Primary Image Segmentation
: This paper introduces the notion of primary image segmentation which serves as a well defined link between low- and high-level image analysis. A general algorithmic framework bas...
Ullrich Köthe
CEC
2005
IEEE
14 years 12 months ago
Heterogeneous multiprocessor scheduling with differential evolution
The problem of scheduling a parallel program given by a Directed Acyclic Graph (DAG) of tasks is a well-studied area. We present a new approach which employs Differential Evolution...
Krzysztof Rzadca, Franciszek Seredynski
COMBINATORICS
2006
92views more  COMBINATORICS 2006»
14 years 10 months ago
Equitable Matroids
One way to choose a basis of a matroid at random is to choose an ordering of the ground set uniformly at random and then use the greedy algorithm to find a basis. We investigate t...
Dillon Mayhew
ISAAC
2009
Springer
150views Algorithms» more  ISAAC 2009»
15 years 4 months ago
Random Generation and Enumeration of Bipartite Permutation Graphs
Connected bipartite permutation graphs without vertex labels are investigated. First, the number of connected bipartite permutation graphs of n vertices is given. Based on the num...
Toshiki Saitoh, Yota Otachi, Katsuhisa Yamanaka, R...