Sciweavers

309 search results - page 44 / 62
» Approximation algorithms for dynamic resource allocation
Sort
View
VLDB
2008
ACM
147views Database» more  VLDB 2008»
14 years 8 months ago
Tree-based partition querying: a methodology for computing medoids in large spatial datasets
Besides traditional domains (e.g., resource allocation, data mining applications), algorithms for medoid computation and related problems will play an important role in numerous e...
Kyriakos Mouratidis, Dimitris Papadias, Spiros Pap...
IWCMC
2010
ACM
13 years 5 months ago
Dynamic load balancing and throughput optimization in 3GPP LTE networks
Load imbalance that deteriorates the system performance is a severe problem existing in 3GPP LTE networks. To deal with this problem, we propose in this paper a load balancing fra...
Hao Wang, Lianghui Ding, Ping Wu, Zhiwen Pan, Nan ...
AICT
2008
IEEE
13 years 10 months ago
Towards Efficient Service Placement and Server Selection for Large-Scale Deployments
Currently many service providers offer their services using a private and proprietary hard- and software infrastructure. These infrastructures often share many similarities. Hence...
Jeroen Famaey, Tim Wauters, Filip De Turck, Bart D...
INFOCOM
2003
IEEE
14 years 1 months ago
Distributed Admission Control to Support Guaranteed Services in Core-Stateless Networks
— The core-stateless service architecture alleviates the scalability problems of the integrated service framework while maintaining its guaranteed service semantics. The admissio...
Sudeept Bhatnagar, B. R. Badrinath
ADC
2007
Springer
145views Database» more  ADC 2007»
14 years 2 months ago
Selectivity Estimation by Batch-Query based Histogram and Parametric Method
Histograms are used extensively for selectivity estimation and approximate query processing. Workloadaware dynamic histograms can self-tune itself based on query feedback without ...
Jizhou Luo, Xiaofang Zhou, Yu Zhang, Heng Tao Shen...