Sciweavers

2300 search results - page 343 / 460
» Maximally Concurrent Programs
Sort
View
TSP
2008
107views more  TSP 2008»
15 years 2 months ago
Opportunistic Spectrum Access via Periodic Channel Sensing
The problem of opportunistic access of parallel channels occupied by primary users is considered. Under a continuous-time Markov chain modeling of the channel occupancy by the prim...
Qing Zhao, Stefan Geirhofer, Lang Tong, Brian M. S...
COR
2004
99views more  COR 2004»
15 years 2 months ago
A lexicographically fair allocation of discrete bandwidth for multirate multicast traffics
Fair bandwidth allocation is an important issue in the multicast network to serve each multicast traffic at a fair rate commensurate with the receiver's capabilities and the ...
Chae Y. Lee, Young P. Moon, Young Joo Cho
HEURISTICS
1998
103views more  HEURISTICS 1998»
15 years 2 months ago
Computing Approximate Solutions of the Maximum Covering Problem with GRASP
We consider the maximum covering problem, a combinatorial optimization problem that arises in many facility location problems. In this problem, a potential facility site covers a s...
Mauricio G. C. Resende
WCNC
2010
IEEE
15 years 22 days ago
Sensing and Communication Tradeoff for Cognitive Access of Continues-Time Markov Channels
—Dynamic spectrum access (DSA) aims to improve spectrum efficiency via spectrum sensing and optimal spectrum access. An essential component in DSA is the joint design of sensing...
Xin Li, Qianchuan Zhao, Xiaohong Guan, Lang Tong
141
Voted
AAMAS
2011
Springer
14 years 9 months ago
Long-term fairness with bounded worst-case losses
How does one repeatedly choose actions so as to be fairest to the multiple beneficiaries of those actions? We examine approaches to discovering sequences of actions for which the...
Gabriel Catalin Balan, Dana Richards, Sean Luke