Sciweavers

7988 search results - page 185 / 1598
» A Useful Undecidable Theory
Sort
View
IANDC
2008
84views more  IANDC 2008»
13 years 10 months ago
A theory of system behaviour in the presence of node and link failure
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...
Adrian Francalanza, Matthew Hennessy
JFP
2008
135views more  JFP 2008»
13 years 10 months ago
Hoare type theory, polymorphism and separation
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. ...
Aleksandar Nanevski, J. Gregory Morrisett, Lars Bi...
NN
1998
Springer
13 years 10 months ago
A tennis serve and upswing learning robot based on bi-directional theory
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...
Hiroyuki Miyamoto, Mitsuo Kawato
CORR
2011
Springer
209views Education» more  CORR 2011»
13 years 2 months ago
I Don't Want to Think About it Now:Decision Theory With Costly Computation
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,...
Joseph Y. Halpern, Rafael Pass
PAMI
2011
13 years 1 months ago
Meta-Recognition: The Theory and Practice of Recognition Score Analysis
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 ...
Walter J. Scheirer, Anderson Rocha, Ross J. Michea...