Sciweavers

5580 search results - page 203 / 1116
» Randomized priority algorithms
Sort
View
ISAAC
1994
Springer
80views Algorithms» more  ISAAC 1994»
15 years 6 months ago
Unifying Themes for Network Selection
In this paper we present efficient deterministic and randomized algorithms for selection on any interconnection network when the number of input keys (n) is the number of processo...
Sanguthevar Rajasekaran, Wang Chen, Shibu Yooseph
LATIN
2004
Springer
15 years 7 months ago
Embracing the Giant Component
Consider a game in which edges of a graph are provided a pair at a time, and the player selects one edge from each pair, attempting to construct a graph with a component as large ...
Abraham Flaxman, David Gamarnik, Gregory B. Sorkin
ALT
2006
Springer
15 years 11 months ago
Teaching Memoryless Randomized Learners Without Feedback
The present paper mainly studies the expected teaching time of memoryless randomized learners without feedback. First, a characterization of optimal randomized learners is provided...
Frank J. Balbach, Thomas Zeugmann
ICANN
2009
Springer
15 years 9 months ago
Almost Random Projection Machine
Backpropagation of errors is not only hard to justify from biological perspective but also it fails to solve problems requiring complex logic. A simpler algorithm based on generati...
Wlodzislaw Duch, Tomasz Maszczyk
VTS
2005
IEEE
102views Hardware» more  VTS 2005»
15 years 8 months ago
An Efficient Random Jitter Measurement Technique Using Fast Comparator Sampling
This paper describes a random jitter measurement technique using simple algorithms and comparator sampling. The approach facilitates using Automated Test Equipment (ATE) to valida...
Dongwoo Hong, Cameron Dryden, Gordon Saksena