25 search results - page 3 / 5 » Can Approximation Circumvent Gibbard-Satterthwaite |
AAAI
2010
13 years 7 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....
COCO
2005
Springer
13 years 11 months ago
2005
Springer
We study the complexity of approximating Max NME3SAT, a variant of Max 3SAT when the instances are guaranteed to not have any mixed clauses, i.e., every clause has either all its ...
ECIR
2004
Springer
13 years 7 months ago
2004
Springer
This paper introduces a new approach to add fault-tolerance to a fulltext retrieval system. The weighted pattern morphing technique circumvents some of the disadvantages of the wid...
CDC
2008
IEEE
14 years 7 days ago
2008
IEEE
— The practical implementation of Min-Max MPC (MMMPC) controllers is limited by the computational burden required to compute the control law. This problem can be circumvented by ...
ICML
2010
IEEE
13 years 6 months ago
2010
IEEE
This paper proposes a multiple instance learning (MIL) algorithm for Gaussian processes (GP). The GP-MIL model inherits two crucial benefits from GP: (i) a principle manner of lea...