86 search results - page 12 / 18 » Avoiding Shared Clocks in Networks of Timed Automata |
ICPP
2006
IEEE
14 years 1 months ago
2006
IEEE
— Resource discovery is the process of locating shared resources on a computer network. Previously studied examples include efficiently finding files with a given title on a ...
ICC
2007
IEEE
14 years 1 months ago
2007
IEEE
—E-limited (or K-limited) scheduling is attractive because its performance is close to that of the exhaustive scheduling which is proven to be the optimal polling scheme for symm...
TMC
2008
13 years 7 months ago
2008
In multiowner wireless networks, access points (APs) are owned and operated by different administrations, leading to significant authentication delays during handoff between APs. W...
ISLPED
2004
ACM
14 years 1 months ago
2004
ACM
Microprocessor designers use techniques such as clock gating to reduce power dissipation. An unfortunate side-effect of these techniques is the processor current fluctuations th...
SCN
2011
Springer
13 years 2 months ago
2011
Springer
An inelastic flow is a flow with inelastic rate: i.e., the rate is fixed, it cannot be dynamically adjusted to traffic and load condition as in elastic flows like TCP. Real ti...