Constraints satisfying problems

Lecture "Artificial intelligence - Lesson 4: Constraint satisfaction problems" presents the following contents: constraint satisfaction problems (CSP); backtracking search for CSPs; local search for CSPs. We invite you to take a look at the content of the lecture.

40p phuong3676 23-06-2023 6 4   Download

This paper proposes an Adaptive Selective Cuckoo Search Algorithm (ASCSA) for solving the multi-objective short-term hydrothermal scheduling (MOSTHTS). The main objective of the MOSTHTS problem is to minimize both total power generation cost and emission of thermal generators over a scheduling period while satisfying power balance, hydraulic, and generator operating limit constraints.

8p vidoctorstrange 06-05-2023 5 3   Download

This study develops an advanced tool for tackling constrained optimization problems based on an integration of feasibility rules and differential evolution metaheuristic. This tool aims at finding a solution with the most desired objective function value and concurrently satisfies all of the problem constraints. The optimization approach, named as feasibility rule based differential evolution (FRB-DE), has been developed in Microsoft Visual Studio with C# programming language. The newly developed tool has been tested with two optimization tasks in the field of civil engineering.

6p nguaconbaynhay12 01-06-2021 18 1   Download

The determination of protein structures satisfying distance constraints is an important problem in structural biology. Whereas the most common method currently employed is simulated annealing, there have been other methods previously proposed in the literature. Most of them, however, are designed to find one solution only.

15p vikentucky2711 26-11-2020 16 0   Download

nding economical designs of cantilever retaining wall is a crucial task in civil engineering. This problem can be formulated as a constrained nonlinear optimization problem in which the objective is to identify a design solution having the lowest cost and satisfying all the required constraints.

6p viputrajaya2711 22-06-2020 11 1   Download

This study considers a sequential batching problem with a minimum quantity commitment (MQC) constraint in N-level non-exclusive agglomerative hierarchical clustering structures (AHCSs). In this problem, batches are created for item types included in clusters according to the sequence of the levels in a given AHCS such that the MQC constraint as well as the maximum and minimum batch size requirements are satisfied, simultaneously.

24p toritori 11-05-2020 17 0   Download

Computing the optimal geometric structure of manipulators is one of the most intricate problems in contemporary robot kinematics. Robotic manipulators are designed and built to perform certain predetermined tasks. There is a very close relationship between the structure of the manipulator and its kinematic performance. It is therefore important to incorporate such task requirements during the design and synthesis of the robotic manipulators.

14p trinhthamhodang1 16-11-2019 14 0   Download

In this paper, the roads planning in the resort are taken as an example of application in Genetic Algorithm. Modeling the problem with target function and constraint condition to satisfy the minimum construction cost (which is converged to the minimum total length of roads), the problem is solved by using Genetic Algorithm with random operation in MATLAB.

4p cathydoll5 27-02-2019 27 1   Download

Outline:
Problem-solving agents, Problem types, Problem formulation, Example problems, Basic search algorithms. Replace letters by numbers from 0 to 9 such as no different letter is replaced by the same number and satisfying the following constraint.

17p lalala06 02-12-2015 47 2   Download

This work is concerned with the development of instruments for GB parsing. An alternative to the well known indexation system of (Chomsky, 1981) will be proposed and then used to formalize the view of Binding Theory in terms of the generation of constraints on the referential properties of the NPs of a sentence. Finally the problems of verification and satisfiability of BT will be addressed within the proposed framework.

6p buncha_1 08-05-2013 38 3   Download

Taken abstractly, the two-level (Kimmo) morphological framework allows computationally difficult problems to arise. For example, N + 1 small a u t o m a t a are sufficient to encode the Boolean satisfiability problem (SAT) for formulas in N variables. However, the suspicion arises that natural-language problems may have a special structure - not shared with SAT - - that is not directly captured in the two-level model. In particular, the natural problems may generally have a modular and local nature that distinguishes them from more "global" SAT problems.

8p bungio_1 03-05-2013 50 2   Download

In this paper I will consider parsing as a discrete combinatorial problem which consists in constructing a labeled graph that satisfies a set of linguistic constraints. I will identify some properties of linguistic constraints which allow this problem to be solved efficiently using constraint satisfaction algorithms. I then describe briefly a modular parsing algorithm which constructs a syntactic graph using a set of generative operations and applies a filtering algorithm to eliminate inconsistent nodes and edges. ...

2p bunmoc_1 20-04-2013 39 1   Download

In the general framework of a constraint-based grammar formalism often some sort of feature logic serves as the constraint language to describe linguistic objects. We investigate the extension of basic feature logic with subsumption (or matching) constraints, based on a weak notion of subsumption. This mechanism of oneway information flow is generally deemed to be necessary to give linguistically satisfactory descriptions of coordination phenomena in such formalisms.

8p bunmoc_1 20-04-2013 40 1   Download

Aligning words from sentences which are mutual translations is an important problem in different settings, such as bilingual terminology extraction, Machine Translation, or projection of linguistic features. Here, we view word alignment as matrix factorisation. In order to produce proper alignments, we show that factors must satisfy a number of constraints such as orthogonality.

8p bunbo_1 17-04-2013 58 1   Download

Can these two images be reconciled? How to do we blend Zen and the underlying wisdom it represents with project management and its quest for satisfying people and organizations with valuable outcomes within time and cost constraints? Blending Zen and project management enables us to more effec- tively manage projects to get the results we want, when we want them, for the price we expect to pay. This is the outer work—perfecting the form and perfecting its results.

15p lenh_hoi_xung 21-02-2013 53 4   Download

We study several constrained variational problems in the 2-Wasserstein metric for which the set of probability densities satisfying the constraint is not closed. For example, given a probability density F0 on Rd and a time-step 2 h 0, we seek to minimize I(F ) = hS(F )+W2 (F0 , F ) over all of the probability densities F that have the same mean and variance as F0 , where S(F ) is the entropy of F . We prove existence of minimizers. We also analyze the induced geometry of the set of densities satisfying the constraint on...

41p tuanloccuoi 04-01-2013 49 7   Download

Search algorithms aim to find solutions or objects with specified properties and constraints in a large solution search space or among a collection of objects. A solution can be a set of value assignments to variables that will satisfy the constraints or a sub-structure of a given discrete structure. In addition, there are search algorithms, mostly probabilistic, that are designed for the prospective quantum computer.

0p cucdai_1 19-10-2012 58 3   Download

In real-world optimization applications, stakeholders require multiple and complex constraints, which are difficult to satisfy and make complicated to find satisfactory solutions. In the most cases, we face over-constrained optimization problems (no satisfactory solution can be found) because of the stakeholders’ multiple requirements and the various and complex constraints to be satisfied. Solving over-constrained problems is based on the relaxation of some constraints according to values of preferences in order to favour the satisfaction of the most relevant....

294p bi_bi1 11-07-2012 104 8   Download