2626 search results - page 55 / 526 » The complexity of stochastic sequences |
100
click to vote
SODA
2008
ACM
15 years 1 months ago
2008
ACM
In this paper, we study online algorithms when the input is not chosen adversarially, but consists of draws from some given probability distribution. While this model has been stu...
223
click to vote
RTAS
2011
IEEE
14 years 3 months ago
2011
IEEE
—In this paper, we propose two adaptive scheduling approaches to support real-time control applications with highly varying computation times. The use of a resource reservation s...
SOFSEM
2009
Springer
15 years 8 months ago
2009
Springer
During the last years, speed-up techniques for DIJKSTRA’s algorithm have been developed that make the computation of shortest paths a matter of microseconds even on huge road net...
ALDT
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. We propose various models for lobbying in a probabilistic environment, in which an actor (called “The Lobby”) seeks to influence the voters’ preferences of voting ...
CDC
2009
IEEE
15 years 4 months ago
2009
IEEE
— In recent years, idempotent methods (specifically, max-plus methods) have been developed for solution of nonlinear control problems. It was thought that idempotent linearity o...