Results 41 to 50 of about 6,708,930 (288)
Google vs IBM: A Constraint Solving Challenge on the Job-Shop Scheduling Problem [PDF]
Electronic Proceedings in Theoretical Computer Science, 2019 The job-shop scheduling is one of the most studied optimization problems from the dawn of computer era to the present day. Its combinatorial nature makes it easily expressible as a constraint satisfaction problem.
Giacomo Da Col, Erich Teppan
doaj +1 more source
An invitation to the promise constraint satisfaction problem
ACM SIGLOG News, 2022 The study of the complexity of the constraint satisfaction problem (CSP), centred around the Feder-Vardi Dichotomy Conjecture, has been very prominent in the last two decades. After a long concerted effort and many partial results, the Dichotomy Conjecture has been proved in 2017 independently by Bulatov and Zhuk.
Andrei A. Krokhin, Jakub Oprsal
openaire +3 more sources
Linear Datalog and Bounded Path Duality of Relational Structures [PDF]
Logical Methods in Computer Science, 2005 In this paper we systematically investigate the connections between logics with a finite number of variables, structures of bounded pathwidth, and linear Datalog Programs.
Victor Dalmau
doaj +1 more source
International Journal of Naval Architecture and Ocean Engineering, 2022 The object of the long-term planning in shipyards is to assign the ordered vessels to the berths with the consideration of the workload balancing. However, there are limitations in establishing an optimized long-term plan because the workload balancing ...
Dong Hoon Kwak +4 more
doaj +1 more source
Constraint satisfaction problems and global cardinality constraints [PDF]
Communications of the ACM, 2010 In a constraint satisfaction problem (CSP) the goal is to find an assignment of a given set of variables subject to specified constraints. A global cardinality constraint is an additional requirement that prescribes how many variables must be assigned a certain value.
Andrei A. Bulatov, Dániel Marx
openaire +2 more sources
On Redundancy in Constraint Satisfaction Problems.
, 2022 A constraint language Γ has non-redundancy f(n) if every instance of CSP(Γ) with n variables contains at most f(n) non-redundant constraints. If Γ has maximum arity r then it has non-redundancy O(n^r), but there are notable examples for which this upper bound is far from the best possible.
openaire +4 more sources
Symmetry Definitions for Constraint Satisfaction Problems [PDF]
Constraints, 2005 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
David A. Cohen +4 more
openaire +7 more sources
Observer‐Based Adaptive Event‐Triggered Tracking Control for Fuzzy TS Systems With Premise Mismatch
International Journal of Adaptive Control and Signal Processing, EarlyView.This paper presents an adaptive logistic event‐triggered observer‐based tracking controller for Takagi‐Sugeno fuzzy systems under constrained inputs and network delays. Leveraging a hybrid LMI and Secretary Bird Optimization approach, this strategy significantly minimizes communication overhead and computational burden while ensuring optimal reference ...
Oussama Djadane +3 more
wiley +1 more source
Harmony search algorithm with adaptive parameter setting for solving large bin packing problems [PDF]
Decision Science Letters, 2020 Bin packing problem is a constrained optimization problem with a huge search space due to large combinations. Bin packing problem has a wide range of applications in multiple fields.
Amol C. Adamuthe , Tushar Nitave
doaj +1 more source
A Workflow to Accelerate Microstructure‐Sensitive Fatigue Life Predictions
Advanced Engineering Materials, EarlyView.This study introduces a workflow to accelerate predictions of microstructure‐sensitive fatigue life. Results from frameworks with varying levels of simplification are benchmarked against published reference results. The analysis reveals a trade‐off between accuracy and model complexity, offering researchers a practical guide for selecting the optimal ...
Luca Loiodice +2 more
wiley +1 more source