1402 search results - page 262 / 281 » A Practical Agent Programming Language |
ICALP
2005
Springer
15 years 7 months ago
2005
Springer
Abstract An encryption scheme is non-malleable if the adversary cannot transform a ciphertext into one of a related message under the given public key. Although providing a very st...
72
Voted
ICALP
2005
Springer
15 years 7 months ago
2005
Springer
We present a new primitive—Append-only Signatures (AOS)—with the property that any party given an AOS signature Sig[M1] on message M1 can compute Sig[M1 M2] for any message M2...
TGC
2005
Springer
15 years 7 months ago
2005
Springer
Dynamic rebinding is the ability of changing the definitions of names at execution time. While dynamic rebinding is clearly useful in practice, and increasingly needed in modern s...
106
click to vote
IPPS
2003
IEEE
15 years 7 months ago
2003
IEEE
This paper describes a process for the semi-automatic conversion of numerical and scientific routines written in the C programming language into Triana-based computational servic...
125
Voted
CP
2003
Springer
15 years 7 months ago
2003
Springer
Abstract. Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to de...