Results 61 to 70 of about 15,438 (311)
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
Dynamic ICSP Graph Optimization Approach for Car-Like Robot Localization in Outdoor Environments
Localization has been regarded as one of the most fundamental problems to enable a mobile robot with autonomous capabilities. Probabilistic techniques such as Kalman or Particle filtering have long been used to solve robotic localization and mapping ...
Zhan Wang, Alain Lambert, Xun Zhang
doaj +1 more source
Expected number of locally maximal solutions for random Boolean CSPs [PDF]
For a large number of random Boolean constraint satisfaction problems, such as random $k$-SAT, we study how the number of locally maximal solutions evolves when constraints are added.
Nadia Creignou +2 more
doaj +1 more source
An invitation to the promise constraint satisfaction problem
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
Fatigue Crack Initiation and Growth in Nanocrystalline Ni at Multiple Length‐Scales
Overview of miniaturized in situ SEM fatigue setup and resultant fatigue crack growth data for nanocrystalline Ni. The presented study focuses on the analysis of fatigue crack growth rate (FCGR) in focused ion beam‐notched microcantilevers prepared from nanocrystalline (NC) Ni as a model material.
Igor Moravcik +7 more
wiley +1 more source
Supermodularity on chains and complexity of maximum constraint satisfaction [PDF]
In the maximum constraint satisfaction problem ($\mathrm{Max \; CSP}$), one is given a finite collection of (possibly weighted) constraints on overlapping sets of variables, and the goal is to assign values from a given finite domain to the variables so ...
Vladimir Deineko +3 more
doaj +1 more source
Fully intuitionistic fuzzy multi-level linear fractional programming problem
In many real situations, it is frequently difficult to accurately determine the membership and non-membership degrees related to an element of the set with complete satisfaction because of the ambiguity in the input data.
E. Fathy, E. Ammar, M.A. Helmy
doaj +1 more source
This paper describes a new approach to decompose constraint satisfaction problems (CSPs) using an auxiliary constraint satisfaction optimization problem (CSOP) that detects sub-CSPs which share only few common variables. The purpose of this approach is to find sub-CSPs which can be solved in parallel and combined to a complete solution of the original ...
Sven Löffler +2 more
openaire +1 more source
Robust satisfiability of constraint satisfaction problems [PDF]
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 +3 more sources
A Lightweight Procedural Layer for Hybrid Experimental–Computational Workflows in Materials Science
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

