3792 search results - page 329 / 759 » Techniques for Trusted Software Engineering |
154
click to vote
FSTTCS
2008
Springer
15 years 7 months ago
2008
Springer
ABSTRACT. We study the algorithmic complexity of lattice problems based on Ajtai-Kumar-Sivakumar sieving technique [AKS01]. Given a k-dimensional subspace M ⊆ Rn and a full rank ...
170
click to vote
RE
2006
Springer
15 years 6 months ago
2006
Springer
A technique is presented for obtaining a specification from a requirement through a series of incremental steps. The starting point is a Problem Frame description involving a requ...
137
click to vote
AC
2004
Springer
15 years 6 months ago
2004
Springer
In this chapter, we define and propose countermeasures for a category of computer security exploits which we call "cognitive hacking." Cognitive hacking refers to a comp...
172
click to vote
IWPC
2010
IEEE
15 years 5 months ago
2010
IEEE
— Program Comprehension is improved if: i) the Problem and Program Domains can be related, and ii) this relation is shown in a suitable way to the programmer. Currently, there ar...
184
click to vote
CCE
2011
15 years 1 months ago
2011
The ability of a Reynolds-averaged Navier-Stokes (RANS) approach, coupled with a Lagrangian particle tracking technique, to predict particle re-suspension in a high Reynolds numbe...