Sciweavers

9 search results - page 2 / 2
» Minimizing the number of late jobs in a stochastic setting u...
Sort
View
ECCC
2000
140views more  ECCC 2000»
13 years 5 months ago
Randomized Approximation Schemes for Scheduling Unrelated Parallel Machines
We consider the problem of Scheduling n Independent Jobs on m Unrelated Parallel Machines, when the number of machines m is xed. We address the standard problem of minimizing the ...
Pavlos Efraimidis, Paul G. Spirakis
TELSYS
2008
85views more  TELSYS 2008»
13 years 6 months ago
Trustworthy Web services provisioning for differentiated customer services
With the number of e-Business applications dramatically increasing, a service level agreement (SLA) will play an important part in Web services. The SLA is a combination of severa...
Kaiqi Xiong, Harry G. Perros
JMLR
2008
230views more  JMLR 2008»
13 years 6 months ago
Exponentiated Gradient Algorithms for Conditional Random Fields and Max-Margin Markov Networks
Log-linear and maximum-margin models are two commonly-used methods in supervised machine learning, and are frequently used in structured prediction problems. Efficient learning of...
Michael Collins, Amir Globerson, Terry Koo, Xavier...
SDM
2012
SIAM
252views Data Mining» more  SDM 2012»
11 years 8 months ago
Learning from Heterogeneous Sources via Gradient Boosting Consensus
Multiple data sources containing different types of features may be available for a given task. For instance, users’ profiles can be used to build recommendation systems. In a...
Xiaoxiao Shi, Jean-François Paiement, David...