Sciweavers

14165 search results - page 52 / 2833
» The generalized two-server problem
Sort
View
SODA
2012
ACM
297views Algorithms» more  SODA 2012»
13 years 4 months ago
Constant factor approximation algorithm for the knapsack median problem
We give a constant factor approximation algorithm for the following generalization of the k-median problem. We are given a set of clients and facilities in a metric space. Each fa...
Amit Kumar
SIGECOM
2011
ACM
232views ECommerce» more  SIGECOM 2011»
14 years 4 months ago
Near optimal online algorithms and fast approximation algorithms for resource allocation problems
We present algorithms for a class of resource allocation problems both in the online setting with stochastic input and in the offline setting. This class of problems contains man...
Nikhil R. Devanur, Kamal Jain, Balasubramanian Siv...
SIAMSC
2010
136views more  SIAMSC 2010»
14 years 8 months ago
A Krylov Method for the Delay Eigenvalue Problem
Abstract. The Arnoldi method is currently a very popular algorithm to solve large-scale eigenvalue problems. The main goal of this paper is to generalize the Arnoldi method to the ...
Elias Jarlebring, Karl Meerbergen, Wim Michiels
WADS
2009
Springer
298views Algorithms» more  WADS 2009»
15 years 8 months ago
A Comparison of Performance Measures for Online Algorithms
This paper provides a systematic study of several proposed measures for online algorithms in the context of a specific problem, namely, the two server problem on three colinear po...
Joan Boyar, Sandy Irani, Kim S. Larsen
JSAI
2005
Springer
15 years 7 months ago
On Generalization and Subsumption for Ordered Clauses
: In this paper, we introduce ordered clauses as defined a sequence of literals, and investigate the properties of generalizations for ordered clauses. Furthermore, we show that t...
Megumi Kuwabara, Takeshi Ogawa, Kouichi Hirata, Ma...