Sciweavers

908 search results - page 54 / 182
» Temporal Analysis of Time Bounded Digital Systems
Sort
View
TWC
2008
109views more  TWC 2008»
14 years 9 months ago
Service Time Approximation in IEEE 802.11 Single-Hop Ad Hoc Networks
Abstract-- This paper investigates the near-memoryless behavior of the service time for IEEE 802.11 saturated single-hop ad hoc networks. We show that the number of packets success...
Atef Abdrabou, Weihua Zhuang
CONCUR
1999
Springer
15 years 2 months ago
Partial Order Reduction for Model Checking of Timed Automata
Abstract. The paper presents a partial order reduction method applicable to networks of timed automata. The advantage of the method is that it reduces both the number of explored c...
Marius Minea
IPPS
2007
IEEE
15 years 4 months ago
New Results on the Performance Effects of Autocorrelated Flows in Systems
Temporal dependence within the workload of any computing or networking system has been widely recognized as a significant factor affecting performance. More specifically, burstin...
Evgenia Smirni, Qi Zhang, Ningfang Mi, Alma Riska,...
ISOLA
2010
Springer
14 years 8 months ago
Worst-Case Analysis of Heap Allocations
In object oriented languages, dynamic memory allocation is a fundamental concept. When using such a language in hard real-time systems, it becomes important to bound both the worst...
Wolfgang Puffitsch, Benedikt Huber, Martin Schoebe...
AIPS
2007
15 years 3 days ago
Online Planning for Resource Production in Real-Time Strategy Games
Planning in domains with temporal and numerical properties is an important research problem. One application of this is the resource production problem in real-time strategy (RTS)...
Hei Chan, Alan Fern, Soumya Ray, Nick Wilson, Chri...