603 search results - page 84 / 121 » A General Approximation Technique for Constrained Forest Pro... |
114
click to vote
APPROX
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. Scheduling jobs on unrelated parallel machines so as to minimize the makespan is one of the basic, well-studied problems in the area of machine scheduling. In the first ...
JGO
2010
14 years 6 months ago
2010
The best known method to find exact or at least -approximate solutions to polynomial programming problems is the spatial Branch-and-Bound algorithm, which rests on computing lower...
100
click to vote
GECCO
2006
Springer
15 years 3 months ago
2006
Springer
We propose a hybrid algorithm (called ALPINE) between Genetic Algorithm and Dantzig's Simplex method to approximate optimal solutions for the Flexible Job-Shop Problem. Local...
103
click to vote
GECCO
2007
Springer
15 years 6 months ago
2007
Springer
Transgenetic algorithms are evolutionary computing techniques based on living processes where cooperation is the main evolutionary strategy. Those processes contain the movement o...
ISNN
2007
Springer
15 years 6 months ago
2007
Springer
Normal fuzzy CMAC neural network performs well because of its fast learning speed and local generalization capability for approximating nonlinear functions. However, it requires hu...