Sciweavers

730 search results - page 87 / 146
» Combinatorics of Monotone Computations
Sort
View
COCOON
2007
Springer
14 years 1 months ago
Priority Algorithms for the Subset-Sum Problem
Greedy algorithms are simple, but their relative power is not well understood. The priority framework [5] captures a key notion of “greediness” in the sense that it processes (...
Yuli Ye, Allan Borodin
COCOON
2007
Springer
14 years 1 months ago
"Resistant" Polynomials and Stronger Lower Bounds for Depth-Three Arithmetical Formulas
We derive quadratic lower bounds on the ∗-complexity of sum-of-products-of-sums (ΣΠΣ) formulas for classes of polynomials f that have too few partial derivatives for the techn...
Maurice J. Jansen, Kenneth W. Regan
GECCO
2006
Springer
161views Optimization» more  GECCO 2006»
13 years 11 months ago
Instance similarity and the effectiveness of case injection in a genetic algorithm for binary quadratic programming
When an evolutionary algorithm addresses a sequence of instances of the same problem, it can seed its population with solutions that it found for previous instances. This techniqu...
Jason Amunrud, Bryant A. Julstrom
GECCO
2006
Springer
282views Optimization» more  GECCO 2006»
13 years 11 months ago
A genetic algorithm for the longest common subsequence problem
A genetic algorithm for the longest common subsequence problem encodes candidate sequences as binary strings that indicate subsequences of the shortest or first string. Its fitnes...
Brenda Hinkemeyer, Bryant A. Julstrom
DCG
2010
77views more  DCG 2010»
13 years 7 months ago
Oriented Mixed Area and Discrete Minimal Surfaces
Abstract. Recently a curvature theory for polyhedral surfaces has been established which associates with each face a mean curvature value computed from areas and mixed areas of tha...
Christian Müller, Johannes Wallner