We consider a quadratic programming (QP) problem (Π) of the form min xT Cx subject to Ax ≥ b where C ∈ Rn×n + , rank(C) = 1 and A ∈ Rm×n , b ∈ Rm . We present an FPTAS ...
Constraints that are defined by tables of allowed tuples of assignments are common in constraint programming. In this paper we present an approach to reformulating table constraint...
Abstract. We present an algorithm for inverse computation in a rstorder functional language based on the notion of a perfect process tree. The Universal Resolving Algorithm (URA) i...
Abstract. We introduce the notion of regular cost functions: a quantitative extension to the standard theory of regular languages. We provide equivalent characterisations of this n...
There are many commercial software security assurance tools that claim to detect and prevent vulnerabilities in application software. However, a closer look at the tools often lea...