Sciweavers

33 search results - page 1 / 7
» Improving Constraint-Based Testing with Dynamic Linear Relax...
Sort
View
ISSRE
2007
IEEE
13 years 6 months ago
Improving Constraint-Based Testing with Dynamic Linear Relaxations
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...
Tristan Denmat, Arnaud Gotlieb, Mireille Ducass&ea...
ICST
2009
IEEE
13 years 2 months ago
Euclide: A Constraint-Based Testing Framework for Critical C Programs
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...
Arnaud Gotlieb
NIPS
2007
13 years 6 months ago
A Constraint Generation Approach to Learning Stable Linear Dynamical Systems
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...
Sajid M. Siddiqi, Byron Boots, Geoffrey J. Gordon
MP
2006
110views more  MP 2006»
13 years 4 months ago
Decomposition and Dynamic Cut Generation in Integer Linear Programming
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...
Ted K. Ralphs, Matthew V. Galati
ICML
2010
IEEE
13 years 5 months ago
Boosting Classifiers with Tightened L0-Relaxation Penalties
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 ...
Noam Goldberg, Jonathan Eckstein