1687 search results - page 207 / 338 » On the complexity of scheduling in wireless networks |
164
click to vote
PERCOM
2007
ACM
16 years 6 months ago
2007
ACM
We consider sensor scheduling as the optimal observability problem for partially observable Markov decision processes (POMDP). This model fits to the cases where a Markov process ...
151
click to vote
SIGCOMM
2010
ACM
15 years 6 months ago
2010
ACM
Sora is a fully programmable, high performance software radio platform based on commodity general-purpose PC. In this demonstration, we illustrate the main features of the Sora pl...
168
click to vote
INFOCOM
2009
IEEE
16 years 1 months ago
2009
IEEE
Distributed opportunistic scheduling (DOS) is studied for wireless ad-hoc networks in which many links contend for the channel using random access before data transmissions. Simpl...
167
click to vote
GECCO
2007
Springer
16 years 18 days ago
2007
Springer
This paper explores the application of the particle swarm algorithm for a NP-hard problem in the area of wireless communications. The specific problem is of detecting symbols in a...
165
click to vote
KIVS
2007
Springer
16 years 18 days ago
2007
Springer
This paper presents several results on dynamic OFDMA systems. It addresses especially the algorithmic complexity involved with several resource allocation approaches, sub-optimal h...