2899 search results - page 15 / 580 » On the Complexity of Exclusion Algorithms for Optimization |
114
click to vote
COLOGNETWENTE
2010
14 years 12 months ago
2010
In this paper we analyze O’Hara’s partition bijection. We present three type of results. First, we show that O’Hara’s bijection can be viewed geometrically as a certain sci...
138
click to vote
EC
2008
15 years 24 days ago
2008
We consider an optimization problem of finding the best possible offspring as a result of a recombination operator in an evolutionary algorithm, given two parent solutions. The op...
152
click to vote
STOC
2012
ACM
13 years 3 months ago
2012
ACM
We consider submodular optimization problems, and provide a general way of translating oracle inapproximability results arising from the symmetry gap technique to computational co...
GECCO
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. We present upper bounds on the time and space complexity of finding the global optimum of additively separable functions, a class of functions that has been studied exten...
MOR
2002
15 years 28 days ago
2002
ngly better objective function value until an optimal solution is reached. From an abstract point of view, an augmentation problem is solved in each iteration. That is, given a fea...