5255 search results - page 397 / 1051 » Formal Methods for Privacy |
145
click to vote
TYPES
2000
Springer
15 years 9 months ago
2000
Springer
Higman's lemma has a very elegant, non-constructive proof due to Nash-Williams [NW63] using the so-called minimal-bad-sequence argument. The objective of the present paper is ...
109
click to vote
ZUM
2000
Springer
15 years 9 months ago
2000
Springer
We have developed a general denition of segregation in the context of Z system specications. This denition is general enough to allow multi-way communications between otherwise seg...
165
click to vote
ZUM
2000
Springer
15 years 9 months ago
2000
Springer
We present a computation model for Z, which is based on a reduction to a small calculus, called Z, and on concurrent constraint resolution techniques applied for computing in thi...
136
click to vote
FORMATS
2008
Springer
15 years 7 months ago
2008
Springer
We study a class of scheduling problems which combines the structural aspects associated with task dependencies, with the dynamic aspects associated with ongoing streams of request...
130
click to vote
ATAL
2010
Springer
15 years 7 months ago
2010
Springer
We investigate planning for self-interested agents in large multi-agent simulations. We present two heuristic algorithms that exploit different domain-specific properties in order...