Results 61 to 70 of about 15,021 (304)

Additive Manufacturing of Continuous Fibre Reinforced Composites: Process, Characterisation, Modelling, and Sustainability

open access: yesAdvanced Engineering Materials, EarlyView.
Additive manufacturing provides precise control over the placement of continuous fibres within polymer matrices, enabling customised mechanical performance in composite components. This article explores processing strategies, mechanical testing, and modelling approaches for additive manufactured continuous fibre‐reinforced composites.
Cherian Thomas, Amir Hosein Sakhaei
wiley   +1 more source

Phase transition behaviour in constraint satisfaction problems [PDF]

open access: yes, 1997
Many problems in artificial intelligence and computer science can be formulated as constraint satisfaction problems (CSPs). A CSP consists of a set of variables among which a set of constraints are imposed, with a solution corresponding to an assignment ...
Stuart Alexander Grant   +1 more
core  

Solving finite-domain linear constraints in presence of the $\texttt{alldifferent}$ [PDF]

open access: yesLogical Methods in Computer Science, 2017
In this paper, we investigate the possibility of improvement of the widely-used filtering algorithm for the linear constraints in constraint satisfaction problems in the presence of the alldifferent constraints. In many cases, the fact that the variables
Milan Banković
doaj   +1 more source

Symbolic Regression and Multi‐Objective Optimization of the Flory–Huggins Interaction Parameter for Hydrogels

open access: yesAdvanced 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

Improving harmony search algorithms by using tonal variation: the case of Sudoku and MKP

open access: yesConnection 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

Joining Constraint Satisfaction Problems and Configurable CAD Product Models: A Step-by-Step Implementation Guide

open access: yesAlgorithms, 2022
In configuration design, the task is to compose a system out of a set of predefined, modu-lar building blocks assembled by defined interfaces. Product configuration systems, both with or without integration of geometric models, implement reasoning ...
Paul Christoph Gembarski
doaj   +1 more source

An invitation to the promise constraint satisfaction problem

open access: yesACM 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

Fatigue Crack Initiation and Growth in Nanocrystalline Ni at Multiple Length‐Scales

open access: yesAdvanced Engineering Materials, EarlyView.
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

09441 Abstracts Collection – The Constraint Satisfaction Problem: Complexity and Approximability [PDF]

open access: yes, 2010
From 25th to 30th October 2009, the Dagstuhl Seminar 09441 ``The Constraint Satisfaction Problem: Complexity and Approximability'' was held in Schloss Dagstuhl~--~Leibniz Center for Informatics.
Krokhin, Andrei   +3 more
core   +1 more source

Decomposing Constraint Satisfaction Problems by Means of Meta Constraint Satisfaction Optimization Problems

open access: yesProceedings of the 11th International Conference on Agents and Artificial Intelligence, 2019
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

Home - About - Disclaimer - Privacy