84 search results - page 17 / 17 » Combinatorial Optimization Solutions for the Maximum Quartet... |
SIGECOM
2010
ACM
13 years 10 months 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...
AAAI
2010
13 years 6 months ago
2010
We consider approval voting elections in which each voter votes for a (possibly empty) set of candidates and the outcome consists of a set of k candidates for some parameter k, e....
CN
2007
13 years 5 months ago
2007
We present a mechanism for auctioning bandwidth on a network-wide basis to end users or ISPs that will utilize it for the same time period. This mechanism consists of a set of sim...
ICONIP
2007
13 years 6 months ago
2007
In this paper we eliminate the need for parameter estimation associated with the set covering machine (SCM) by directly minimizing generalization error bounds. Firstly, we consider...