Sciweavers

86 search results - page 12 / 18
» Worst-Case Running Times for Average-Case Algorithms
Sort
View
IANDC
2007
107views more  IANDC 2007»
14 years 9 months ago
Task automata: Schedulability, decidability and undecidability
We present a model, task automata, for real time systems with non-uniformly recurring computation tasks. It is an extended version of timed automata with asynchronous processes th...
Elena Fersman, Pavel Krcál, Paul Pettersson...
ICCAD
2006
IEEE
124views Hardware» more  ICCAD 2006»
15 years 6 months ago
A linear-time approach for static timing analysis covering all process corners
Abstract—Manufacturing process variations lead to circuit timing variability and a corresponding timing yield loss. Traditional corner analysis consists of checking all process c...
Sari Onaissi, Farid N. Najm
IWMM
2010
Springer
211views Hardware» more  IWMM 2010»
14 years 11 months ago
Concurrent, parallel, real-time garbage-collection
With the current developments in CPU implementations, it becomes obvious that ever more parallel multicore systems will be used even in embedded controllers that require real-time...
Fridtjof Siebert
ICALP
2005
Springer
15 years 3 months ago
The Tree Inclusion Problem: In Optimal Space and Faster
Given two rooted, ordered, and labeled trees P and T the tree inclusion problem is to determine if P can be obtained from T by deleting nodes in T. This problem has recently been r...
Philip Bille, Inge Li Gørtz
TCOM
2010
116views more  TCOM 2010»
14 years 8 months ago
Optimal Routing for Decode-Forward in Cooperative Wireless Networks
Abstract—We investigate routing in cooperative multipleterminal wireless networks in which the nodes can collaborate with each other in data transmission. First, we motivate coop...
Lawrence Ong, Mehul Motani