Results 51 to 60 of about 15,021 (304)
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 +3 more sources
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
Landscape analysis of constraint satisfaction problems [PDF]
Physical Review E, 2007 We discuss an analysis of Constraint Satisfaction problems, such as Sphere Packing, K-SAT and Graph Coloring, in terms of an effective energy landscape. Several intriguing geometrical properties of the solution space become in this light familiar in terms of the well-studied ones of rugged (glassy) energy landscapes.
Florent Krzakala, Jorge Kurchan
openaire +3 more sources
The Complexity of the Distributed Constraint Satisfaction Problem
Theory of Computing Systems, 2022 AbstractWe study the complexity of the Distributed Constraint Satisfaction Problem (DCSP) on a synchronous, anonymous network from a theoretical standpoint. In this setting, variables and constraints are controlled by agents which communicate with each other by sending messages through fixed communication channels.
Butti, S, Dalmau, V
openaire +5 more sources
Advanced Engineering Materials, EarlyView.A unified research data management framework for heterogeneous materials data is presented. The system integrates multimodal datasets using ontologies and knowledge graphs, enabling interoperability and FAIR (findable, accessible, interoperable, reusable) data principles. By linking data across scales and workflows, it supports reproducible, Artifitial
Doaa Mohamed +6 more
wiley +1 more source
Trying again to fail-first [PDF]
, 2004 For constraint satisfaction problems (CSPs), Haralick and Elliott [1] introduced the Fail-First Principle and defined in it terms of minimizing branch depth.
Richard J. Wallace +5 more
core +1 more source
Solving the Weighted Constraint Satisfaction Problems Via the Neural Network Approach
International Journal of Interactive Multimedia and Artificial Intelligence, 2016 A wide variety of real world optimization problems can be modelled as Weighted Constraint Satisfaction Problems (WCSPs). In this paper, we model this problem in terms of in original 0-1 quadratic programming subject to leaner constraints.
Khalid Haddouch +2 more
doaj +1 more source
Cores of Countably Categorical Structures [PDF]
Logical Methods in Computer Science, 2007 A relational structure is a core, if all its endomorphisms are embeddings. This notion is important for computational complexity classification of constraint satisfaction problems.
Manuel Bodirsky
doaj +1 more source
On constraint satisfaction problems below P [PDF]
Journal of Logic and Computation, 2014 Symmetric Datalog, a fragment of the logic programming language Datalog, is conjectured to capture all constraint satisfaction problems (CSP) in L. Therefore developing tools that help us understand whether or not a CSP can be defined in symmetric Datalog is an important task.
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 +6 more sources