2520 search results - page 392 / 504 » The complexity of approximating entropy |
161
click to vote
CEC
2008
IEEE
15 years 10 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...
123
click to vote
CEC
2008
IEEE
15 years 10 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...
159
click to vote
FOCS
2008
IEEE
15 years 10 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 ...
110
click to vote
GLOBECOM
2008
IEEE
15 years 10 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...
147
click to vote
GLOBECOM
2008
IEEE
15 years 10 months ago
2008
IEEE
— This paper develops a mechanism for detecting session hijacking attacks in wireless networks. The proposed scheme is based on detecting abrupt changes in the strength of the re...