1241 search results - page 168 / 249 » Path-oriented random testing |
AIR
2004
14 years 11 months ago
2004
Abstract. In this work we study an over-constrained scheduling problem where constraints cannot be relaxed. This problem originates from a local defense agency where activities to ...
TVLSI
2008
14 years 11 months ago
2008
ion levels. The framework also supports the generation of test constraints, which can be satisfied using a constraint solver to generate tests. A compositional verification approac...
CORR
2010
Springer
14 years 6 months ago
2010
Springer
We present sublinear-time (randomized) algorithms for finding simple cycles of length at least k 3 and tree-minors in bounded-degree graphs. The complexity of these algorithms is...
86
Voted
ICASSP
2011
IEEE
14 years 3 months ago
2011
IEEE
In this paper, we present a new evaluation approach for missing data techniques (MDTs) where the efficiency of those are investigated using listwise deletion method as reference....
ICASSP
2011
IEEE
14 years 3 months ago
2011
IEEE
The diversity gain of a multiple-input multiple-output (MIMO) system adopting the Neyman-Pearson (NP) criterion is derived for a signal-present versus signal-absent scalar hypothe...