33 search results - page 1 / 7 » Improving Constraint-Based Testing with Dynamic Linear Relax... |
84
Voted
ISSRE
2007
IEEE
15 years 13 days ago
2007
IEEE
Constraint-Based Testing (CBT) is the process of generating test cases against a testing objective by using constraint solving techniques. In CBT, testing objectives are given und...
129
Voted
ICST
2009
IEEE
14 years 8 months ago
2009
IEEE
Euclide is a new Constraint-Based Testing tool for verifying safety-critical C programs. By using a mixture of symbolic and numerical analyses (namely static single assignment for...
91
Voted
NIPS
2007
15 years 10 days ago
2007
Stability is a desirable characteristic for linear dynamical systems, but it is often ignored by algorithms that learn these systems from data. We propose a novel method for learn...
86
Voted
MP
2006
14 years 11 months ago
2006
Decomposition algorithms such as Lagrangian relaxation and Dantzig-Wolfe decomposition are well-known methods that can be used to generate bounds for mixed-integer linear programmi...
ICML
2010
IEEE
14 years 12 months ago
2010
IEEE
We propose a novel boosting algorithm which improves on current algorithms for weighted voting classification by striking a better balance between classification accuracy and the ...