5981 search results - page 48 / 1197 » time 2006 |
ORL
2007
13 years 9 months ago
2007
In this note we establish connections between new and previous results on the remaining service time upon reaching a target level in the M/G/1 queue.
IPL
2006
13 years 10 months ago
2006
We present a parallel algorithm for finding a maximum weight matching in general bipartite graphs with an adjustable time complexity of O(n ) using O(nmax(2,4+)) processing
ICPR
2006
IEEE
14 years 11 months ago
2006
IEEE
DDECS
2006
IEEE
14 years 1 months ago
2006
IEEE
Abstract-- Hard real-time systems need methods to determine upper bounds for their execution times, usually called worst-case execution times. Timing anomalies are counterintuitive...
FMSD
2006
13 years 10 months ago
2006
Two base algorithms are known for reachability verification over timed automata. They are called forward and backwards, and traverse the automata edges using either successors or p...