Results 81 to 90 of about 5,971,608 (284)
This perspective reframes additive manufacturing for electrical machines as a qualification‐limited materials and architecture design problem. It links process–structure–property–performance relationships to magnetic, conducting, dielectric, and thermal property windows, highlighting where AM can enable segmented magnetic circuits, permanent magnet ...
Dénes Fodor, Loránd Szabó
wiley +1 more source
Random constraint satisfaction problems (CSP) have been studied extensively using statistical physics techniques. They provide a benchmark to study average case scenarios instead of the worst case one.
Silvio Franz, Giorgio Parisi, Maksim Sevelev, Pierfrancesco Urbani, Francesco Zamponi
doaj +1 more source
Extremal eigenvalues of local Hamiltonians [PDF]
We apply classical algorithms for approximately solving constraint satisfaction problems to find bounds on extremal eigenvalues of local Hamiltonians.
Aram W. Harrow, Ashley Montanaro
doaj +1 more source
Landscape of Solutions in Constraint Satisfaction Problems [PDF]
4 pages, 4 figures.
Mezard, Marc +2 more
openaire +6 more sources
The physical realization of artificial neurons is a critical challenge for energy‐efficient neuromorphic computing. This review presents a comprehensive analysis of the evolution of artificial neuron implementations from conventional CMOS to emerging post‐CMOS technologies.
Kannan Udaya Mohanan +4 more
wiley +1 more source
Quantified Constraint Handling Rules [PDF]
We shift the QCSP (Quantified Constraint Satisfaction Problems) framework to the QCHR (Quantified Constraint Handling Rules) framework by enabling dynamic binder and access to user-defined constraints.
Vincent Barichard, Igor Stéphan
doaj +1 more source
Physics‐Grounded Materials Artificial Intelligence for Reliable Materials Discovery
Physics‐Grounded Materials AI (PhysMat AI) integrates physical priors, descriptors, constraints, verification, and data infrastructure into a unified full‐stack framework, enabling reliable, interpretable, and autonomous AI‐driven materials discovery.
Yuhang Wang +3 more
wiley +1 more source
Subsumption Algorithms for Three-Valued Geometric Resolution [PDF]
In our implementation of geometric resolution, the most costly operation is subsumption testing (or matching): One has to decide for a three-valued, geometric formula, if this formula is false in a given interpretation.
Hans de Nivelle
doaj +1 more source
Strong subalgebras and the Constraint Satisfaction Problem
In 2007 it was conjectured that the Constraint Satisfaction Problem (CSP) over a constraint language $Γ$ is tractable if and only if $Γ$ is preserved by a weak near-unanimity (WNU) operation. After many efforts and partial results, this conjecture was independently proved by Andrei Bulatov and the author in 2017.
openaire +4 more sources
Advanced ink systems for solution‐processed textile triboelectric nanogenerators are systematically summarized, spanning conductive, tribo‐negative, and tribo‐positive layers. By connecting ink chemistry, deposition methods, and device function, the present review reveals the key governing principles of solution development and highlights practical ...
Xinlong Sun, Stephen Beeby
wiley +1 more source

