Sciweavers

4325 search results - page 373 / 865
» Incremental computation with names
Sort
View
DBSEC
2008
152views Database» more  DBSEC 2008»
15 years 8 months ago
An Attack Graph-Based Probabilistic Security Metric
To protect critical resources in today’s networked environments, it is desirable to quantify the likelihood of potential multi-step attacks that combine multiple vulnerabilities....
Lingyu Wang, Tania Islam, Tao Long, Anoop Singhal,...
CCR
2008
65views more  CCR 2008»
15 years 7 months ago
The future in your pocket
There is a growing sentiment among academics in computing that a shift to multicore processors in commodity computers will demand that all programmers become parallel programmers....
Patrick Crowley
ECEASST
2008
106views more  ECEASST 2008»
15 years 7 months ago
Controlling resource access in Directed Bigraphs
: We study directed bigraph with negative ports, a bigraphical framework for representing models for distributed, concurrent and ubiquitous computing. With respect to previous vers...
Davide Grohmann, Marino Miculan
ECCC
2006
71views more  ECCC 2006»
15 years 7 months ago
Polynomial Algorithms for Approximating Nash Equilibria of Bimatrix Games
We focus on the problem of computing an -Nash equilibrium of a bimatrix game, when is an absolute constant. We present a simple algorithm for computing a 3 4 -Nash equilibrium for ...
Spyros C. Kontogiannis, Panagiota N. Panagopoulou,...
CAD
2007
Springer
15 years 6 months ago
A formal theory for estimating defeaturing-induced engineering analysis errors
Defeaturing is a popular CAD/ CAE simplification technique where ‘small or irrelevant features’ are suppressed within a CAD model for speeding-up downstream processes, especia...
Sankara Hari Gopalakrishnan, Krishnan Suresh