1429 search results - page 55 / 286 » The Complexity of the Approximation of the Bandwidth Problem |
SIGPRO
2011
14 years 4 months ago
2011
In this paper, we survey and compare different algorithms that, given an overcomplete dictionary of elementary functions, solve the problem of simultaneous sparse signal approxim...
AGI
2008
14 years 11 months ago
2008
Universal induction solves in principle the problem of choosing a prior to achieve optimal inductive inference. The AIXI theory, which combines control theory and universal induct...
MOBICOM
2004
ACM
15 years 3 months ago
2004
ACM
—The traffic load of wireless LANs is often unevenly distributed among the access points (APs), which results in unfair bandwidth allocation among users. We argue that the load ...
COR
2008
14 years 10 months ago
2008
: The paper presents results on the runtime complexity of two ant colony optimization (ACO) algorithms: Ant System, the oldest ACO variant, and GBAS, the first ACO variant for whic...
104
click to vote
FOCS
1995
IEEE
15 years 1 months ago
1995
IEEE
This paper continues the investigation of the connection between probabilistically checkable proofs PCPs the approximability of NP-optimization problems. The emphasis is on prov...