796 search results - page 26 / 160 » Approximating the centroid is hard |
FOCS
2008
IEEE
14 years 2 months ago
2008
IEEE
The central problem in computational mechanism design is the tension between incentive compatibility and computational ef ciency. We establish the rst significant approximability ...
GECCO
2007
Springer
14 years 1 months ago
2007
Springer
In this paper, we propose the combination of different optimization techniques in order to solve “hard” two- and threeobjective optimization problems at a relatively low comp...
SIGECOM
2005
ACM
14 years 1 months ago
2005
ACM
We address the problem of lowering the buyer’s expected payments in shortest path auctions, where the buyer’s goal is to purchase a path in a graph in which edges are owned by...
STOC
2007
ACM
14 years 7 months ago
2007
ACM
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...
ICC
2009
IEEE
2009
IEEE
Iterative Detection and Decoding for Hard-Decision Forwarding Aided Cooperative Spatial Multiplexing
14 years 2 months ago
— In this paper, 1 the optimal decoding strategy for cooperative spatial multiplexing (CSM) aided systems is derived. In CSM systems, the multiple relay stations (RSs), which com...