Sciweavers

517 search results - page 22 / 104
» Approximation Algorithms for Scheduling with Reservations
Sort
View
CSDA
2004
105views more  CSDA 2004»
14 years 9 months ago
Computational aspects of algorithms for variable selection in the context of principal components
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...
Jorge Cadima, J. Orestes Cerdeira, Manuel Minhoto
JAT
2007
84views more  JAT 2007»
14 years 9 months ago
On Lebesgue-type inequalities for greedy approximation
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...
David L. Donoho, Michael Elad, Vladimir N. Temlyak...
IPL
2006
97views more  IPL 2006»
14 years 10 months ago
A tight lower bound for job scheduling with cancellation
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...
Feifeng Zheng, Francis Y. L. Chin, Stanley P. Y. F...
COMCOM
2004
111views more  COMCOM 2004»
14 years 9 months ago
An adaptive scheduling algorithm for differentiated services on WDM optical networks
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...
Maode Ma, Mounir Hamdi
ICIC
2007
Springer
15 years 4 months ago
A Hybrid Electromagnetism-Like Algorithm for Single Machine Scheduling Problem
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...
Shih-Hsin Chen, Pei-Chann Chang, Chien-Lung Chan, ...