Sciweavers

2732 search results - page 209 / 547
» Fast and Distributed Computation of Schedules in Wireless Ne...
Sort
View
HPCA
2005
IEEE
16 years 7 months ago
A Small, Fast and Low-Power Register File by Bit-Partitioning
A large multi-ported register file is indispensable for exploiting instruction level parallelism (ILP) in today's dynamically scheduled superscalar processors. The number of ...
Masaaki Kondo, Hiroshi Nakamura
205
Voted
ICDCS
2000
IEEE
15 years 11 months ago
Scheduling Heuristics for Data Requests in an Oversubscribed Network with Priorities and Deadlines
Providing up-to-date input to users’ applications is an important data management problem for a distributed computing environment, where each data storage location and intermedi...
Mitchell D. Theys, Noah Beck, Howard Jay Siegel, M...
INFOCOM
2011
IEEE
14 years 10 months ago
Optimized asynchronous multi-channel neighbor discovery
—We consider the problem of neighbor discovery in wireless networks with nodes operating in multiple frequency bands and with asymmetric beacon intervals. This is a challenging t...
Niels Karowski, Aline Carneiro Viana, Adam Wolisz
TMC
2010
210views more  TMC 2010»
15 years 5 months ago
Exploiting Reactive Mobility for Collaborative Target Detection in Wireless Sensor Networks
—Recent years have witnessed the deployments of wireless sensor networks in a class of mission-critical applications such as object detection and tracking. These applications oft...
Rui Tan, Guoliang Xing, Jianping Wang, Hing-Cheung...
CORR
2010
Springer
160views Education» more  CORR 2010»
15 years 3 months ago
Routing with Mutual Information Accumulation in Wireless Networks
We investigate optimal routing and scheduling strategies for multi-hop wireless networks with rateless codes. Rateless codes allow each node of the network to accumulate mutual in...
Rahul Urgaonkar, Michael J. Neely