5423 search results - page 209 / 1085 » Denial-of-service in automation systems |
123
click to vote
CSL
2006
Springer
15 years 10 months ago
2006
Springer
We define a hierarchy of term systems Tk by means of restrictions of the recursion schema. We essentially use a pointer technique together with tiering. We prove Tk NCk Tk+1 , for ...
167
click to vote
EWCBR
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. In both research fields, Case-Based Reasoning and Reinforcement Learning, the system under consideration gains its expertise from experience. Utilizing this fundamental c...
166
click to vote
FLOPS
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. This paper explores the feasibility of re-expressing concurrent algorithms with explicit locks in terms of lock free code written using Haskell's implementation of s...
146
click to vote
ICLP
1995
Springer
15 years 10 months ago
1995
Springer
The purpose of this paper is to study the problem of complete type inferencing for polymorphic order-sorted logic programs. We show that previous approaches are incomplete even if...
165
click to vote
LICS
1991
IEEE
15 years 10 months ago
1991
IEEE
Abstract. We extend the termination proof methods based on reduction orderings to higher-order rewriting systems `a la Nipkow using higher-order pattern matching for firing rules,...