Sciweavers

361 search results - page 13 / 73
» Approximate counting by dynamic programming
Sort
View
EMSOFT
2004
Springer
14 years 26 days ago
Binary translation to improve energy efficiency through post-pass register re-allocation
Energy efficiency is rapidly becoming a first class optimization parameter for modern systems. Caches are critical to the overall performance and thus, modern processors (both hig...
Kun Zhang, Tao Zhang, Santosh Pande
CDC
2009
IEEE
143views Control Systems» more  CDC 2009»
13 years 10 months ago
Parameter approximate dynamic optimization for PSO systems
— This paper presents a novel swarm approximate dynamic programming method (swarm-ADP) for parameter optimization of PSO systems, from the perspective of optimal control. Based o...
Qi Kang, Lei Wang, Derong Liu, Qidi Wu
CORR
2007
Springer
109views Education» more  CORR 2007»
13 years 7 months ago
Multiresolution Approximation of Polygonal Curves in Linear Complexity
: We propose a new algorithm to the problem of polygonal curve approximation based on a multiresolution approach. This algorithm is suboptimal but still maintains some optimality b...
Pierre-Francois Marteau, Gildas Ménier
NIPS
2000
13 years 8 months ago
APRICODD: Approximate Policy Construction Using Decision Diagrams
We propose a method of approximate dynamic programming for Markov decision processes (MDPs) using algebraic decision diagrams (ADDs). We produce near-optimal value functions and p...
Robert St-Aubin, Jesse Hoey, Craig Boutilier
NIPS
1994
13 years 8 months ago
Generalization in Reinforcement Learning: Safely Approximating the Value Function
To appear in: G. Tesauro, D. S. Touretzky and T. K. Leen, eds., Advances in Neural Information Processing Systems 7, MIT Press, Cambridge MA, 1995. A straightforward approach to t...
Justin A. Boyan, Andrew W. Moore