Results 171 to 180 of about 15,021 (304)
An event-based architecture for solving constraint satisfaction problems. [PDF]
Mostafa H, Müller LK, Indiveri G.
europepmc +1 more source
Traction Force Microscopy for Viscoelastic Substrates: A Semi‐Analytical Method
A semi‐analytical viscoelastic traction force microscopy framework is introduced for quantifying time‐resolved cell tractions on flat finite‐thickness substrates. The method generalizes elastic traction force microscopy to Generalized Maxwell materials, identifies when elastic approximations remain valid and, when they do not, shows that inferred ...
Adrià Villacrosa‐Ribas +10 more
wiley +1 more source
Solving very large distributed constraint satisfaction problems
This thesis investigates issues with existing approaches to distributed constraint satisfaction, and proposes a solution in the form of a new algorithm. These issues are most evident when solving large distributed constraint satisfaction problems, hence ...
Peter Harvey (1995346)
core
Experimental Matching of Instances to Heuristics for Constraint Satisfaction Problems. [PDF]
Moreno-Scott JH +3 more
europepmc +1 more source
Physics‐Embedded Neural Network: A Novel Approach to Design Polymeric Materials
Traditional black‐box models for polymer mechanics rely solely on data and lack physical interpretability. This work presents a physics‐embedded neural network (PENN) that integrates constitutive equations into machine learning. The approach ensures reliable stress predictions, provides interpretable parameters, and enables performance‐driven, inverse ...
Siqi Zhan +8 more
wiley +1 more source
Sustainable Materials Design With Multi‐Modal Artificial Intelligence
Critical mineral scarcity, high embodied carbon, and persistent pollution from materials processing intensify the need for sustainable materials design. This review frames the problem as multi‐objective optimization under heterogeneous, high‐dimensional evidence and highlights multi‐modal AI as an enabling pathway.
Tianyi Xu +8 more
wiley +1 more source
We describe a genetic algorithm for the partial constraint satisfaction problem. The typical elements of a genetic algorithm, selection, mutation and cross-over, are filled in with combinatorial ideas.
Kolen, Antoon
core
Constraint Satisfaction Techniques for Combinatorial Problems
The last two decades have seen extraordinary advances in tools and techniques for constraint satisfaction. These advances have in turn created great interest in their industrial applications.
Narvaez, David E
core
Interpretable machine learning reveals how composition and processing govern the formation and microstructural burden of Fe‐rich intermetallic compounds in recycled Al–Si–Fe–Mn alloys. By separating morphology selection from morphology‐conditioned burden partitioning, this framework shows that identical Fe contents can yield different intermetallic ...
Jaemin Wang +2 more
wiley +1 more source
A physics‐informed property‐bridging framework links high‐throughput hardness screening to tensile performance in quenching and partitioning steels. By transferring metallurgically guided representations across properties, a single alloy composition is designed to achieve multiple strength grades through heat‐treatment tuning alone, offering a ...
Xiaolu Wei +7 more
wiley +1 more source

