Sciweavers

4432 search results - page 568 / 887
» Solving Demodulation as an Optimization Problem
Sort
View
ISAAC
2009
Springer
132views Algorithms» more  ISAAC 2009»
15 years 10 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»
15 years 9 months 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...
GECCO
2007
Springer
137views Optimization» more  GECCO 2007»
15 years 9 months 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»
15 years 9 months 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
116
Voted
ISAAC
2004
Springer
115views Algorithms» more  ISAAC 2004»
15 years 8 months ago
Multicriteria Global Minimum Cuts
We consider two multicriteria versions of the global minimum cut problem in undirected graphs. In the k-criteria setting, each edge of the input graph has k non-negative costs ass...
Amitai Armon, Uri Zwick