We propose an approach to parsing Constraint Grammars using finite-state transducers and report on a compiler that converts Constraint Grammar rules into transducer representations. The resulting transducers are further optimized by conversion to left and right sequential transducers. Using the method, we show that we can improve on the worstcase asymptotic bound of Constraint Grammar parsing f...

In this paper, we deal with the two-stage assembly flow shop scheduling problem with an availability constraint. The objective is to minimize the maximum completion time of the jobs (i.e. makespan). We are interested in the nonresumable model. We provide two heuristics with tight worst-case ratio bound of 2 when the availability constraint is imposed on one of the first stage’s machines. For th...

We present a new upper bound for the computational complexity of the parsing problem for TAGs, under the constraint that input is read from left to right in a way that errors in the input are observed as soon as possible, which is called the correct-preex property. The former upper bound was O(n 9), which we now improve to O(n 6), which is the same as that of practical parsing algorithms for TA...

We present new capacity upper bounds for the discrete-time Poisson channel with no dark current and an average-power constraint. These bounds are a simple consequence of techniques developed by one of the authors for the seemingly unrelated problem of upper bounding the capacity of binary deletion and repetition channels. Previously, the best known capacity upper bound in the regime where the a...

We study decompositions of NVALUE, a global constraint that can be used to model a wide range of problems where values need to be counted. Whilst decomposition typically hinders propagation, we identify one decomposition that maintains a global view as enforcing bound consistency on the decomposition achieves bound consistency on the original global NVALUE constraint. Such decompositions offer ...

A super-replication problem with a gamma constraint, introduced in [12], is studied in the context of the one-dimensional Black and Scholes model. Several representations of the minimal super-hedging cost are obtained using the characterization derived in [3]. It is shown that the upper bound constraint on the gamma implies that the optimal strategy consists in hedging a conveniently face-lifte...

Many production planning problems call for the minimization of stocking/storage costs. This paper introduces a new global constraint StockingCost([X1, . . . , Xn], [d1, . . . , dn],H, c) that holds when each item Xi is produced on or before its due date di, the capacity c of the machine is respected, and H is an upper bound on the stocking cost. We propose a linear time algorithm to achieve bou...

In this paper, we are concerned with the stability of the error bounds for semi-infinite convex constraint systems. Roughly speaking, the error bound of a system of inequalities is said to be stable if all its “small” perturbations admit a (local or global) error bound. We first establish subdifferential characterizations of the stability of error bounds for semi-infinite systems of convex ineq...

Two types of errors can occur when discriminating pairs quantum states. Asymmetric state discrimination involves minimizing the probability one type error, subject to a constraint on other. We give explicit expressions bounding set achievable errors, using trace norm, fidelity, and Chernoff bound. The upper bound is asymptotically tight lower exact for pure Unlike asymptotic bounds, our bounds ...