2218 search results - page 120 / 444 » Testing Expressibility Is Hard |
SAT
2004
Springer
14 years 2 months ago
2004
Springer
This paper reports about the 2004 comparative evaluation of solvers for quantified Boolean formulas (QBFs), the second in a series of non-competitive events established with the a...
ECOOP
2008
Springer
13 years 11 months ago
2008
Springer
It is very hard to fix a software failure without being able to reproduce it. However, reproducing a failure is often difficult and time-consuming. This paper proposes a novel tech...
MVA
2007
13 years 10 months ago
2007
The problem of planning the Next Best View (NBV) still poses many questions. However, the achieved methods and algorithms are hard to compare, since researchers use their own test...
JSAT
2006
13 years 9 months ago
2006
This paper reports about the 2005 comparative evaluation of solvers for quantified Boolean formulas (QBFs), the third in a series of non-competitive events established with the ai...
TRIDENTCOM
2010
IEEE
13 years 7 months ago
2010
IEEE
Testing and evaluating new architectural propositions is a challenge. Given the usual variety of technologies and scales involved in the necessary evaluation, a one-size-fits-all a...