11328 search results - page 146 / 2266 » Timed Branching Processes |
132
click to vote
DATE
1999
IEEE
15 years 7 months ago
1999
IEEE
Commonly used scheduling algorithms in high-level synthesis only accept one process at a time and are not capable of sharing resources across process boundaries. This results in t...
100
Voted
ICCD
2001
IEEE
16 years 12 days ago
2001
IEEE
This paper introduces minimal subset evaluation (MSE) as a way to reduce time spent on large-structure warm-up during the fastforwarding portion of processor simulations. Warm up ...
166
Voted
JELIA
1994
Springer
15 years 7 months ago
1994
Springer
: In this paper we describe a general way of formalizing reasoning behaviour. Such a behaviour may be described by all the patterns which are valid for the behaviour. A pattern can...
132
Voted
EOR
2008
15 years 3 months ago
2008
We study a scheduling problem, motivated by air-traffic control, in which a set of aircrafts are about to land on a single runway. When coming close to the landing area of the air...
133
click to vote
SIGMETRICS
2006
ACM
15 years 9 months ago
2006
ACM
A new methodology to assess transient performance measures of tree-like processes is proposed by introducing the concept of tree-like processes with marked time epochs. As opposed...