Sciweavers

13841 search results - page 293 / 2769
» Algorithms and Constraint Programming
Sort
View
CPAIOR
2008
Springer
15 years 8 months ago
Integrating Symmetry, Dominance, and Bound-and-Bound in a Multiple Knapsack Solver
Abstract. The multiple knapsack problem (MKP) is a classical combinatorial optimization problem. A recent algorithm for some classes of the MKP is bin-completion, a bin-oriented, b...
Alex S. Fukunaga
SIGCSE
2002
ACM
123views Education» more  SIGCSE 2002»
15 years 6 months ago
Algorithms and object-oriented programming: bridging the gap
Currently there is a serious conceptual and technical gap between ideas emphasized in object-oriented programming and ideas as taught in algorithms courses. We suggest both a para...
Paolo Bucci, Wayne D. Heym, Timothy J. Long, Bruce...
GECCO
2009
Springer
107views Optimization» more  GECCO 2009»
15 years 11 months ago
Evolving distributed algorithms with genetic programming: election
In this paper, we present a detailed analysis of the application of Genetic Programming to the evolution of distributed algorithms. This research field has many facets which make...
Thomas Weise, Michael Zapf
STOC
2004
ACM
102views Algorithms» more  STOC 2004»
16 years 7 months ago
A simple polynomial-time rescaling algorithm for solving linear programs
The perceptron algorithm, developed mainly in the machine learning literature, is a simple greedy method for finding a feasible solution to a linear program (alternatively, for le...
John Dunagan, Santosh Vempala
APPT
2007
Springer
15 years 8 months ago
A Parallel BSP Algorithm for Irregular Dynamic Programming
Dynamic programming is a widely applied algorithm design technique in many areas such as computational biology and scientific computing. Typical applications using this technique a...
Malcolm Yoke-Hean Low, Weiguo Liu, Bertil Schmidt