5115 search results - page 101 / 1023 » On Randomized Lanczos Algorithms |
135
Voted
ESA
2008
Springer
15 years 4 months ago
2008
Springer
For several NP-hard network design problems, the best known approximation algorithms are remarkably simple randomized algorithms called Sample-Augment algorithms in [11]. The algor...
103
Voted
STOC
2003
ACM
16 years 2 months ago
2003
ACM
In this paper, we present the first average-case analysis proving an expected polynomial running time for an exact algorithm for the 0/1 knapsack problem. In particular, we prove,...
109
click to vote
VTC
2006
IEEE
15 years 8 months ago
2006
IEEE
— In this paper, a semi-analytical approach for the performance analysis of the random time slot (TS) hopping (RTSH) algorithm applied to code division multiple access time divis...
111
Voted
GECCO
2005
Springer
15 years 8 months ago
2005
Springer
We present discrete stochastic mathematical models for the growth curves of synchronous and asynchronous evolutionary algorithms with populations structured according to a random ...
130
Voted
AOSD
2007
ACM
15 years 6 months ago
2007
ACM
Inspired by our past manual aspect mining experiences, this paper describes a random walk model to approximate how crosscutting concerns can be discovered in the absence of domain...