Sciweavers

438 search results - page 52 / 88
» A (1-1 e)-approximation algorithm for the generalized assign...
Sort
View
GECCO
2010
Springer
187views Optimization» more  GECCO 2010»
14 years 19 days ago
The maximum hypervolume set yields near-optimal approximation
In order to allow a comparison of (otherwise incomparable) sets, many evolutionary multiobjective optimizers use indicator functions to guide the search and to evaluate the perfor...
Karl Bringmann, Tobias Friedrich
APPROX
2009
Springer
163views Algorithms» more  APPROX 2009»
14 years 2 months ago
The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders
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 ...
José R. Correa, Martin Skutella, José...
ICALP
2003
Springer
14 years 1 months ago
Online Load Balancing Made Simple: Greedy Strikes Back
We provide a new simpler approach to the on-line load balancing problem in the case of restricted assignment of temporary weighted tasks. The approach is very general and allows to...
Pierluigi Crescenzi, Giorgio Gambosi, Gaia Nicosia...
FOCS
2002
IEEE
14 years 23 days ago
Linear Diophantine Equations over Polynomials and Soft Decoding of Reed-Solomon Codes
Abstract—This paper generalizes the classical Knuth–Schönhage algorithm computing the greatest common divisor (gcd) of two polynomials for solving arbitrary linear Diophantine...
Michael Alekhnovich
ISLPED
2005
ACM
178views Hardware» more  ISLPED 2005»
14 years 1 months ago
Energy efficient strategies for deployment of a two-level wireless sensor network
We investigate and develop energy-efficient strategies for deployment of wireless sensor networks (WSN) for the purpose of monitoring some phenomenon of interest in a coverage reg...
Ali Iranli, Morteza Maleki, Massoud Pedram