Sciweavers

748 search results - page 62 / 150
» Time and Probability in Process Algebra
Sort
View
134
Voted
LICS
1998
IEEE
15 years 4 months ago
Compositional Analysis of Expected Delays in Networks of Probabilistic I/O Automata
Probabilistic I/O automata (PIOA) constitute a model for distributed or concurrent systems that incorporates a notion of probabilistic choice. The PIOA model provides a notion of ...
Eugene W. Stark, Scott A. Smolka
CIIT
2007
133views Communications» more  CIIT 2007»
15 years 1 months ago
Linear-tree rule structure for firewall optimization
Given a list of filtering rules with individual hitting probabilities, it is known that the average processing time of a linear-search based firewall can be minimized by searchi...
Liang Zhao, A. Shimae, Hiroshi Nagamochi
EUROPAR
2011
Springer
14 years 6 days ago
A Fully Empirical Autotuned Dense QR Factorization for Multicore Architectures
: Tuning numerical libraries has become more difficult over time, as systems get more sophisticated. In particular, modern multicore machines make the behaviour of algorithms hard ...
Emmanuel Agullo, Jack Dongarra, Rajib Nath, Stanim...
91
Voted
CRYPTO
2000
Springer
175views Cryptology» more  CRYPTO 2000»
15 years 4 months ago
A Chosen-Ciphertext Attack against NTRU
We present a chosen-ciphertext attack against the public key cryptosystem called NTRU. This cryptosystem is based on polynomial algebra. Its security comes from the interaction of ...
Éliane Jaulmes, Antoine Joux
ENTCS
2002
139views more  ENTCS 2002»
15 years 8 days ago
Automatic Verification of the IEEE-1394 Root Contention Protocol with KRONOS and PRISM
We report on the automatic verification of timed probabilistic properties of the IEEE 1394 root contention protocol combining two existing tools: the real-time modelchecker Kronos...
Conrado Daws, Marta Z. Kwiatkowska, Gethin Norman