4498 search results - page 526 / 900 » How to Invent Functions |
168
click to vote
LISP
2002
15 years 6 months ago
2002
Security-typed languages enforce secrecy or integrity policies by type-checking. This paper investigates continuation-passing style (CPS) as a means of proving that such languages...
141
click to vote
RSA
1998
15 years 6 months ago
1998
We introduce some generalizations of a nice combinatorial problem, the central notion of which is the so-called Disease Process. Let us color independently each square of an n×n c...
138
click to vote
TC
2002
15 years 6 months ago
2002
: In this paper we show how design-level aspects can be used to develop high integrity systems. In our approach, a system designer must first identify the specific mechanisms requi...
190
click to vote
NC
2007
15 years 6 months ago
2007
Abstract. We study latching dynamics, i.e. the ability of a network to hop spontaneously from one discrete attractor state to another, which has been proposed as a model of an inï¬...
161
click to vote
PE
2007
Springer
15 years 6 months ago
2007
Springer
We propose a simple framework for analyzing feedforward queueing networks that have the following features: each customer belongs to a (customer) flow and the route that a custom...