Results 111 to 120 of about 5,971,608 (284)
Effective compilation of constraint models [PDF]
, 2010 Constraint Programming is a powerful technique for solving large-scale combinatorial (optimisation) problems. However, it is often inaccessible to users without expert knowledge in the area, precluding the wide-spread use of Constraint Programming ...
Rendl, Andrea
core +2 more sources
Parameterized complexity of constraint satisfaction problems [PDF]
computational complexity, 2004 We prove a parameterized analog of Schaefer's Dichotomy Theorem: we show that for every finite boolean constraint family ?, deciding whether a formula containing constraints from ? has a satisfying assignment of weight exactly k is either fixed-parameter tractable (FPT) or W[1]-complete.
openaire +3 more sources
Closed‐Loop Solid‐State Synthesis Planning for Materials Discovery With Large Language Models
Advanced Materials, EarlyView.Leveraging literature data, we build a large‐language‐model‐driven workflow that extracts synthesis steps from 4407 papers, retrieves similar precedents, and generates candidate solid‐state synthesis recipes. The system benchmarks against ground‐truth and then operates in a closed loop with experiments to synthesize oxy‐selenide electrolyte materials ...
Dong Won Jeon +9 more
wiley +1 more source
Benchmarking Global Optimization and Constraint Satisfaction Codes [PDF]
A benchmarking suite describing over 1000 optimization problems and constraint satisfaction problems covering problems from di®erent traditions is described, annotated with best known solutions, and accompanied by recommended benchmarking protocols for ...
Shcherbina, Oleg +4 more
core +1 more source
Algorithms for Quantified Constraint Satisfaction Problems [PDF]
, 2004 Many propagation and search algorithms have been developed for constraint satisfaction problems (CSPs). In a standard CSP all variables are existentially quantified. The CSP formalism can be extended to allow universally quantified variables, in which case the complexity of the basic reasoning tasks rises from NP-complete to PSPACE-complete.
Stergiou, K, Mamoulis, N
openaire +2 more sources
Transient Cytoskeletal Anisotropy Encodes Short‐Term Mechanical Memory in Glioblastoma Cells
Advanced Materials, EarlyView.The same mechanical deformation can produce distinct cytoskeletal states depending on loading history. Experiments and constitutive modeling reveal that transient actin–vimentin anisotropy stores mechanical information and governs short‐term mechanical memory in glioblastoma cells.
Clara Gomez‐Cruz +5 more
wiley +1 more source
Locally Consistent Constraint Satisfaction Problems
Theoretical Computer Science, 2004 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zdenek Dvorák 0001 +2 more
openaire +2 more sources
Advanced Materials, EarlyView.Intrinsic material dynamics are harnessed as computational resources for neuromorphic in‐materio physical reservoir computing. Defects, ionic motion, interfaces, percolation, geometry, and biasing shape transient states that provide fading memory, nonlinearity, and high‐dimensional projection for simple readout. A descriptor‐to‐dynamics framework links
Kshitij RB Singh +5 more
wiley +1 more source
Hybrid Tractable Classes of Constraint Problems [PDF]
, 2017 We present a survey of complexity results for hybrid constraint satisfaction problems (CSPs) and valued constraint satisfaction problems (VCSPs). These are classes of (V)CSPs defined by restrictions that are not exclusively language-based or structure ...
Cooper, Martin C. +2 more
core +1 more source
Advanced Materials, EarlyView.Interfacial reactions in all‐solid‐state batteries are conventionally suppressed; here, they are designed. Vacancy‐rich β‐Li3N, acting as an anolyte, reacts controllably with silicon during composite anode fabrication, building a purpose‐made lithium nitridosilicate interlayer on every particle surface.
Tongtai Ji +9 more
wiley +1 more source