Sciweavers

112 search results - page 14 / 23
» Bi-objective Optimization: An Online Algorithm for Job Assig...
Sort
View
GECCO
2006
Springer
170views Optimization» more  GECCO 2006»
14 years 7 days ago
Combining simplex with niche-based evolutionary computation for job-shop scheduling
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...
Syhlin Kuah, Joc Cing Tay
WDAG
2007
Springer
86views Algorithms» more  WDAG 2007»
14 years 2 months ago
Optimal On-Line Colorings for Minimizing the Number of ADMs in Optical Networks
We consider the problem of minimizing the number of ADMs in optical networks. All previous theoretical studies of this problem dealt with the off-line case, where all the lightpat...
Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks
ESA
2006
Springer
131views Algorithms» more  ESA 2006»
14 years 7 days ago
Finding Total Unimodularity in Optimization Problems Solved by Linear Programs
A popular approach in combinatorial optimization is to model problems as integer linear programs. Ideally, the relaxed linear program would have only integer solutions, which happ...
Christoph Dürr, Mathilde Hurand
JCO
2008
66views more  JCO 2008»
13 years 8 months ago
The hierarchical model for load balancing on two machines
Following previous work, we consider the hierarchical load balancing model on two machines of possibly different speeds. We first focus on maximizing the minimum machine load and ...
Orion Chassid, Leah Epstein
ASPDAC
2005
ACM
98views Hardware» more  ASPDAC 2005»
13 years 10 months ago
Online hardware/software partitioning in networked embedded systems
Abstract— Today’s embedded systems are typically distributed and more often confronted with timevarying demands. Existing methodologies that optimize the partitioning of comput...
Thilo Streichert, Christian Haubelt, Jürgen T...