Results 41 to 50 of about 5,971,608 (284)
An Extensive Evaluation of Portfolio Approaches for Constraint Satisfaction Problems
International Journal of Interactive Multimedia and Artificial Intelligence, 2016 In the context of Constraint Programming, a portfolio approach exploits the complementary strengths of a portfolio of different constraint solvers. The goal is to predict and run the best solver(s) of the portfolio for solving a new, unseen problem.
Roberto Amadini +2 more
doaj +1 more source
Compilation-Based Approaches to Parallel Planning: An Empirical Comparison
Proceedings of the International Florida Artificial Intelligence Research Society Conference, 2021 Automated planning deals with finding a sequence of actions, a plan, to reach a goal. One of the possible approaches to automated planning is a compilation of a planning problem to a Boolean satisfiability problem or to a constraint satisfaction problem,
Kristýna Pantůčková, Roman Barták
doaj +1 more source
A Hybrid Autonomic Computing-Based Approach to Distributed Constraint Satisfaction Problems
Computers, 2015 Distributed constraint satisfaction problems (DisCSPs) are among the widely endeavored problems using agent-based simulation. Fernandez et al. formulated sensor and mobile tracking problem as a DisCSP, known as SensorDCSP In this paper, we adopt a ...
Abhishek Bhatia +2 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
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
When the Decomposition Meets the Constraint Satisfaction Problem
IEEE Access, 2020 This paper explores the joint use of decomposition methods and parallel computing for solving constraint satisfaction problems and introduces a framework called Parallel Decomposition for Constraint Satisfaction Problems (PD-CSP).
Youcef Djenouri +5 more
doaj +1 more source
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