Sciweavers

11328 search results - page 445 / 2266
» Timed Branching Processes
Sort
View
RSA
2011
124views more  RSA 2011»
15 years 1 months ago
Sparse random graphs with clustering
In 2007 we introduced a general model of sparse random graphs with independence between the edges. The aim of this paper is to present an extension of this model in which the edge...
Béla Bollobás, Svante Janson, Oliver...
CORR
2011
Springer
175views Education» more  CORR 2011»
14 years 10 months ago
Extracting and Verifying Cryptographic Models from C Protocol Code by Symbolic Execution
Consider the problem of verifying security properties of a cryptographic protocol coded in C. We propose an automatic solution that needs neither a pre-existing protocol descripti...
Mihhail Aizatulin, Andrew D. Gordon, Jan Jürj...
CCS
2011
ACM
14 years 6 months ago
Trace equivalence decision: negative tests and non-determinism
We consider security properties of cryptographic protocols that can be modeled using the notion of trace equivalence. The notion of equivalence is crucial when specifying privacy-...
Vincent Cheval, Hubert Comon-Lundh, Stéphan...
173
Voted
COR
2007
106views more  COR 2007»
15 years 6 months ago
Scheduling parallel CNC machines with time/cost trade-off considerations
When the processing times of jobs are controllable, selected processing times affect both the manufacturing cost and the scheduling performance.A well-known example for such a cas...
Sinan Gurel, M. Selim Akturk
WADS
2007
Springer
131views Algorithms» more  WADS 2007»
16 years 13 days ago
On the Robustness of Graham's Algorithm for Online Scheduling
While standard parallel machine scheduling is concerned with good assignments of jobs to machines, we aim to understand how the quality of an assignment is affected if the jobs’...
Michael Gatto, Peter Widmayer