Sciweavers

2566 search results - page 18 / 514
» The Online Median Problem
Sort
View
ECAI
1994
Springer
13 years 11 months ago
The SAT Phase Transition
We describe a detailed experimental investigation of the phase transition for several different classes of randomly generated satisfiability problems. We observe a remarkable consi...
Ian P. Gent, Toby Walsh
ESA
2005
Springer
125views Algorithms» more  ESA 2005»
14 years 1 months ago
Online Primal-Dual Algorithms for Covering and Packing Problems
We study a wide range of online covering and packing optimization problems. In an online covering problem a linear cost function is known in advance, but the linear constraints th...
Niv Buchbinder, Joseph Naor
ICALP
2000
Springer
13 years 11 months ago
Optimal Projective Algorithms for the List Update Problem
The list update problem is a classical online problem, with an optimal competi
Christoph Ambühl, Bernd Gärtner, Bernhar...
ESA
2008
Springer
80views Algorithms» more  ESA 2008»
13 years 9 months ago
Randomized Competitive Analysis for Two-Server Problems
We prove that there exits a randomized online algorithm for the 2-server 3-point problem whose
Wolfgang W. Bein, Kazuo Iwama, Jun Kawahara
MST
2008
157views more  MST 2008»
13 years 7 months ago
Optimal On-Line Algorithms to Minimize Makespan on Two Machines with Resource Augmentation
We study the problem of on-line scheduling on two uniformly related machines where the on-line algorithm has resources different from those of the off-line algorithm. We consider ...
Leah Epstein, Arik Ganot