517 search results - page 22 / 104 » Approximation Algorithms for Scheduling with Reservations |
160
Voted
CSDA
2004
15 years 3 months ago
2004
Variable selection consists in identifying a k-subset of a set of original variables that is optimal for a given criterion of adequate approximation to the whole data set. Several...
104
Voted
JAT
2007
15 years 3 months ago
2007
We study the efficiency of greedy algorithms with regard to redundant dictionaries in Hilbert spaces. We obtain upper estimates for the errors of the Pure Greedy Algorithm and th...
116
Voted
IPL
2006
15 years 3 months ago
2006
The Job Scheduling with Cancellation problem is a variation of classical scheduling problems in which jobs can be cancelled while waiting for execution. In this paper we prove a t...
133
Voted
COMCOM
2004
15 years 3 months ago
2004
One of the important issues in the design of future generation high-speed networks is to provide differentiated services to different types of applications with various time const...
124
Voted
ICIC
2007
Springer
15 years 9 months ago
2007
Springer
Electromagnetism-like algorithm (EM) is a population-based meta-heuristic which has been proposed to solve continuous problems effectively. In this paper, we present a new meta-h...