303 search results - page 49 / 61 » Incentive analysis of approximately efficient allocation alg... |
COMPGEOM
2008
ACM
13 years 9 months ago
2008
ACM
We consider the problem of finding a maximum number of disjoint paths for unit disks moving amidst static or dynamic obstacles. For the static case we give efficient exact algorit...
ESA
2010
Springer
13 years 8 months ago
2010
Springer
In a Content Distribution Network application, we have a set of servers and a set of clients to be connected to the servers. Often there are a few server types and a hard budget co...
SIGGRAPH
1994
ACM
13 years 11 months ago
1994
ACM
In this paper we discuss the efficient and accurate incorporation of texture maps into a hierarchical Galerkin radiosity algorithm. This extension of the standard algorithm allows...
SIGMOD
2008
ACM
14 years 7 months ago
2008
ACM
Computing statistical information on probabilistic data has attracted a lot of attention recently, as the data generated from a wide range of data sources are inherently fuzzy or ...
STOC
2004
ACM
14 years 7 months ago
2004
ACM
Recently, approximation analysis has been extensively used to study algorithms for routing weighted packets in various network settings. Although different techniques were applied...