Results 21 to 30 of about 6,708,930 (288)
Binarisation for Valued Constraint Satisfaction Problems [PDF]
SIAM Journal on Discrete Mathematics, 2017 Subsumes 1507 ...
David A. Cohen +5 more
openaire +8 more sources
09441 Abstracts Collection – The Constraint Satisfaction Problem: Complexity and Approximability [PDF]
, 2010 From 25th to 30th October 2009, the Dagstuhl Seminar 09441 ``The Constraint Satisfaction Problem: Complexity and Approximability'' was held in Schloss Dagstuhl~--~Leibniz Center for Informatics.
Krokhin, Andrei +3 more
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
Automated static symmetry breaking in constraint satisfaction problems [PDF]
, 2011 Variable symmetries in constraint satisfaction problems can be broken by adding lexicographic ordering constraints. Existing general methods of generating such sets of ordering constraints can produce a huge number of additional constraints. This adds
Grayland, Andrews
core +2 more sources
University Course Timetabling using Constraint Programming [PDF]
مدیریت تولید و عملیات, 2017 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
Computer Assisted Methods in Engineering and Science, 2022 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
Improving harmony search algorithms by using tonal variation: the case of Sudoku and MKP
Connection Science, 2018 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
Good enough is better: feasibility vs. Pareto-optimality in alloy design [PDF]
Digital DiscoveryIn alloy design, the search for candidate materials is often framed as an optimization problem, with the goal of identifying Pareto-optimal solutions across multiple objectives.
Cayden Maguire +4 more
doaj +1 more source
Equivalence Constraint Satisfaction Problems.
Proceedings of CSL, 2012 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
Constraint Satisfaction Problems on Intervals and Lengths [PDF]
SIAM Journal on Discrete Mathematics, 2004 Summary: We study interval-valued Constraint Satisfaction Problems (CSPs), in which the aim is to find an assignment of intervals to a given set of variables subject to constraints on the relative positions of intervals. Many well-known problems such as INTERVAL GRAPH RECOGNITION and INTERVAL SATISFIABILITY can be considered as examples of such CSPs ...
Andrei A. Krokhin +2 more
openaire +4 more sources