Sciweavers

13841 search results - page 295 / 2769
» Algorithms and Constraint Programming
Sort
View
SPIRE
2000
Springer
15 years 10 months ago
Fully Compressed Pattern Matching Algorithm for Balanced Straight-Line Programs
We consider a fully compressed pattern matching problem, where both text T and pattern P are given by its succinct representation, in terms of straight-line programs and its varia...
Masahiro Hirao, Ayumi Shinohara, Masayuki Takeda, ...
INFSOF
2006
73views more  INFSOF 2006»
15 years 6 months ago
Theory and algorithms for slicing unstructured programs
Program slicing identifies parts of a program that potentially affect a chosen computation. It has many applications in software engineering, including maintenance, evolution and ...
Mark Harman, Arun Lakhotia, David Binkley
179
Voted
MP
2006
73views more  MP 2006»
15 years 6 months ago
On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
We present a primal-dual interior-point algorithm with a filter line-search method for nonlinear programming. Local and global convergence properties of this method were analyzed i...
Andreas Wächter, Lorenz T. Biegler
ARTS
1999
Springer
15 years 11 months ago
Quantitative Program Logic and Performance in Probabilistic Distributed Algorithms
In this paper we show how quantitative program logic [14] provides a formal framework in which to promote standard techniques of program analysis to a context where probability and...
Annabelle McIver
CCO
2001
Springer
256views Combinatorics» more  CCO 2001»
15 years 11 months ago
General Mixed Integer Programming: Computational Issues for Branch-and-Cut Algorithms
In this paper we survey the basic features of state-of-the-art branch-and-cut algorithms for the solution of general mixed integer programming problems. In particular we focus on p...
Alexander Martin