Sciweavers

189 search results - page 20 / 38
» Models and Algorithms for Stochastic Online Scheduling
Sort
View
SODA
2008
ACM
80views Algorithms» more  SODA 2008»
13 years 10 months ago
Provably good multicore cache performance for divide-and-conquer algorithms
This paper presents a multicore-cache model that reflects the reality that multicore processors have both per-processor private (L1) caches and a large shared (L2) cache on chip. ...
Guy E. Blelloch, Rezaul Alam Chowdhury, Phillip B....
CP
2005
Springer
14 years 2 months ago
Sub-optimality Approximations
Abstract. The sub-optimality approximation problem considers an optimization problem O, its optimal solution σ∗ , and a variable x with domain {d1, . . . , dm} and returns appro...
Russell Bent, Irit Katriel, Pascal Van Hentenryck
TASLP
2002
109views more  TASLP 2002»
13 years 8 months ago
Particle methods for Bayesian modeling and enhancement of speech signals
This paper applies time-varying autoregressive (TVAR) models with stochastically evolving parameters to the problem of speech modeling and enhancement. The stochastic evolution mod...
Jaco Vermaak, Christophe Andrieu, Arnaud Doucet, S...
ESA
2009
Springer
99views Algorithms» more  ESA 2009»
14 years 3 months ago
Minimizing Maximum Response Time and Delay Factor in Broadcast Scheduling
We consider online algorithms for pull-based broadcast scheduling. In this setting there are n pages of information at a server and requests for pages arrive online. When the serv...
Chandra Chekuri, Sungjin Im, Benjamin Moseley
ALGORITHMICA
2005
102views more  ALGORITHMICA 2005»
13 years 8 months ago
Effective Routing and Scheduling in Adversarial Queueing Networks
In an adversarial queueing network, the incoming traffic is decided by an adversary, who operates under a reasonable rate restriction. This model provides a valuable, complementar...
Jay Sethuraman, Chung-Piaw Teo