Sciweavers

2214 search results - page 417 / 443
» complexity 2004
Sort
View
EMSOFT
2004
Springer
14 years 3 months ago
Approximation of the worst-case execution time using structural analysis
We present a technique to approximate the worst-case execution time that combines structural analysis with a loop-bounding algorithm based on local induction variable analysis. St...
Matteo Corti, Thomas R. Gross
ESAW
2004
Springer
14 years 3 months ago
Techniques for Analysis and Calibration of Multi-agent Simulations
In this paper we present analysis and calibration techniques that exploit knowledge about a multi agent society in order to calibrate the system parameters of a corresponding socie...
Manuel Fehler, Franziska Klügl, Frank Puppe
ESOP
2004
Springer
14 years 3 months ago
Resources, Concurrency, and Local Reasoning (Abstract)
t) Peter W. O’Hearn Queen Mary, University of London In the 1960s Dijkstra suggested that, in order to limit the complexity of potential process interactions, concurrent programs...
Peter W. O'Hearn
EUROCRYPT
2004
Springer
14 years 3 months ago
Positive Results and Techniques for Obfuscation
Informally, an obfuscator O is an efficient, probabilistic “compiler” that transforms a program P into a new program O(P) with the same functionality as P, but such that O(P)...
Ben Lynn, Manoj Prabhakaran, Amit Sahai
FC
2004
Springer
89views Cryptology» more  FC 2004»
14 years 3 months ago
Electronic National Lotteries
We describe the design and implementation of secure and robust protocol and system for a national electronic lottery. Electronic lotteries at a national level are a viable cost e...
Elisavet Konstantinou, Vasiliki Liagkou, Paul G. S...