1333 search results - page 53 / 267 » Not a Number of Floating Point Problems |
133
Voted
ORL
2008
15 years 3 months ago
2008
We define a generalized variant of the satisfiability problem (SAT) where each "clause" is an or-list of inequalities in n variables. The inequality satisfiability probl...
107
click to vote
CSFW
2007
IEEE
15 years 9 months ago
2007
IEEE
In this paper we focus on tackling the insecurity problem of security protocols in the presence of an unbounded number of data such as nonces or session keys. First, we pinpoint f...
149
Voted
ASPDAC
2004
ACM
15 years 9 months ago
2004
ACM
— We examine an abstract formulation of BIST diagnosis in digital logic systems. The BIST diagnosis problem has applications that include identification of erroneous test vector...
138
click to vote
ICALP
2001
Springer
15 years 8 months ago
2001
Springer
We study the generalization of covering problems to partial covering. Here we wish to cover only a desired number of elements, rather than covering all elements as in standard cov...
141
Voted
MMAS
2010
Springer
14 years 10 months ago
2010
Springer
We propose a method for efficient solution of elliptic problems with multiscale features and randomly perturbed coefficients. We use the multiscale finite element method (MsFEM) as...