3875 search results - page 740 / 775 » Approximation algorithms for the 0-extension problem |
MOBIQUITOUS
2007
IEEE
15 years 3 months ago
2007
IEEE
— The dynamic nature of mobile ad hoc networks poses fundamental challenges to the design of service composition schemes that can minimize the effect of service disruptions. Alth...
74
Voted
INFOCOM
2002
IEEE
15 years 2 months ago
2002
IEEE
Abstract—In this paper we consider the downlink power allocation problem for multi-class CDMA wireless networks. We use a utility based power allocation framework to treat multi-...
SIGECOM
2010
ACM
15 years 2 months ago
2010
ACM
One of the fundamental problems in the theory of social choice is aggregating the rankings of a set of agents (or voters) into a consensus ranking. Rank aggregation has found appl...
SIGMOD
2010
ACM
15 years 2 months ago
2010
ACM
The K-Nearest Neighbor search (kNN) problem has been investigated extensively in the past due to its broad range of applications. In this paper we study this problem in the contex...
IM
2007
14 years 11 months ago
2007
— We consider whether the off-line compilation of a set of Service Level Agreements (SLAs) into low-level management policies can lead to the runtime maximization of the overall ...