Sciweavers

13 search results - page 2 / 3
» Part II. Future perspective on optimization
Sort
View
BROADNETS
2004
IEEE
15 years 3 months ago
The Effects of the Sub-Carrier Grouping on Multi-Carrier Channel Aware Scheduling
Channel-aware scheduling and link adaptation (LA) methods are widely considered to be crucial for realizing high data rates in wireless networks. Multi-carrier systems that spread...
Fanchun Jin, Gokhan Sahin, Amrinder Arora, Hyeong-...
JSAC
2008
98views more  JSAC 2008»
14 years 11 months ago
Multiuser Detection of Sparsely Spread CDMA
Code-division multiple access (CDMA) is the basis of a family of advanced air interfaces in current and future generation networks. The benefits promised by CDMA have not been full...
Dongning Guo, Chih-Chun Wang
101
Voted
SOFSEM
2010
Springer
15 years 8 months ago
Regret Minimization and Job Scheduling
Regret minimization has proven to be a very powerful tool in both computational learning theory and online algorithms. Regret minimization algorithms can guarantee, for a single de...
Yishay Mansour
ATAL
2003
Springer
15 years 4 months ago
Cooperative negotiation for soft real-time distributed resource allocation
In this paper we present a cooperative negotiation protocol that solves a distributed resource allocation problem while conforming to soft real-time constraints in a dynamic envir...
Roger Mailler, Victor R. Lesser, Bryan Horling
STOC
2004
ACM
121views Algorithms» more  STOC 2004»
15 years 12 months ago
Lower bounds for dynamic connectivity
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
Mihai Patrascu, Erik D. Demaine