Sciweavers

1432 search results - page 97 / 287
» Hardness of robust network design
Sort
View
195
Voted
MOBIHOC
2010
ACM
15 years 4 months ago
Breaking bidder collusion in large-scale spectrum auctions
Dynamic spectrum auction is an effective solution to provide spectrum on-demand to many small wireless networks. As the number of participants grows, bidder collusion becomes a se...
Xia Zhou, Haitao Zheng
ANCS
2005
ACM
15 years 11 months ago
Resource mapping and scheduling for heterogeneous network processor systems
Task to resource mapping problems are encountered during (i) hardware-software co-design and (ii) performance optimization of Network Processor systems. The goal of the first pro...
Liang Yang, Tushar Gohad, Pavel Ghosh, Devesh Sinh...
CN
2004
101views more  CN 2004»
15 years 6 months ago
Adaptive scheduling for integrated traffic on WDM optical networks
One of the important issues in the design of future generation of high-speed networks is to provide differentiated service to different types of traffic with various time constrai...
Maode Ma, Xiaohong Huang
SENSYS
2010
ACM
15 years 4 months ago
Efficient diagnostic tracing for wireless sensor networks
Wireless sensor networks (WSNs) are hard to program due to unconventional programming models used to satisfy stringent resource constraints. The common event-driven concurrent pro...
Vinaitheerthan Sundaram, Patrick Th. Eugster, Xian...
CODES
2009
IEEE
15 years 9 months ago
An MDP-based application oriented optimal policy for wireless sensor networks
Technological advancements due to Moore’s law have led to the proliferation of complex wireless sensor network (WSN) domains. One commonality across all WSN domains is the need ...
Arslan Munir, Ann Gordon-Ross