1429 search results - page 189 / 286 » The Complexity of the Approximation of the Bandwidth Problem |
FOCS
2008
IEEE
14 years 3 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 ...
GLOBECOM
2008
IEEE
14 years 3 months ago
2008
IEEE
—The problem of maximizing the sum of the transmit rates while limiting the outage probability below an appropriate threshold is investigated for networks where the nodes have li...
HICSS
2007
IEEE
14 years 3 months ago
2007
IEEE
One of the main contributions of classical mechanism design is the derivation of the Groves mechanisms. The class of Groves mechanisms are the only mechanisms that are strategy-pr...
SASO
2007
IEEE
14 years 3 months ago
2007
IEEE
Multi-agent systems (MAS) provide a promising technology for addressing problems such as search and rescue missions, mine sweeping, and surveillance. These problems are a form of ...
INFOCOM
2006
IEEE
14 years 3 months ago
2006
IEEE
— Trade-off curves for the exact and the relaxed QoS routing problem are presented and discussed. In addition, an efficient parametric linear programming algorithm to compute th...