Sciweavers

4469 search results - page 283 / 894
» Dynamic Program Slicing
Sort
View
PLDI
2003
ACM
14 years 1 months ago
The design, implementation, and evaluation of a compiler algorithm for CPU energy reduction
This paper presents the design and implementation of a compiler algorithm that effectively optimizes programs for energy usage using dynamic voltage scaling (DVS). The algorithm ...
Chung-Hsing Hsu, Ulrich Kremer
VL
2010
IEEE
247views Visual Languages» more  VL 2010»
13 years 6 months ago
Cleanroom: Edit-Time Error Detection with the Uniqueness Heuristic
Many dynamic programming language features, such as implicit declaration, reflection, and code generation, make it difficult to verify the existence of identifiers through standar...
Andrew J. Ko, Jacob O. Wobbrock
NIPS
2000
13 years 9 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 9 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
CORR
2008
Springer
153views Education» more  CORR 2008»
13 years 8 months ago
Decomposition Techniques for Subgraph Matching
In the constraint programming framework, state-of-the-art static and dynamic decomposition techniques are hard to apply to problems with complete initial constraint graphs. For suc...
Stéphane Zampelli, Martin Mann, Yves Devill...