641 search results - page 39 / 129 » On robust online scheduling algorithms |
INTERSPEECH
2010
13 years 2 months ago
2010
In this paper we present a novel algorithm called Suppression of Slowly-varying components and the Falling edge of the power envelope (SSF) to enhance spectral features for robust...
ESA
2006
Springer
13 years 11 months ago
2006
Springer
We study the problem of designing kinetic data structures (KDS's for short) when event times cannot be computed exactly and events may be processed in a wrong order. In tradi...
RTAS
2002
IEEE
14 years 25 days ago
2002
IEEE
The paper presents some preliminary results on dynamic scheduling of model predictive controllers (MPCs). In an MPC, the control signal is obtained by on-line optimization of a co...
AAAI
2004
13 years 9 months ago
2004
This paper considers online stochastic optimization problems where time constraints severely limit the number of offline optimizations which can be performed at decision time and/...
SODA
2008
ACM
13 years 9 months ago
2008
ACM
We consider graph coloring problems where the cost of a coloring is the sum of the costs of the colors, and the cost of a color is a monotone concave function of the total weight ...