1403 search results - page 28 / 281 » About Approximations of Exponentials |
104
Voted
SARA
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. This article introduces a technique for improving the efficiency of diagnosis through approximate compilation. We extend the approach of compiling a diagnostic model, as...
107
click to vote
SIGMETRICS
2010
ACM
14 years 11 months ago
2010
ACM
We introduce and analyze a deterministic fluid model that serves as an approximation for the Gt/GI/st + GI manyserver queueing model, which has a general time-varying arrival pro...
102
click to vote
QEST
2008
IEEE
15 years 7 months ago
2008
IEEE
We begin by observing that (discrete-time) QuasiBirth-Death Processes (QBDs) are equivalent, in a precise sense, to (discrete-time) probabilistic 1-Counter Automata (p1CAs), and b...
135
Voted
ETFA
2006
IEEE
15 years 6 months ago
2006
IEEE
Abstract— This article presents some results about schedulability analysis of tasks with offsets also known as transactions, in the particular case of monotonic transactions. The...
121
Voted
SODA
2012
ACM
13 years 3 months ago
2012
ACM
The Odd Cycle Transversal problem (OCT) asks whether a given graph can be made bipartite by deleting at most k of its vertices. In a breakthrough result Reed, Smith, and Vetta (Op...