Results 81 to 90 of about 15,021 (304)
Landscape of Solutions in Constraint Satisfaction Problems [PDF]
Physical Review Letters, 2005 4 pages, 4 figures.
Mezard, Marc +2 more
openaire +5 more sources
Advanced Materials, EarlyView.Residual magnetization induces pronounced mechanical anisotropy in ultra‐soft magnetorheological elastomers, shaping deformation and actuation even without external magnetic fields. This study introduces a computational‐experimental framework integrating magneto‐mechanical coupling into topology optimization for designing soft magnetic actuators with ...
Carlos Perez‐Garcia +3 more
wiley +1 more source
Solving Boolean Satisfiability Problems With The Quantum Approximate Optimization Algorithm
PRX QuantumOne of the most prominent application areas for quantum computers is solving hard constraint satisfaction and optimization problems. However, detailed analyses of the complexity of standard quantum algorithms have suggested that outperforming classical ...
Sami Boulebnane, Ashley Montanaro
doaj +1 more source
Solving non-binary constraint satisfaction problems using GHD and restart.
ITEGAM-JETIAThe non-binary instances of the Constraint Satisfaction Problem (CSP) could be efficiently solved if their constraint hypergraphs have small generalized hypertree widths.
Fatima AIT HATRIT +1 more
doaj +1 more source
A Novel Strategy of Combining Variable Ordering Heuristics for Constraint Satisfaction Problems
IEEE Access, 2018 Variable ordering heuristic plays a central role in solving constraint satisfaction problems. Many heuristics have been proposed and well-studied.
Hongbo Li, Zhanshan Li
doaj +1 more source
Advanced Materials, EarlyView.The field of polymer thermoelectrics is entering a new era, featuring breakthroughs in addressing the conventional performance disparity between p‐type and n‐type polymers, pioneering doping frontiers, and sophisticated decoupling strategies. This review explores innovations in molecular design and superior stabilities, bridging the gap from ...
Suhao Wang
wiley +1 more source
, 2000 Copyright @ 2000 IEEEThis paper presents a constraint satisfaction adaptive neural network, together with several heuristics, to solve the generalized job-shop scheduling problem, one of NP-complete constraint satisfaction problems.
Yang, S +3 more
core +1 more source
Subsumption Algorithms for Three-Valued Geometric Resolution [PDF]
Logical Methods in Computer Science, 2018 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
Advanced Materials, EarlyView.Molecular doping of conjugated polymers is fundamentally constrained by thermodynamic phase behavior. This Perspective reframes doping efficiency and stability in terms of miscibility limits, binodals, and solvus boundaries, highlighting the role of effective interaction parameters and charge transfer.
Somayeh Kashani +10 more
wiley +1 more source
Efficient structural symmetry breaking for constraint satisfaction problems [PDF]
, 2007 Symmetry breaking for constraint satisfaction problems (CSPs) has attracted considerable attention in recent years. Various general schemes have been proposed to eliminate symmetries.
Van Hentenryck, Pascal +9 more
core