Sciweavers

3934 search results - page 513 / 787
» Approximate Schedulability Analysis
Sort
View
IJAR
2002
93views more  IJAR 2002»
15 years 6 months ago
Troubleshooting using probabilistic networks and value of information
We develop a decision-theoretic method that yields approximate, low cost troubleshooting plans by making more relevant observations and devoting more time to generate a plan. The ...
Korhan Gökçay, Taner Bilgiç
IDA
1998
Springer
15 years 6 months ago
Fast Dimensionality Reduction and Simple PCA
A fast and simple algorithm for approximately calculating the principal components (PCs) of a data set and so reducing its dimensionality is described. This Simple Principal Compo...
Matthew Partridge, Rafael A. Calvo
MOC
2002
76views more  MOC 2002»
15 years 6 months ago
Localization effects and measure source terms in numerical schemes for balance laws
Abstract. This paper investigates the behavior of numerical schemes for nonlinear conservation laws with source terms. We concentrate on two significant examples: relaxation approx...
Laurent Gosse
QUESTA
2002
38views more  QUESTA 2002»
15 years 6 months ago
Two-Class Priority Queueing System with State-Dependent Arrivals
In this paper, we present a performance analysis of a 2-dimensional preemptive priority queueing system with state-dependent arrivals. Using a Markovian formulation we first comput...
Gabriel R. Bitran, René Caldentey
TIT
2002
64views more  TIT 2002»
15 years 6 months ago
An information-theoretic and game-theoretic study of timing channels
This paper focuses on jammed timing channels. Pure delay jammers with a maximum delay constraint, an average delay constraint, or a maximum buffer size constraint are explored, for...
James Giles, Bruce Hajek