Sciweavers

371 search results - page 42 / 75
» Adaptation hiding modularity
Sort
View
INFOCOM
2007
IEEE
15 years 4 months ago
Cross-Layer Analysis of Rate Adaptation, DCF and TCP in Multi-Rate WLANs
—Wireless Internet access is facilitated by IEEE 802.11 WLANs that, in addition to realizing a specific form of CSMA/CA—distributed coordination function (DCF)— implement a ...
Jaehyuk Choi, Kihong Park, Chongkwon Kim
EMSOFT
2010
Springer
14 years 7 months ago
Resource adaptations with servers for hard real-time systems
Many real-time applications are designed to work in different operating modes each characterized by different functionality and resource demands. With each mode change, resource d...
Nikolay Stoimenov, Lothar Thiele, Luca Santinelli,...
JITECH
2010
116views more  JITECH 2010»
14 years 8 months ago
Design theory for dynamic complexity in information infrastructures: the case of building internet
We propose a design theory that tackles dynamic complexity in the design for Information Infrastructures (IIs) defined as a shared, open, heterogeneous and evolving socio-technica...
Ole Hanseth, Kalle Lyytinen
STOC
1997
ACM
91views Algorithms» more  STOC 1997»
15 years 1 months ago
Lower Bounds for Distributed Coin-Flipping and Randomized Consensus
We examine a class of collective coin- ipping games that arises from randomized distributed algorithms with halting failures. In these games, a sequence of local coin ips is gener...
James Aspnes
RTCSA
2009
IEEE
15 years 4 months ago
Branch Target Buffers: WCET Analysis Framework and Timing Predictability
—One step in the verification of hard real-time systems is to determine upper bounds on the worst-case execution times (WCET) of tasks. To obtain tight bounds, a WCET analysis h...
Daniel Grund, Jan Reineke, Gernot Gebhard