Sciweavers

256 search results - page 34 / 52
» Comparison of Heuristic and Optimal Subcarrier Assignment Al...
Sort
View
MP
2002
85views more  MP 2002»
13 years 8 months ago
From fluid relaxations to practical algorithms for job shop scheduling: the makespan objective
We design an algorithm, called the fluid synchronization algorithm (FSA), for the job shop scheduling problem with the objective of minimizing the makespan. We round an optimal sol...
Dimitris Bertsimas, Jay Sethuraman
GECCO
2007
Springer
144views Optimization» more  GECCO 2007»
14 years 17 days ago
Multiobjective network design for realistic traffic models
Network topology design problems find application in several real life scenarios. However, most designs in the past either optimize for a single criterion like delay or assume sim...
Nilanjan Banerjee, Rajeev Kumar
DPD
2002
168views more  DPD 2002»
13 years 8 months ago
Evolutionary Algorithms for Allocating Data in Distributed Database Systems
A major cost in executing queries in a distributed database system is the data transfer cost incurred in transferring relations (fragments) accessed by a query from different sites...
Ishfaq Ahmad, Kamalakar Karlapalem, Yu-Kwong Kwok,...
EVOW
2007
Springer
14 years 2 months ago
A Probabilistic Beam Search Approach to the Shortest Common Supersequence Problem
The Shortest Common Supersequence Problem (SCSP) is a well-known hard combinatorial optimization problem that formalizes many real world problems. This paper presents a novel rando...
Christian Blum, Carlos Cotta, Antonio J. Fern&aacu...
INFOCOM
2007
IEEE
14 years 3 months ago
Towards Topology Aware Networks
— We focus on efficient protocols that enhance a network with topology awareness. We discuss centralized algorithms with provable performance, and introduce decentralized asynch...
Christos Gkantsidis, Gagan Goel, Milena Mihail, Am...