Results 101 to 110 of about 15,438 (311)
Maximum constraint satisfaction on diamonds [PDF]
In this paper we study the complexity of the (weighted) maximum constr aint satisfaction problem (Max CSP) over an arbitrary finite domain. In this pro blem, one is given a collection of weighted constraints on overlapping sets of v ariables, and the ...
Krokhin, Andrei, Larose, Benoit
core
Advanced Materials, EarlyView.A deep learning inverse‐design framework is established to create versatile reconfigurable terahertz metadevices. By synergizing deep learning with phase‐change materials, this approach enables on‐demand customization of multidimensional electromagnetic responses.
Yisheng Dong +11 more
wiley +1 more source
FUZZY PROJECT SCHEDULING USING CONSTRAINT PROGRAMMING [PDF]
Applied Computer Science, 2013 The paper aims to present an application of constraint rogramming techniques for project portfolio scheduling taking into account the imprecision in activity duration and cost. Data specification in the form of discrete α-cuts allows combining distinct
Marcin RELICH
doaj
Nonlocal Metaspire: A Scalable Elastic Material Platform With Decoupled Mechanical Modes
Advanced Materials, EarlyView.Nonlocal Metaspire introduces sequential rotation to realize wider scalability in implementing complex nonlocal couplings in elastic metamaterials while suppressing unintended mode coupling. Numerical results clarify the underlying wave motions, demonstrate mode‐decoupled roton and maxon formation, and support a straightforward extension to higher ...
Seung Han Kim +3 more
wiley +1 more source
The Constraint Satisfaction Problem: Complexity and Approximability
, 2017 A backdoor set of a CSP instance is a set of variables whose instantiation moves the instance into a fixed class of tractable instances (an island of tractability).
Ordyniak, Sebastian +2 more
core
Advanced Materials Interfaces, EarlyView.3D conductive frameworks can maintain continuous electron transport, mechanical stability, and interfacial integrity, helping next‐generation batteries operate more efficiently. This Review examines their relevance to Si anodes, all‐solid‐state batteries, and dry‐processed electrodes, and highlights bio‐derived carbons as sustainable, structurally ...
SeoYoung Ha +5 more
wiley +1 more source
The complexity of the counting constraint satisfaction problem
Journal of the ACM, 2008 The Counting Constraint Satisfaction Problem (#CSP(H)) over a finite relational structure H can be expressed as follows: given a relational structure G over the same vocabulary, determine the number of homomorphisms from G to H. In this article we characterize relational structures H for which (#CSP(H) can be solved in polynomial time and prove that ...
openaire +3 more sources
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
A Survey of Interlayer Interaction Models for Graphene and Other 2D Materials
Advanced Materials Interfaces, EarlyView.Van der Waals interactions arising from electronic polarization at atomically close interfaces generate corrugated interlayer energy landscapes that govern normal and tangential tractions. This review presents an overview of quantum, atomistic, analytical, and continuum modeling approaches, highlighting their roles across length scales in capturing ...
Gourav Yadav +2 more
wiley +1 more source
Automated static symmetry breaking in constraint satisfaction problems
, 2011 Variable symmetries in constraint satisfaction problems can be broken by adding lexicographic ordering constraints. Existing general methods of generating such sets of ordering constraints can produce a huge number of additional constraints. This adds
Grayland, Andrews
core