129 search results - page 9 / 26 » Lower Bounds of Computational Power of a Synaptic Calculus |
WCNC
2008
IEEE
14 years 1 months ago
2008
IEEE
Abstract— We consider a scenario in which frequency agile radios opportunistically share a fixed spectrum resource with a set of primary nodes. We develop a collaborative scheme...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
Abstract. We consider the issue of exploiting symmetries in the hierarchy of semidefinite programming relaxations recently introduced in polynomial optimization. We focus on probl...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
The classical problem of reliable point-to-point digital communication is to achieve a low probability of error while keeping the rate high and the total power consumption small. ...
CPAIOR
2006
Springer
13 years 11 months ago
2006
Springer
Recently, Linear Programming (LP)-based relaxations have been shown promising in boosting the performance of exact MAX-SAT solvers. We compare Semidefinite Programming (SDP) based ...
MONET
2008
13 years 7 months ago
2008
This paper investigates a distributed and adaptive approach to manage spectrum usage in dynamic spectrum access networks. While previous works focus on centralized provisioning, w...