Sciweavers

2610 search results - page 347 / 522
» Computational Probabilistic Non-interference
Sort
View
126
Voted
ACSAC
2004
IEEE
15 years 7 months ago
Designing Good Deceptions in Defense of Information Systems
Since attackers trust computer systems to tell them the truth, it may be effective for those systems to lie or mislead. This could waste the attacker's resources while permit...
Neil C. Rowe
127
Voted
ARCS
2006
Springer
15 years 7 months ago
Safety, Liveness, and Information Flow: Dependability Revisited
Abstract: We present a formal framework to talk and reason about dependable systems. The framework is based on three distinct classes of (system specification) properties we call s...
Zinaida Benenson, Felix C. Freiling, Thorsten Holz...
147
Voted
CAV
2006
Springer
133views Hardware» more  CAV 2006»
15 years 7 months ago
Antichains: A New Algorithm for Checking Universality of Finite Automata
We propose and evaluate a new algorithm for checking the universality of nondeterministic finite automata. In contrast to the standard algorithm, which uses the subset construction...
Martin De Wulf, Laurent Doyen, Thomas A. Henzinger...
124
Voted
GECCO
2006
Springer
168views Optimization» more  GECCO 2006»
15 years 7 months ago
A Bayesian approach to learning classifier systems in uncertain environments
In this paper we propose a Bayesian framework for XCS [9], called BXCS. Following [4], we use probability distributions to represent the uncertainty over the classifier estimates ...
Davide Aliprandi, Alex Mancastroppa, Matteo Matteu...
159
Voted
COMPGEOM
1995
ACM
15 years 7 months ago
A New Technique for Analyzing Substructures in Arrangements
We present a simple but powerful new probabilistic technique for analyzing the combinatorial complexity of various substructures in arrangements of piecewise-linear surfaces in hig...
Boaz Tagansky