Results 51 to 60 of about 5,971,608 (284)
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 +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
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
Robust satisfiability of constraint satisfaction problems [PDF]
Proceedings of the forty-fourth annual ACM symposium on Theory of computing, 2012 An algorithm for a constraint satisfaction problem is called robust if it outputs an assignment satisfying at least (1-g(e))-fraction of the constraints given a (1-e)-satisfiable instance, where g(e) -> 0 as e -> 0, $g(0)=0. Guruswami and Zhou conjectured a characterization of constraint languages for which the corresponding constraint satisfaction ...
Libor Barto, Marcin Kozik
openaire +4 more sources
Advanced Engineering Materials, EarlyView.We develop a data‐driven method to derive the mathematical expressions of the Flory–Huggins interaction parameter χ for the swelling behavior of temperature–responsive hydrogels. Starting from initial assumptions of χ, our workflow combines Bayesian optimization, Flory–Rehner theory, and symbolic regression to generate candidate χ expressions.
Yawen Wang +2 more
wiley +1 more source
Counting Constraint Satisfaction Problems [PDF]
, 2017 This chapter surveys counting Constraint Satisfaction Problems (counting CSPs, or #CSPs) and their computational complexity. It aims to provide an introduction to the main concepts and techniques, and present a representative selection of results and ...
Jerrum, Mark
core +1 more source
Promise constraint satisfaction problems
, 2022 The promise constraint satisfaction problem (PCSP) is a recently introduced vast generalisation of the constraint satisfaction problem (CSP) that captures approximability of satisfiable instances. A PCSP instance comes with two forms of each constraint: a strict one and a weak one. Given the promise that a solution exists under the strict constraints,
openaire +3 more sources
A Lightweight Procedural Layer for Hybrid Experimental–Computational Workflows in Materials Science
Advanced Engineering Materials, EarlyView.We unveil a prototype hybrid‐workflow framework that fuses automatedcomputation with hands‐on experiments. Built atop pyiron, a lightweight, parameterized layer translates procedure descriptions into executable manual steps, syncing instrument settings, human interventions, and data capture in real‐time today.
Steffen Brinckmann +8 more
wiley +1 more source
Parameterized Constraint Satisfaction Problems: a Survey [PDF]
, 2017 We consider constraint satisfaction problems parameterized above or below guaranteed values. One example is MaxSat parameterized above m/2: given a CNF formula F with m clauses, decide whether there is a truth assignment that satisfies at least m/2 + k ...
Gutin, Gregory, Yeo, Anders
core +1 more source
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