Sciweavers

1753 search results - page 277 / 351
» Dynamic Scan Scheduling
Sort
View
133
Voted
NIPS
1993
15 years 3 months ago
Optimal Stochastic Search and Adaptive Momentum
Stochastic optimization algorithms typically use learning rate schedules that behave asymptotically as (t) = 0=t. The ensemble dynamics (Leen and Moody, 1993) for such algorithms ...
Todd K. Leen, Genevieve B. Orr
ESA
2010
Springer
149views Algorithms» more  ESA 2010»
15 years 2 months ago
Non-clairvoyant Speed Scaling for Weighted Flow Time
We study online job scheduling on a processor that can vary its speed dynamically to manage its power. We attempt to extend the recent success in analyzing total unweighted flow ti...
Sze-Hang Chan, Tak Wah Lam, Lap-Kei Lee
124
Voted
HEURISTICS
2006
197views more  HEURISTICS 2006»
15 years 2 months ago
Bucket elimination for multiobjective optimization problems
Multiobjective optimization deals with problems involving multiple measures of performance that should be optimized simultaneously. In this paper we extend bucket elimination (BE),...
Emma Rollon, Javier Larrosa
104
Voted
PPL
2006
81views more  PPL 2006»
15 years 2 months ago
Microthreading a Model for Distributed Instruction-level Concurrency
This paper analyses the micro-threaded model of concurrency making comparisons with both data and instruction-level concurrency. The model is fine grain and provides synchronisati...
Chris R. Jesshope
PR
2000
130views more  PR 2000»
15 years 2 months ago
Self-annealing and self-annihilation: unifying deterministic annealing and relaxation labeling
Deterministic annealing and relaxation labeling algorithms for classification and matching are presented and discussed. A new approach--self annealing--is introduced to bring dete...
Anand Rangarajan