Dynamic programming, branch-and-bound, and constraint programming are the standard solution principles for nding optimal solutions to machine scheduling problems. We propose a new ...
ded abstract of this work appears in Public Key Cryptography — PKC 2011, ed. R. Gennaro, Springer LNCS 6571 (2011), 1–16. This is the full version. We propose a linearly homom...
ded abstract of this paper appears in Fast Software Encryption, FSE 2004, Lecture Notes in Computer Science, W. Meier and B. Roy editors, Springer-Verlag, 2004. This is the full ve...
The emergence of standards for programming real-time systems in Java has encouraged many developers to consider its use for systems previously only built using C, Ada, or assembly...
Joshua S. Auerbach, David F. Bacon, Bob Blainey, P...
Recently, several languages for web service composition have emerged (e.g., BPEL4WS and WSCI). The goal of these languages is to glue web services together in a process-oriented w...
Wil M. P. van der Aalst, Marlon Dumas, Arthur H. M...