3934 search results - page 78 / 787 » Approximate Schedulability Analysis |
183
click to vote
ESA
2008
Springer
15 years 8 months ago
2008
Springer
We study the mechanism design problem of scheduling unrelated machines and we completely characterize the decisive truthful mechanisms for two players when the domain contains bot...
156
click to vote
ESA
2006
Springer
15 years 10 months ago
2006
Springer
The objective of this paper is to characterize classes of problems for which a greedy algorithm finds solutions provably close to optimum. To that end, we introduce the notion of k...
145
click to vote
ADAEUROPE
2008
Springer
16 years 19 days ago
2008
Springer
The Cheddar project deals with real time scheduling theory. Many industrial projects do not perform performance analysis with real time scheduling theory even if the demand for the...
162
click to vote
RTCSA
1999
IEEE
15 years 10 months ago
1999
IEEE
Abstract. We present an approach to static priority preemptive process scheduling for the synthesis of hard realtime distributed embedded systems where communication plays an impor...
162
click to vote
EOR
2006
15 years 6 months ago
2006
The subject of this paper is the formulation and solution of a variation of the classical binary knapsack problem. The variation that is addressed is termed the ``fixed-charge kna...