497 search results - page 61 / 100 » Approximating max-min linear programs with local algorithms |
GECCO
2008
Springer
14 years 11 months ago
2008
Springer
Based in part on observations about the incremental nature of most state changes in biological systems, we introduce the idea of Memory with Memory in Genetic Programming (GP), wh...
INFORMS
1998
14 years 9 months ago
1998
The problem of discriminating between two nite point sets in n-dimensional feature space by a separating plane that utilizes as few of the features as possible, is formulated as a...
107
click to vote
SIAMJO
2002
14 years 9 months ago
2002
Abstract. Sequential quadratic programming (SQP) methods have proved highly effective for solving constrained optimization problems with smooth nonlinear functions in the objective...
SODA
2008
ACM
14 years 11 months ago
2008
ACM
In this paper, we study an online make-to-order variant of the classical joint replenishment problem (JRP) that has been studied extensively over the years and plays a fundamental...
ICALP
2004
Springer
15 years 3 months ago
2004
Springer
Consider the classical online scheduling problem where jobs that arrive one by one are assigned to identical parallel machines with the objective of minimizing the makespan. We gen...