Sciweavers

5169 search results - page 933 / 1034
» Locality approximation using time
Sort
View
FSTTCS
2009
Springer
15 years 10 months ago
Covering of ordinals
The paper focuses on the structure of fundamental sequences of ordinals smaller than ε0. A first result is the construction of a monadic second-order formula identifying a given ...
Laurent Braud
151
Voted
ICC
2008
IEEE
175views Communications» more  ICC 2008»
15 years 9 months ago
Routing in Cooperative Wireless Networks with Mutual-Information Accumulation
Cooperation between the nodes of wireless multihop networks can increase communication reliability, reduce energy consumption, and decrease latency. The possible improvements are ...
Stark C. Draper, Lingjia Liu, Andreas F. Molisch, ...
127
Voted
NOMS
2008
IEEE
118views Communications» more  NOMS 2008»
15 years 9 months ago
Policy-based self-management of hybrid ad hoc networks for dynamic channel configuration
— Wireless networks have become a ubiquitous reality and ever more surround our everyday activities. They form and disappear around us spontaneously and have become new means for...
Antonis M. Hadjiantonis, George Pavlou
164
Voted
WIMOB
2007
IEEE
15 years 9 months ago
A Fault Resilient Routing Protocol for Mobile Ad-Hoc Networks
— In a Mobile Ad hoc NETwork (MANET), mobile devices cooperate to forward packets for each other without the assistance of dedicated routing infrastructures. Due to its networkin...
Sirisha Medidi, Jiong Wang
VALUETOOLS
2006
ACM
167views Hardware» more  VALUETOOLS 2006»
15 years 9 months ago
Detailed cache simulation for detecting bottleneck, miss reason and optimization potentialities
Cache locality optimization is an efficient way for reducing the idle time of modern processors in waiting for needed data. This kind of optimization can be achieved either on the...
Jie Tao, Wolfgang Karl