791 search results - page 85 / 159 » Approximating the Maximum Sharing Problem |
SIGECOM
2010
ACM
14 years 18 days ago
2010
ACM
We study the design of truthful mechanisms that do not use payments for the generalized assignment problem (GAP) and its variants. An instance of the GAP consists of a bipartite g...
NIPS
2007
13 years 9 months ago
2007
Clustering is often formulated as the maximum likelihood estimation of a mixture model that explains the data. The EM algorithm widely used to solve the resulting optimization pro...
CPM
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. In this paper we define a new similarity measure, the nonbreaking similarity, which is the complement of the famous breakpoint distance between genomes (in general, betw...
INFOCOM
2009
IEEE
14 years 2 months ago
2009
IEEE
—The paper deals with efficient distribution of timely information to flows of mobile devices. We consider the case where a set of Information Dissemination Devices (IDDs) broa...
FOCS
2007
IEEE
13 years 11 months ago
2007
IEEE
We consider the problem of minimizing average flow time on multiple machines when each job can be assigned only to a specified subset of the machines. This is a special case of sc...