Sciweavers

4526 search results - page 51 / 906
» Algorithmic problems related to the Internet
Sort
View
WINE
2010
Springer
189views Economy» more  WINE 2010»
13 years 6 months ago
Approximation Algorithms for Non-single-minded Profit-Maximization Problems with Limited Supply
We consider profit-maximization problems for combinatorial auctions with non-single minded valuation functions and limited supply. We obtain fairly general results that relate the ...
Khaled M. Elbassioni, Mahmoud Fouz, Chaitanya Swam...
CPM
2000
Springer
160views Combinatorics» more  CPM 2000»
14 years 1 months ago
Approximation Algorithms for Hamming Clustering Problems
We study Hamming versions of two classical clustering problems. The Hamming radius p-clustering problem (HRC) for a set S of k binary strings, each of length n, is to find p bina...
Leszek Gasieniec, Jesper Jansson, Andrzej Lingas
GLOBECOM
2009
IEEE
14 years 17 days ago
Internet Service Tiering as a Market Segmentation Strategy
We consider Internet broadband access as an elastic service whose value varies across segments of the user population. We show that introducing multiple tiers of service can be an ...
Qian Lv, George N. Rouskas
WWW
2005
ACM
14 years 9 months ago
Migrating web application sessions in mobile computing
The capability to change user agent while working is starting to appear in state of the art mobile computing due to the proliferation of different kinds of devices, ranging from p...
Gerardo Canfora, Giuseppe Di Santo, Gabriele Ventu...
WWW
2001
ACM
14 years 9 months ago
A unified constraint model for XML
Integrity constraints are an essential part of a modern schema definition language. They are useful for semantic specification, update consistency control, query optimization, inf...
Gabriel M. Kuper, Jérôme Siméo...