5115 search results - page 25 / 1023 » On Randomized Lanczos Algorithms |
104
Voted
GECCO
2005
Springer
15 years 8 months ago
2005
Springer
In this work we provide empirical evidence that shows how a variable-length genetic algorithm (GA) can naturally evolve shorter average size populations. This reduction in chromos...
98
Voted
TSP
2008
15 years 2 months ago
2008
Abstract-- Simple and efficient computational algorithms for nonparametric wavelet-based identification of nonlinearities in Hammerstein systems driven by random signals are propos...
110
click to vote
TCS
1998
15 years 2 months ago
1998
Results on random oracles typically involve showing that a class {X : P(X)} has Lebesgue measure one, i.e., that some property P(X) holds for “almost every X.” A potentially m...
SPDP
1991
IEEE
15 years 5 months ago
1991
IEEE
In this paper, we present a randomized algorithm for the multipacket (i.e., k − k) routing problem on an n × n mesh. The algorithm completes with high probability in at the mos...
117
click to vote
STOC
1991
ACM
15 years 5 months ago
1991
ACM
In this paper, we prove lower bounds on the competitive ratio of randomized algorithms for two on-line problems: the k-server problem, suggested by [MMS], and an on-line motion-pl...