Sciweavers

2636 search results - page 249 / 528
» Linear Programming
Sort
View
SAS
2005
Springer
15 years 8 months ago
A Generic Framework for Interprocedural Analysis of Numerical Properties
Abstract. In his seminal paper [5], Granger presents an analysis which infers linear congruence relations between integer variables. For affine programs without guards, his analys...
Markus Müller-Olm, Helmut Seidl
SIAMJO
2008
212views more  SIAMJO 2008»
15 years 2 months ago
Convergence Rate of an Optimization Algorithm for Minimizing Quadratic Functions with Separable Convex Constraints
A new active set algorithm for minimizing quadratic functions with separable convex constraints is proposed by combining the conjugate gradient method with the projected gradient. ...
Radek Kucera
FAW
2007
Springer
177views Algorithms» more  FAW 2007»
15 years 9 months ago
The Parameterized Complexity of the Induced Matching Problem in Planar Graphs
Abstract. Given a graph G and a nonnegative integer k, the NP-complete Induced Matching problem asks for an edge subset M such that M is a matching and no two edges of M are joined...
Hannes Moser, Somnath Sikdar
TACAS
2010
Springer
146views Algorithms» more  TACAS 2010»
15 years 10 months ago
Ranking Function Synthesis for Bit-Vector Relations
Ranking function synthesis is a key aspect to the success of modern termination provers for imperative programs. While it is wellknown how to generate linear ranking functions for ...
Byron Cook, Daniel Kroening, Philipp Rümmer, ...
INFOCOM
2009
IEEE
15 years 9 months ago
Minimizing Probing Cost for Detecting Interface Failures: Algorithms and Scalability Analysis
— The automatic detection of failures in IP paths is an essential step for operators to perform diagnosis or for overlays to adapt. We study a scenario where a set of monitors se...
Hung Xuan Nguyen, Renata Teixeira, Patrick Thiran,...