2168 search results - page 354 / 434 » Randomized Algorithms and Complexity Theory |
144
click to vote
STOC
2010
ACM
15 years 8 months ago
2010
ACM
In this paper we investigate distributed computation in dynamic networks in which the network topology changes from round to round. We consider a worst-case model in which the com...
137
click to vote
SIGECOM
2010
ACM
15 years 7 months ago
2010
ACM
One of the fundamental problems in the theory of social choice is aggregating the rankings of a set of agents (or voters) into a consensus ranking. Rank aggregation has found appl...
127
click to vote
GECCO
2010
Springer
15 years 7 months ago
2010
Springer
In order to allow a comparison of (otherwise incomparable) sets, many evolutionary multiobjective optimizers use indicator functions to guide the search and to evaluate the perfor...
111
click to vote
GECCO
2006
Springer
15 years 6 months ago
2006
Springer
The use of genotypic populations is necessary for adaptation in Evolutionary Algorithms. We use a technique called form-invariant commutation to study the immediate effect of evol...
123
click to vote
RIVF
2007
15 years 4 months ago
2007
— This paper investigates the problem of secret key transmissions for an arbitrary Alice-Bob pair in Quantum Key Distribution (QKD)-based networks. We develop a realistic QKDbase...