In the latest years and with the advancements of the multicore computing world, the constraint programming community tried to benefit from the capacity of new machines and make the best use of them through several parallel schemes for constraint solving. In this paper, we present a new approach using parallel consistencies to enhance the classic solving process. In fact, a master process tries ...

1. Goals and constraints The primary goal of modern linguistic theory (at least in the circles I inhabit) is an explanation of the human language capacity and how it enables the child to acquire adult competence in language. Adult competence in turn is understood as the ability (or knowledge) to creatively map between sound and meaning, using a rich combinatorial system – the lexicon and gramma...

....................................................................................................................................v EXECUTIVE SUMMARY ........................................................................................................... vi CHAPTER 1 BACKGROUND ...................................................................................................1 CHAPTER 2 CH...

The effective capacity of communication systems over generalized κμ shadowed fading channels is investigated in this letter. A novel and analytical expression for the exact effective capacity is derived in terms of extended generalized bivariate Meijer’s-G function. To intuitively reveal the impact of the system and channel parameters on the effective capacity, we also derive closed-form expres...

The Job-Shop Scheduling Problem (JSSP) deals with the allocation of resources over time to factory operations. Allocations are subject to various constraints (e.g., production precedence relationships, factory capacity constraints, and limits on the allowable number of machine setups) which must be satisfied for a schedule to be valid. The identification of constraint violations and the monitor...

The development of watermarking schemes in the literature is generally guided by a power constraint on the watermark to be embedded into the host. In a steganographic framework there is an additional constraint on the embedding procedure. It states that, for a scheme to be undetectable by statistical means, the pdf of the host signal must be approximately or exactly equal to that of the stegote...

This paper presents a novel algorithm for the gateway placement problem in Backbone Wireless Mesh Networks (BWMNs). Different from existing algorithms, the new algorithm incrementally identifies gateways and assigns mesh routers to identified gateways. The new algorithm can guarantee to find a feasible gateway placement satisfying Quality-of-Service (QoS) constraints, including delay constraint...

In this paper, a special case of the vehicle routing problem in which the demands consist in a set of rectangular two-dimensional weighted items is considered. The vehicles have a two-dimensional loading surface and a maximum weight capacity. These problems have a routing and a packing component. A framework to handle the loading of a vehicle is proposed. A Constraint Programming loading model ...

Kanglin Liu Abstract Generative Adversarial Networks (GANs) are powerful generative models, but suffer from training instability. The recent proposed Wasserstein GAN with gradient penalty (WGAN-GP) makes progress toward stable training. Gradient penalty acts as the role of enforcing a Lipschitz constraint. Further investigation on gradient penalty shows that gradient penalty may impose restrict...

Feature models have been cited as one of the main contributions to model software product families. However, there is still a gap in product family engineering which is the automated reasoning on feature models. In this paper we describe how to reason on feature models using constraint programming. Although, there are a few attempts to reason on feature models there are two main drawbacks in th...