3934 search results - page 36 / 787 » Approximate Schedulability Analysis |
LION
2009
Springer
14 years 4 months ago
2009
Springer
The fitness landscape of the resource constrained project scheduling problem is investigated by examining the search space position type distribution and the correlation between t...
DAM
2007
13 years 9 months ago
2007
We give a short proof of a result of Tovey [6] on the inapproximability of a scheduling problem known as precedence constrained class sequencing. In addition, we present an approxi...
SIAMNUM
2010
13 years 4 months ago
2010
This paper continues the convergence analysis in [M. Giles and S. Ulbrich, SIAM J. Numer. Anal., 48 (2010), pp. 882
AIIA
1991
Springer
14 years 1 months ago
1991
Springer
The use of approximation as a method for dealing with complex problems is a fundamental research issue in Knowledge Representation. Using approximation in symbolic AI is not strai...
ETT
2002
13 years 9 months ago
2002
In computer networks, the Strict Priority (SP) discipline is perhaps the most common and simplest method to schedule packets from different classes of applications, each with diver...