2694 search results - page 132 / 539 » Fully Distributed Algorithms for Convex Optimization Problem... |
144
click to vote
IAT
2007
IEEE
15 years 11 months ago
2007
IEEE
We present a new hybrid algorithm for local search in distributed combinatorial optimization. This method is a mix between classical local search methods in which nodes take decis...
159
click to vote
PPSN
1992
Springer
15 years 9 months ago
1992
Springer
In this paper, we describe the application of a new type of genetic algorithm called the Structured Genetic Algorithm (sGA) for function optimization in nonstationary environments...
128
click to vote
PDPTA
2007
15 years 6 months ago
2007
Abstract In this paper we investigate the composition of cheap network storage resources to meet specific availability and capacity requirements. We show that the problem of find...
143
click to vote
DAM
2007
15 years 4 months ago
2007
Given A := {a1, . . . , am} ⊂ Rd whose affine hull is Rd, we study the problems of computing an approximate rounding of the convex hull of A and an approximation to the minimum ...
138
click to vote
GECCO
2005
Springer
15 years 10 months ago
2005
Springer
Like Darwinian-type genetic algorithms, there also exists genetic drift in Univariate Marginal Distribution Algorithm (UMDA). Since the universal analysis of genetic drift in UMDA...