5153 search results - page 108 / 1031 » Introduction to Randomized Algorithms |
108
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...
110
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 ...
128
click to vote
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...
115
click to vote
APPROX
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. The Kaczmarz method for solving linear systems of equations Ax = b is an iterative algorithm that has found many applications ranging from computer tomography to digital ...
117
click to vote
ALGORITHMICA
2010
15 years 2 months ago
2010
We consider the online version of the maximum vertex disjoint path problem when the underlying network is a tree. In this problem, a sequence of requests arrives in an online fash...