critical path method (cpm) is one of the most popular techniques used by construction practitioners for construction project scheduling since the 1950s. despite its popularity, cpm has a major shortcoming, as it is schedule based on two impractical acceptance that the project deadline is not bounded and that resources are unlimited. the analytical competency and computing capability of cpm thus...

We study methods for transforming valued constraint satisfaction problems (VCSPs) to binary VCSPs. First, we show that the standard dual encoding preserves many aspects of the algebraic properties that capture the computational complexity of VCSPs. Second, we extend the reduction of CSPs to binary CSPs described by Bulín et al. [LMCS’15] to VCSPs. This reduction establishes that VCSPs over a fi...

In this paper, by utilizing fixed-time control technique and a leader-follower scheme, three-dimensional (3-D) cooperative guidance law is developed to tackle impact angle constrained simultaneous arrival problem. Firstly, in the line-of-sight (LOS) direction, command for leader put forward make time error converge zero fixed such that capable of reaching target at prespecified time. Then, each...

In this paper we consider a fractional optimization problem that minimizes the ratio of two quadratic functions subject to a strictly convex quadratic constraint. First using the extension of Charnes-Cooper transformation, an equivalent homogenized quadratic reformulation of the problem is given. Then we show that under certain assumptions, it can be solved to global optimality using semidefini...

  Semidefinite optimization relaxations are among the widely used approaches to find global optimal or approximate solutions for many nonconvex problems. Here, we consider a specific quadratically constrained quadratic problem with an additional linear constraint. We prove that under certain conditions the semidefinite relaxation approach enables us to find a global optimal solution of the unde...

This paper describes a method for compiling a constraint-based grammar into a potentially more efficient form for processing. This method takes dependent disjunctions within a constraint formula and factors them into non-interacting groups whenever possible by determining their independence. When a group of dependent disjunctions is split into smaller groups, an exponential amount of redundant ...

We study the CARDPATH constraint. This ensures a given constraint holds a number of times down a sequence of variables. We show that SLIDE, a special case of CARDPATH where the slid constraint must hold always, can be used to encode a wide range of sliding sequence constraints including CARDPATH itself. We consider how to propagate SLIDE and provide a complete propagator for CARDPATH. Since pro...

Constraints are a natural mechanism for the speci cation of similarity queries on time-series data. However, to realize the expressive power of constraint programming in this context, one must provide the matching implementation technology for e cient indexing of very large data sets. In this paper, we formalize the intuitive notions of exact and approximate similarity between time-series patte...

SEQUITUR is an algorithm that infers a hierarchical structure from a sequence of discrete symbols by replacing repeated phrases with a grammatical rule that generates the phrase, and continuing this process recursively. The result is a hierarchical representation of the original sequence, which offers insights into its lexical structure. The algorithm is driven by two constraints that reduce th...

It it shown that the first-order theory of an automatic structure, whose Gaifman graph has bounded degree, is decidable in doubly exponential space (for injective automatic presentations, this holds even uniformly). Presenting an automatic structure of bounded degree whose theory is hard for 2EXPSPACE, we also prove this result to be optimal. These findings close the gap left open in [14].