911 search results - page 26 / 183 » Combining programs and state machines |
ICCAD
2001
IEEE
14 years 5 months ago
2001
IEEE
SPFDs are a mechanism to express flexibility in Boolean networks. Introduced by Yamashita et al. in the context of FPGA synthesis [4], they were extended later to general combina...
PLDI
2003
ACM
14 years 1 months ago
2003
ACM
Interpreters designed for efficiency execute a huge number of indirect branches and can spend more than half of the execution time in indirect branch mispredictions. Branch target...
SOFSEM
2012
Springer
12 years 4 months ago
2012
Springer
Abstract. Various methods exists in the literature for denoting the configuration of a Turing Machine. A key difference is whether the head position is indicated by some integer ...
SOCO
2005
Springer
14 years 2 months ago
2005
Springer
Aspects that trigger on a sequence of join points instead of on a single join point are not explicitly supported in current AspectOriented approaches. Explicit protocols are howeve...
ICML
2006
IEEE
2006
IEEE
Automatic basis function construction for approximate dynamic programming and reinforcement learning
14 years 2 months ago
We address the problem of automatically constructing basis functions for linear approximation of the value function of a Markov Decision Process (MDP). Our work builds on results ...