Sciweavers

1345 search results - page 185 / 269
» Optimal Control With Noisy Time
Sort
View
WMPI
2004
ACM
15 years 9 months ago
Compiler-optimized usage of partitioned memories
In order to meet the requirements concerning both performance and energy consumption in embedded systems, new memory architectures are being introduced. Beside the well-known use o...
Lars Wehmeyer, Urs Helmig, Peter Marwedel
DSOM
2006
Springer
15 years 8 months ago
Uncertainty in Global Application Services with Load Sharing Policy
Abstract. With many organizations now employing multiple data centres around the world to share global traffic load, it is important to understand the effects of geographical distr...
Mark Burgess, Sven Ingebrigt Ulland
ASPDAC
1995
ACM
127views Hardware» more  ASPDAC 1995»
15 years 8 months ago
Reclocking for high-level synthesis
In this paper we describe, a powerful post-synthesis approach called reclocking, for performance improvement by minimizing the total execution time. By back annotating the wire del...
Pradip K. Jha, Nikil D. Dutt, Sri Parameswaran
SIAMCO
2000
117views more  SIAMCO 2000»
15 years 4 months ago
The O.D.E. Method for Convergence of Stochastic Approximation and Reinforcement Learning
It is shown here that stability of the stochastic approximation algorithm is implied by the asymptotic stability of the origin for an associated ODE. This in turn implies convergen...
Vivek S. Borkar, Sean P. Meyn
ISAAC
2010
Springer
243views Algorithms» more  ISAAC 2010»
15 years 2 months ago
Lower Bounds for Howard's Algorithm for Finding Minimum Mean-Cost Cycles
Howard's policy iteration algorithm is one of the most widely used algorithms for finding optimal policies for controlling Markov Decision Processes (MDPs). When applied to we...
Thomas Dueholm Hansen, Uri Zwick