1677 search results - page 121 / 336 » On the Completeness of Quantum Computation Models |
159
click to vote
ACSC
2009
IEEE
16 years 1 months ago
2009
IEEE
Numerous studies have used historical datasets to build and validate models for estimating software development effort. Very few used a chronological split (where projects’ end ...
157
click to vote
SARA
2007
Springer
16 years 19 days ago
2007
Springer
Most algorithms for computing diagnoses within a modelbased diagnosis framework are deterministic. Such algorithms guarantee soundness and completeness, but are NPhard. To overcom...
166
click to vote
ATVA
2007
Springer
15 years 10 months ago
2007
Springer
We present a new verification technique for Promela which exploits state-space symmetries induced by scalarset values used in a model. The technique involves efficiently computing ...
163
click to vote
IWSEC
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. Attack tree analysis is used to estimate different parameters of general security threats based on information available for atomic subthreats. We focus on estimating the...
184
click to vote
NETWORKS
2010
15 years 4 months ago
2010
We consider a probabilistic model for the Steiner Tree problem. Under this model the problem is defined in a 2-stage setting over a first-stage complete weighted graph having it...