Sciweavers

3049 search results - page 264 / 610
» On the Convergence of Bound Optimization Algorithms
Sort
View
TON
2008
119views more  TON 2008»
15 years 6 months ago
Polynomial time approximation algorithms for multi-constrained QoS routing
We study the multi-constrained Quality-of-Service (QoS) routing problem where one seeks to find a path from a source to a destination in the presence of K 2 additive end-to-end Qo...
Guoliang Xue, Weiyi Zhang, Jian Tang, Krishnaiyan ...
SCHEDULING
2011
15 years 1 months ago
On robust online scheduling algorithms
While standard parallel machine scheduling is concerned with good assignments of jobs to machines, we aim to understand how the quality of an assignment is affected if the jobsâ€...
Michael Gatto, Peter Widmayer
COCOON
2007
Springer
16 years 23 days ago
Online Interval Scheduling: Randomized and Multiprocessor Cases
We consider the problem of scheduling a set of equal-length intervals arriving online, where each interval is associated with a weight and the objective is to maximize the total we...
Stanley P. Y. Fung, Chung Keung Poon, Feifeng Zhen...
WDAG
1994
Springer
104views Algorithms» more  WDAG 1994»
15 years 10 months ago
Fast Increment Registers
We give an optimal, wait-free implementation of an increment register. An increment register is a concurrent object consisting of an integer-valued register with an increment oper...
Soma Chaudhuri, Mark R. Tuttle
KDD
2004
ACM
187views Data Mining» more  KDD 2004»
16 years 7 months ago
IMMC: incremental maximum margin criterion
Subspace learning approaches have attracted much attention in academia recently. However, the classical batch algorithms no longer satisfy the applications on streaming data or la...
Jun Yan, Benyu Zhang, Shuicheng Yan, Qiang Yang, H...