2957 search results - page 481 / 592 » The Complexity of Polynomial-Time Approximation |
CDC
2008
IEEE
14 years 2 months ago
2008
IEEE
— Leveraging research by psychologists on human decision-making, we present a human-robot decision-making problem associated with a complex task and study the corresponding joint...
CEC
2008
IEEE
14 years 2 months ago
2008
IEEE
—Ant Colony Optimization (ACO) algorithm is a novel meta-heuristic algorithm for the approximate solution of combinatorial optimization problems that has been inspired by the for...
CEC
2008
IEEE
14 years 2 months ago
2008
IEEE
—This paper reviews the different gradient-based schemes and the sources of gradient, their availability, precision and computational complexity, and explores the benefits of usi...
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 ...
GLOBECOM
2008
IEEE
14 years 2 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...