Sciweavers

3007 search results - page 98 / 602
» Linear Functional Fixed-points
Sort
View
MP
2007
142views more  MP 2007»
14 years 11 months ago
Active-constraint variable ordering for faster feasibility of mixed integer linear programs
The selection of the branching variable can greatly affect the speed of the branch and bound solution of a mixed-integer or integer linear program. Traditional approaches to branc...
Jagat Patel, John W. Chinneck
ICCAD
2006
IEEE
126views Hardware» more  ICCAD 2006»
15 years 8 months ago
Exploring linear structures of critical path delay faults to reduce test efforts
It has been shown that the delay of a target path can be composed linearly of other path delays. If the later paths are robustly testable (with known delay values), the target pat...
Shun-Yen Lu, Pei-Ying Hsieh, Jing-Jia Liou
FOSSACS
2007
Springer
15 years 3 months ago
The Complexity of Generalized Satisfiability for Linear Temporal Logic
In a seminal paper from 1985, Sistla and Clarke showed that satisfiability for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the set of tempora...
Michael Bauland, Thomas Schneider 0002, Henning Sc...
AUTOMATICA
2010
96views more  AUTOMATICA 2010»
14 years 12 months ago
On resampling and uncertainty estimation in Linear System Identification
Linear System Identification yields a nominal model parameter, which minimizes a specific criterion based on the single inputoutput data set. Here we investigate the utility of va...
Simone Garatti, Robert R. Bitmead
PAMI
2007
176views more  PAMI 2007»
14 years 11 months ago
Approximate Labeling via Graph Cuts Based on Linear Programming
A new framework is presented for both understanding and developing graph-cut based combinatorial algorithms suitable for the approximate optimization of a very wide class of MRFs ...
Nikos Komodakis, Georgios Tziritas