Results 21 to 30 of about 15,021 (304)
Prioritised fuzzy constraint satisfaction problems: axioms, instantiation and validation [PDF]
, 2003 This paper identifies a generic axiom framework for prioritised fuzzy constraint satisfaction problems (PFCSPs), and proposes methods to instantiate it (i.e., to construct specific schemes which obey the generic axiom framework).
Luo, X. +14 more
core +1 more source
A study of encodings of constraint satisfaction problems with 0/1 variables [PDF]
, 2003 Many constraint satisfaction problems (csp's) are formulated with 0/1 variables. Sometimes this is a natural encoding, sometimes it is as a result of a reformulation of the problem, other times 0/1 variables make up only a part of the problem. Frequently
Patrick Prosser +3 more
core +1 more source
Sensitive instances of the Constraint Satisfaction Problem
CoRR, 2020 We investigate the impact of modifying the constraining relations of a Constraint Satisfaction Problem (CSP) instance, with a fixed template, on the set of solutions of the instance. More precisely we investigate sensitive instances: an instance of the CSP is called sensitive, if removing any tuple from any constraining relation invalidates some ...
Barto, Libor +3 more
openaire +5 more sources
IET Control Theory & Applications, 2023 This paper aims to discuss the approach of constrained modified feedback linearization model predictive control for the spacecraft simulator. By utilizing the high accuracy and constrained properties of model predictive control (MPC), an optimum MPC is ...
Maria Khodaverdian, Maryam Malekzadeh
doaj +1 more source
Counting Constraint Satisfaction Problems [PDF]
, 2017 This chapter surveys counting Constraint Satisfaction Problems (counting CSPs, or #CSPs) and their computational complexity. It aims to provide an introduction to the main concepts and techniques, and present a representative selection of results and ...
Jerrum, Mark
core +1 more source
IEEE Access, 2023 Striking a balance between objective optimization and constraint satisfaction is essential for solving constrained multi-objective optimization problems (CMOPs).
Kaiwen Zhao, Peng Wang, Xiangrong Tong
doaj +1 more source
Quantum-accelerated constraint programming [PDF]
Quantum, 2021 Constraint programming (CP) is a paradigm used to model and solve constraint satisfaction and combinatorial optimization problems. In CP, problems are modeled with constraints that describe acceptable solutions and solved with backtracking tree search ...
Kyle E. C. Booth +4 more
doaj +1 more source
Parameterized Constraint Satisfaction Problems: a Survey [PDF]
, 2017 We consider constraint satisfaction problems parameterized above or below guaranteed values. One example is MaxSat parameterized above m/2: given a CNF formula F with m clauses, decide whether there is a truth assignment that satisfies at least m/2 + k ...
Gutin, Gregory, Yeo, Anders
core +1 more source
IEEE Access, 2017 Arc consistency is the most popular filtering technique for solving constraint satisfaction problems. Constraint check plays a central role in establishing arc consistency.
Hongbo Li
doaj +1 more source
Constraint Satisfaction Problems over Numeric Domains [PDF]
, 2017 We present a survey of complexity results for constraint satisfaction problems (CSPs) over the integers, the rationals, the reals, and the complex numbers.
Mamino, Marcello, Bodirsky, Manuel
core +1 more source