Sciweavers

2814 search results - page 9 / 563
» Competitive Analysis of Distributed Algorithms
Sort
View
TALG
2010
101views more  TALG 2010»
13 years 7 months ago
Reasoning about online algorithms with weighted automata
We describe an automata-theoretic approach for the competitive analysis of online algorithms. Our approach is based on weighted automata, which assign to each input word a cost in...
Benjamin Aminof, Orna Kupferman, Robby Lampert
IJCNN
2000
IEEE
14 years 29 days ago
Regression Analysis for Rival Penalized Competitive Learning Binary Tree
The main aim of this paper is to develop a suitable regression analysis model for describing the relationship between the index efficiency and the parameters of the Rival Penaliz...
Xuequn Li, Irwin King
ANSS
2005
IEEE
14 years 2 months ago
Approximation of Discrete Phase-Type Distributions
The analysis of discrete stochastic models such as generally distributed stochastic Petri nets can be done using state space-based methods. The behavior of the model is described ...
Claudia Isensee, Graham Horton
ESA
2004
Springer
95views Algorithms» more  ESA 2004»
14 years 1 months ago
An Improved Algorithm for CIOQ Switches
Abstract. The problem of maximizing the weighted throughput in various switching settings has been intensively studied recently through competitive analysis. To date, the most gene...
Yossi Azar, Yossi Richter
SPAA
2009
ACM
14 years 9 months ago
Speed scaling of processes with arbitrary speedup curves on a multiprocessor
We consider the setting of a multiprocessor where the speeds of the m processors can be individually scaled. Jobs arrive over time and have varying degrees of parallelizability. A...
Ho-Leung Chan, Jeff Edmonds, Kirk Pruhs