2137 search results - page 118 / 428 » Proving Abstract Non-interference |
125
click to vote
STACS
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. It is well known that one-dimensional cellular automata working on the usual neighborhood are Turing complete, and many acceleration theorems are known. However very litt...
123
click to vote
TLCA
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. The Focal language (formerly FoC) allows one to incrementally build modules and to formally prove their correctness. In this paper, we present two formal semantics for en...
121
click to vote
CIS
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. In this paper, we propose a naive statistics method for constructing a personalized recommendation system for the Electronic Program Guide (EPG). The idea is based on a p...
114
click to vote
COLT
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. We consider Reinforcement Learning for average reward zerosum stochastic games. We present and analyze two algorithms. The first is based on relative Q-learning and the ...
94
Voted
CONCUR
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. We study the expressiveness of finite message-passing automata with a priori unbounded FIFO channels and show them to capture exactly the class of MSC languages that are...