2786 search results - page 186 / 558 » A Practical Technique for Process Abstraction |
165
click to vote
LPAR
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. The main goal of this paper is to apply rewriting termination technology —enjoying a quite mature set of termination results and tools— to the problem of proving auto...
152
click to vote
AISC
2004
Springer
15 years 11 months ago
2004
Springer
Symmetry-breaking in constraint satisfaction problems (CSPs) is a well-established area of AI research which has recently developed strong interactions with symbolic computation, i...
172
click to vote
CP
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. One of the most appealing features of constraint programming is its rich constraint language for expressing combinatorial optimization problems. This paper demonstrates t...
198
click to vote
PKC
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. A group key agreement protocol allows a set of users, communicating over a public network, to agree on a private session key. Most of the schemes proposed so far require ...
163
click to vote
BIRTHDAY
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. Petri nets have been widely used to model and analyze concurrent systems. Their wide-spread use in this domain is, on one hand, facilitated by their simplicity and expres...