7988 search results - page 185 / 1598 » A Useful Undecidable Theory |
IANDC
2008
15 years 21 days ago
2008
We develop a behavioural theory of distributed programs in the presence of failures such as nodes crashing and links breaking. The framework we use is that of D, a language in whi...
104
Voted
JFP
2008
15 years 19 days ago
2008
We consider the problem of reconciling a dependently typed functional language with imperative features such as mutable higher-order state, pointer aliasing, and non-termination. ...
NN
1998
Springer
15 years 9 days ago
1998
Springer
We experimented on task-level robot learning based on bi-directional theory. The via-point representation was used for ‘learning by watching’. In our previous work, we had a r...
140
Voted
CORR
2011
Springer
14 years 4 months ago
2011
Springer
Computation plays a major role in decision making. Even if an agent is willing to ascribe a probability to all states and a utility to all outcomes, and maximize expected utility,...
117
Voted
PAMI
2011
14 years 3 months ago
2011
Abstract—In this paper, we define meta-recognition, a performance prediction method for recognition algorithms, and examine the theoretical basis for its post-recognition score ...