9405 search results - page 1304 / 1881 » Computing a Model of Set Theory |
205
click to vote
AGENTCL
2000
Springer
15 years 11 months ago
2000
Springer
In this paper we define the concept of conversation policies: declarative specifications that govern communications between software agents using an agent communication language. ...
169
click to vote
MA
1999
Springer
15 years 11 months ago
1999
Springer
In this paper we present practical experiences gathered from the employment of two popular Java-based mobile-agent platforms, IBM's Aglets and Mitsubishi's Concordia. We...
198
click to vote
LICS
1997
IEEE
15 years 11 months ago
1997
IEEE
traction for Functional Languages with Control James Laird LFCS, Department of Computer Science University of Edinburgh This paper considers the consequences of relaxing the brack...
198
click to vote
ACISP
2006
Springer
15 years 11 months ago
2006
Springer
In this paper, we propose an efficient multi-receiver identity based signcryption scheme which only needs one pairing computation to signcrypt a message for n receivers and can pro...
201
click to vote
CAV
2006
Springer
15 years 10 months ago
2006
Springer
We propose and evaluate a new algorithm for checking the universality of nondeterministic finite automata. In contrast to the standard algorithm, which uses the subset construction...