Sciweavers

1279 search results - page 67 / 256
» Approximation Algorithms for Min-Max Generalization Problems
Sort
View
ECRTS
2004
IEEE
14 years 15 days ago
An Event Stream Driven Approximation for the Analysis of Real-Time Systems
This paper presents a new approach to understand the event stream model. Additionally a new approximation algorithm for the feasibility test of the sporadic and the generalized mu...
Karsten Albers, Frank Slomka
TIT
2010
115views Education» more  TIT 2010»
13 years 3 months ago
On resource allocation in fading multiple-access channels-an efficient approximate projection approach
We consider the problem of rate and power allocation in a multiple-access channel. Our objective is to obtain rate and power allocation policies that maximize a general concave ut...
Ali ParandehGheibi, Atilla Eryilmaz, Asuman E. Ozd...
SIGECOM
2005
ACM
105views ECommerce» more  SIGECOM 2005»
14 years 2 months ago
Towards truthful mechanisms for binary demand games: a general framework
The family of Vickrey-Clarke-Groves (VCG) mechanisms is arguably the most celebrated achievement in truthful mechanism design. However, VCG mechanisms have their limitations. They...
Ming-Yang Kao, Xiang-Yang Li, Weizhao Wang
STOC
2007
ACM
100views Algorithms» more  STOC 2007»
14 years 9 months ago
Reordering buffers for general metric spaces
In the reordering buffer problem, we are given an input sequence of requests for service each of which corresponds to a point in a metric space. The cost of serving the requests h...
Matthias Englert, Harald Räcke, Matthias West...
ICDM
2007
IEEE
124views Data Mining» more  ICDM 2007»
14 years 3 months ago
Community Learning by Graph Approximation
Learning communities from a graph is an important problem in many domains. Different types of communities can be generalized as link-pattern based communities. In this paper, we p...
Bo Long, Xiaoyun Xu, Zhongfei (Mark) Zhang, Philip...