Sciweavers

2485 search results - page 91 / 497
» Time Bounded Frequency Computations
Sort
View
CODES
2007
IEEE
15 years 11 months ago
Improved response time analysis of tasks scheduled under preemptive Round-Robin
Round-Robin scheduling is the most popular time triggered scheduling policy, and has been widely used in communication networks for the last decades. It is an efficient schedulin...
Razvan Racu, Li Li, Rafik Henia, Arne Hamann, Rolf...
WDAG
2010
Springer
233views Algorithms» more  WDAG 2010»
15 years 2 months ago
Minimum Dominating Set Approximation in Graphs of Bounded Arboricity
Abstract. Since in general it is NP-hard to solve the minimum dominating set problem even approximatively, a lot of work has been dedicated to central and distributed approximation...
Christoph Lenzen, Roger Wattenhofer
141
Voted
TWC
2008
109views more  TWC 2008»
15 years 4 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
138
Voted
HASE
1997
IEEE
15 years 8 months ago
High-Coverage Fault Tolerance in Real-Time Systems Based on Point-to-Point Communication
: The distributed recovery block (DRB) scheme is a widely applicable approach for realizing both hardware and software fault tolerance in real-time distributed and parallel compute...
K. H. Kim, Chittur Subbaraman, Eltefaat Shokri
143
Voted
WABI
2007
Springer
133views Bioinformatics» more  WABI 2007»
15 years 10 months ago
RNA Folding Including Pseudoknots: A New Parameterized Algorithm and Improved Upper Bound
Predicting the secondary structure of an RNA sequence is an important problem in structural bioinformatics. The general RNA folding problem, where the sequence to be folded may con...
Chunmei Liu, Yinglei Song, Louis W. Shapiro