Sciweavers

3088 search results - page 137 / 618
» Online Passive-Aggressive Algorithms
Sort
View
SIGECOM
2004
ACM
105views ECommerce» more  SIGECOM 2004»
15 years 3 months ago
Mechanism design for online real-time scheduling
For the problem of online real-time scheduling of jobs on a single processor, previous work presents matching upper and lower bounds on the competitive ratio that can be achieved ...
Ryan Porter
WABI
2004
Springer
109views Bioinformatics» more  WABI 2004»
15 years 3 months ago
Online Consensus and Agreement of Phylogenetic Trees
Computational heuristics are the primary methods for reconstruction of phylogenetic trees on large datasets. Most large-scale phylogenetic analyses produce numerous trees that are ...
Tanya Y. Berger-Wolf
ICA3PP
2010
Springer
15 years 2 months ago
On-Line Task Granularity Adaptation for Dynamic Grid Applications
Abstract. Deploying lightweight tasks on grid resources would let the communication overhead dominate the overall application processing time. Our aim is to increase the resulting ...
Nithiapidary Muthuvelu, Ian Chai, Eswaran Chikkann...
AAIM
2007
Springer
120views Algorithms» more  AAIM 2007»
15 years 1 months ago
Online OVSF Code Assignment with Resource Augmentation
Abstract. Orthogonal Variable Spreading Factor (OVSF) code assignment is a fundamental problem in Wideband Code-Division MultipleAccess (W-CDMA) systems, which play an important ro...
Francis Y. L. Chin, Yong Zhang, Hong Zhu
ESA
2008
Springer
134views Algorithms» more  ESA 2008»
14 years 11 months ago
A Near-Tight Bound for the Online Steiner Tree Problem in Graphs of Bounded Asymmetry
The edge asymmetry of a directed, edge-weighted graph is defined as the maximum ratio of the weight of antiparallel edges in the graph, and can be used as a measure of the heterog...
Spyros Angelopoulos