Sciweavers

3172 search results - page 9 / 635
» On the Random-Self-Reducibility of Complete Sets
Sort
View
CSFW
2005
IEEE
14 years 3 months ago
Computational and Information-Theoretic Soundness and Completeness of Formal Encryption
We consider expansions of the Abadi-Rogaway logic of indistinguishability of formal cryptographic expressions. We expand the logic in order to cover cases when partial information...
Pedro Adão, Gergei Bana, Andre Scedrov
VL
2000
IEEE
115views Visual Languages» more  VL 2000»
14 years 2 months ago
SD2: A Sound and Complete Diagrammatic Reasoning System
SD2 is a system of Venn-type diagrams that can be used to reason diagrammatically about sets, their cardinalities and their relationships. They augment the systems of Venn-Peirce ...
John Howse, Fernando Molina, John Taylor
MOR
2000
90views more  MOR 2000»
13 years 9 months ago
A PTAS for Minimizing the Total Weighted Completion Time on Identical Parallel Machines
We consider the problem of scheduling a set of n jobs on m identical parallel machines so as to minimize the weighted sum of job completion times. This problem is NP-hard in the s...
Martin Skutella, Gerhard J. Woeginger
IJISEC
2008
188views more  IJISEC 2008»
13 years 8 months ago
Complete analysis of configuration rules to guarantee reliable network security policies
Abstract The use of different network security components, such as firewalls and network intrusion detection systems (NIDSs), is the dominant method to monitor and guarantee the se...
Joaquín García-Alfaro, Nora Boulahia...
JSYML
2010
107views more  JSYML 2010»
13 years 8 months ago
A proof of completeness for continuous first-order logic
Continuous first-order logic has found interest among model theorists who wish to extend the classical analysis of “algebraic” structures (such as fields, group, and graphs) ...
Arthur Paul Pedersen, Itay Ben-Yaacov