Sciweavers

2095 search results - page 416 / 419
» Improved pebbling bounds
Sort
View
INFOCOM
2010
IEEE
13 years 5 months ago
Multicast Scheduling with Cooperation and Network Coding in Cognitive Radio Networks
—Cognitive Radio Networks (CRNs) have recently emerged as a promising technology to improve spectrum utilization by allowing secondary users to dynamically access idle primary ch...
Jin Jin, Hong Xu, Baochun Li
INFOCOM
2010
IEEE
13 years 5 months ago
Analyzing the Performance of Greedy Maximal Scheduling via Local Pooling and Graph Theory
—Efficient operation of wireless networks and switches requires using simple (and in some cases distributed) scheduling algorithms. In general, simple greedy algorithms (known a...
Berk Birand, Maria Chudnovsky, Bernard Ries, Paul ...
SAGT
2010
Springer
164views Game Theory» more  SAGT 2010»
13 years 5 months ago
On Nash-Equilibria of Approximation-Stable Games
Abstract. One reason for wanting to compute an (approximate) Nash equilibrium of a game is to predict how players will play. However, if the game has multiple equilibria that are f...
Pranjal Awasthi, Maria-Florina Balcan, Avrim Blum,...
WINET
2010
113views more  WINET 2010»
13 years 5 months ago
Designing multihop wireless backhaul networks with delay guarantees
— As wireless access technologies improve in data rates, the problem focus is shifting towards providing adequate backhaul from the wireless access points to the Internet. Existi...
Girija J. Narlikar, Gordon T. Wilfong, Lisa Zhang
WIOPT
2010
IEEE
13 years 5 months ago
On maximizing collaboration in Wireless Mesh Networks without monetary incentives
—In distributed network settings, where nodes are not under the control of a single administrative entity, the fulfillment of fundamental network operations is heavily dependent...
Gabriel Popa, Éric Gourdin, Franck Legendre...