Sciweavers

56823 search results - page 11321 / 11365
» Which landmark is useful
Sort
View
TC
2011
13 years 2 months ago
Performing Arithmetic Operations on Round-to-Nearest Representations
—During any composite computation, there is a constant need for rounding intermediate results before they can participate in further processing. Recently, a class of number repre...
Peter Kornerup, Jean-Michel Muller, Adrien Panhale...
TIT
2011
149views more  TIT 2011»
13 years 2 months ago
Network Coding for Computing: Cut-Set Bounds
Abstract—The following network computing problem is considered. Source nodes in a directed acyclic network generate independent messages and a single receiver node computes a tar...
Rathinakumar Appuswamy, Massimo Franceschetti, Nik...
TKDE
2011
150views more  TKDE 2011»
13 years 2 months ago
Estimating and Enhancing Real-Time Data Service Delays: Control-Theoretic Approaches
—It is essential to process real-time data service requests such as stock quotes and trade transactions in a timely manner using fresh data, which represent the current real worl...
Kyoung-Don Kang, Yan Zhou, Jisu Oh
TMC
2011
219views more  TMC 2011»
13 years 2 months ago
Optimal Channel Access Management with QoS Support for Cognitive Vehicular Networks
We consider the problem of optimal channel access to provide quality of service (QoS) for data transmission in cognitive vehicular networks. In such a network the vehicular nodes ...
Dusit Niyato, Ekram Hossain, Ping Wang
WINET
2011
13 years 2 months ago
Sleep scheduling with expected common coverage in wireless sensor networks
Sleep scheduling, which is putting some sensor nodes into sleep mode without harming network functionality, is a common method to reduce energy consumption in dense wireless sensor...
Eyuphan Bulut, Ibrahim Korpeoglu
« Prev « First page 11321 / 11365 Last » Next »