Results 21 to 30 of about 15,438 (311)
Constraint Satisfaction Problems over Numeric Domains [PDF]
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
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
Compiling constraint satisfaction problems
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Rainer Weigel, Boi Faltings
openaire +2 more sources
A study of encodings of constraint satisfaction problems with 0/1 variables [PDF]
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
University Course Timetabling using Constraint Programming [PDF]
University course timetabling problem is a challenging and time-consuming task on the overall structure of timetable in every academic environment. The problem deals with many factors such as the number of lessons, classes, teachers, students and working
Hadi Shahmoradi +2 more
doaj
Constraint models for complex state transitions
Constraint-based scheduling is an approach for solving real-life scheduling problems by combining the generality of AI techniques with the efficiency of OR techniques. Basically, it describes a scheduling problem as a constraint satisfaction problem and
Roman Bartak
doaj
Equivalence Constraint Satisfaction Problems.
The following result for finite structures Gamma has been conjectured to hold for all countably infinite omega-categorical structures Gamma: either the model-complete core Delta of Gamma has an expansion by finitely many constants such that the pseudovariety generated by its polymorphism algebra contains a two-element algebra all of whose operations ...
Manuel Bodirsky, Michal Wrona
openaire +4 more sources
An improved constraint satisfaction adaptive neural network for job-shop scheduling [PDF]
Copyright @ Springer Science + Business Media, LLC 2009This paper presents an improved constraint satisfaction adaptive neural network for job-shop scheduling problems.
Yang, S +11 more
core +1 more source
Improving harmony search algorithms by using tonal variation: the case of Sudoku and MKP
In this paper we propose an improved Harmony Search (HS) version inspired in the tonal variation of jazz musical improvisation. To evaluate our approach we considered two well-known problems, a Constraint Satisfaction Problem: Sudoku, and a Constraint ...
Nicolás Rojas-Morales +1 more
doaj +1 more source
Non-model based structural damage assessment using improved analytical redundancy relations
A damage assessment problem can be stated as a constraint satisfaction problem utilizing the translational and rotational displacements of a structure as measurements.
Sheng-En Fang, Bao Zhang
doaj +1 more source

