Sciweavers

4430 search results - page 571 / 886
» Solving Optimization Problems with DLL
Sort
View
ALGORITHMICA
2006
94views more  ALGORITHMICA 2006»
15 years 6 months ago
Efficient Algorithms for k Maximum Sums
We study the problem of computing the k maximum sum subsequences. Given a sequence of real numbers x1, x2, . . . , xn and an integer parameter k, 1 k 1 2 n(n - 1), the problem in...
Fredrik Bengtsson, Jingsen Chen
ISAAC
2009
Springer
132views Algorithms» more  ISAAC 2009»
16 years 1 months ago
Online Sorted Range Reporting
Abstract. We study the following one-dimensional range reporting problem: On an array A of n elements, support queries that given two indices i ≤ j and an integer k report the k ...
Gerth Stølting Brodal, Rolf Fagerberg, Mark...
EUROGP
2007
Springer
135views Optimization» more  EUROGP 2007»
16 years 28 days ago
A Grammatical Genetic Programming Approach to Modularity in Genetic Algorithms
The ability of Genetic Programming to scale to problems of increasing difficulty operates on the premise that it is possible to capture regularities that exist in a problem environ...
Erik Hemberg, Conor Gilligan, Michael O'Neill, Ant...
166
Voted
GECCO
2007
Springer
137views Optimization» more  GECCO 2007»
16 years 28 days ago
Extended probe method for linkage discovery over high-cardinality alphabets
The work addresses the problem of identifying the epistatic linkage of a function from high cardinality alphabets to the real numbers. It is a generalization of Heckendorn and Wri...
Shude Zhou, Zengqi Sun, Robert B. Heckendorn
GECCO
2007
Springer
154views Optimization» more  GECCO 2007»
16 years 28 days ago
Finding critical backbone structures with genetic algorithms
This paper introduces the concept of a critical backbone as a minimal set of variables or part of the solution necessary to be within the basin of attraction of the global optimum...
Adam Prügel-Bennett