1612 search results - page 68 / 323 » Analysing Randomized Distributed Algorithms |
GECCO
2007
Springer
15 years 8 months ago
2007
Springer
This paper analyzes the behavior of a selectorecombinative genetic algorithm (GA) with an ideal crossover on a class of random additively decomposable problems (rADPs). Specifical...
100
click to vote
CSR
2007
Springer
15 years 8 months ago
2007
Springer
Consider a family of sets and a single set, called query set. How can one quickly find a member of the family which has a maximal intersection with the query set? Strict time cons...
107
Voted
CORR
2010
Springer
15 years 2 months ago
2010
Springer
Consider a family of sets and a single set, called the query set. How can one quickly find a member of the family which has a maximal intersection with the query set? Time constra...
108
click to vote
FOCS
2007
IEEE
15 years 8 months ago
2007
IEEE
Consider a collection of random variables attached to the vertices of a graph. The reconstruction problem requires to estimate one of them given ‘far away’ observations. Sever...
107
click to vote
GECCO
2005
Springer
15 years 7 months ago
2005
Springer
Estimation of distribution algorithms (EDAs) try to solve an optimization problem by finding a probability distribution focussed around its optima. For this purpose they conduct ...