2467 search results - page 244 / 494 » Finite State Machines |
196
Voted
ICML
2005
IEEE
16 years 7 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 ...
186
click to vote
IPPS
2006
IEEE
16 years 22 days 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...
149
click to vote
ASM
2004
ASM
16 years 3 days 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...
148
click to vote
ALT
2010
Springer
15 years 8 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...
181
click to vote
TCS
2008
15 years 6 months ago
2008
This paper studies a novel paradigm for learning formal languages from positive and negative examples which consists of mapping strings to an appropriate highdimensional feature s...