1916 search results - page 145 / 384 » Reconfiguring a state machine |
ICML
2005
IEEE
14 years 8 months ago
2005
IEEE
We prove a quantitative connection between the expected sum of rewards of a policy and binary classification performance on created subproblems. This connection holds without any ...
AICCSA
2007
IEEE
14 years 2 months ago
2007
IEEE
This paper presents an encoding algorithm that is very efficient for many different logic synthesis problems. The algorithm is based on the use of special tables and includes two ...
IPPS
2006
IEEE
14 years 2 months ago
2006
IEEE
— Many distributed systems may be limited in their performance by the number of transactions they are able to support per unit of time. In order to achieve fault tolerance and to...
ASM
2004
ASM
14 years 1 months ago
2004
ASM
Abstract. Static single assignment (SSA) form is the intermediate representation of choice in modern optimizing compilers for which no formal semantics has been stated yet. To prov...
ALT
2010
Springer
13 years 9 months ago
2010
Springer
We are studying long term sequence prediction (forecasting). We approach this by investigating criteria for choosing a compact useful state representation. The state is supposed t...