Sciweavers

58 search results - page 10 / 12
» Improved competitive ratio for the matroid secretary problem
Sort
View
ICALP
2004
Springer
13 years 11 months ago
Online Scheduling with Bounded Migration
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...
Peter Sanders, Naveen Sivadasan, Martin Skutella
SWAT
2010
Springer
282views Algorithms» more  SWAT 2010»
13 years 11 months ago
Better Bounds on Online Unit Clustering
Unit Clustering is the problem of dividing a set of points from a metric space into a minimal number of subsets such that the points in each subset are enclosable by a unit ball. W...
Martin R. Ehmsen, Kim S. Larsen
SAT
2010
Springer
172views Hardware» more  SAT 2010»
13 years 4 months ago
On the Relative Merits of Simple Local Search Methods for the MAX-SAT Problem
Algorithms based on local search are popular for solving many optimization problems including the maximum satisfiability problem (MAXSAT). With regard to MAXSAT, the state of the ...
Denis Pankratov, Allan Borodin
AAIM
2007
Springer
120views Algorithms» more  AAIM 2007»
13 years 10 months ago
Online OVSF Code Assignment with Resource Augmentation
Abstract. Orthogonal Variable Spreading Factor (OVSF) code assignment is a fundamental problem in Wideband Code-Division MultipleAccess (W-CDMA) systems, which play an important ro...
Francis Y. L. Chin, Yong Zhang, Hong Zhu
EUROMICRO
2004
IEEE
13 years 10 months ago
Handover in Mobile Communication Networks: Who is in Control Anyway?
The migration from 3rd generation mobile communication networks to 4th generation, purely IP-based networks leads to new chances, but also great risks for the traditional mobile n...
Frank A. Zdarsky, Jens B. Schmitt