3218 search results - page 198 / 644 » Timed Extensions for SDL |
144
Voted
PDPTA
2000
15 years 6 months ago
2000
In this paper we address the issue of dependable distributed high performance computing in the field of Symbolic Computation. We describe the extension of a middleware infrastructu...
134
click to vote
ICANN
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. In this paper we elaborate on a kernel extension to tensorbased data analysis. The proposed ideas find applications in supervised learning problems where input data have ...
114
click to vote
AI
2007
Springer
15 years 5 months ago
2007
Springer
Since belief revision deals with the interaction of belief and information over time, branching-time temporal logic seems a natural setting for a theory of belief change. We propo...
125
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
We propose an algorithm that tests membership for regular expressions and show that the algorithm is correct. This algorithm is written in the style of a sequent proof system. The...
126
Voted
CORR
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. Nominal Logic is an extension of first-order logic with equality, name-binding, name-swapping, and freshness of names. Contrarily to higher-order logic, bound variables a...