270 search results - page 32 / 54 » Exploiting Problem Structure for Solution Counting |
ICASSP
2007
IEEE
14 years 2 months ago
2007
IEEE
When an oversampled FIR filter bank structure is used for signal analysis, a main problem is to guarantee its invertibility and to be able to determine an inverse synthesis filt...
AAAI
2007
13 years 10 months ago
2007
Developing scalable coordination algorithms for multi-agent systems is a hard computational challenge. One useful approach, demonstrated by the Coverage Set Algorithm (CSA), explo...
GECCO
2008
Springer
13 years 8 months ago
2008
Springer
This paper proposes the incremental Bayesian optimization algorithm (iBOA), which modifies standard BOA by removing the population of solutions and using incremental updates of t...
ANCS
2009
ACM
13 years 5 months ago
2009
ACM
The problem of maintaining efficiently a large number (say millions) of statistics counters that need to be updated at very high speeds (e.g. 40 Gb/s) has received considerable re...
INFOCOM
2012
IEEE
11 years 10 months ago
2012
IEEE
—In this paper we study the resource allocation in OFDM-based cognitive radio (CR) networks, under the consideration of many practical limitations such as imperfect spectrum sens...