5981 search results - page 180 / 1197 » time 2006 |
117
click to vote
QEST
2006
IEEE
15 years 10 months ago
2006
IEEE
The time-bounded reachability problem for continuoustime Markov chains (CTMCs) amounts to determine the probability to reach a (set of) goal state(s) within a given time span, suc...
145
Voted
SRDS
2006
IEEE
15 years 10 months ago
2006
IEEE
We consider the problem of recovering from failures of distributable threads with assured timeliness. When a node hosting a portion of a distributable thread fails, it causes orph...
125
click to vote
VTC
2006
IEEE
15 years 10 months ago
2006
IEEE
— In this paper, a semi-analytical approach for the performance analysis of the random time slot (TS) hopping (RTSH) algorithm applied to code division multiple access time divis...
120
click to vote
COCOON
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. A circular-arc model (C, A) is a circle C together with a collection A of arcs of C. If A satisfies the Helly Property then (C, A) is a Helly circular-arc model. A (Helly...
131
click to vote
CRYPTO
2006
Springer
15 years 7 months ago
2006
Springer
In this paper we formalize a general model of cryptanalytic time/memory tradeoffs for the inversion of a random function f : {0, 1, . . . , N - 1} {0, 1, . . . , N - 1}. The model...