Results 101 to 110 of about 15,021 (304)

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   +2 more sources

Ultrathin Li Metal Anodes: Quantitative Design Principles and Manufacturability Across Liquid and Solid‐State Batteries

Advanced Materials, EarlyView.
Ultrathin lithium metal anodes (≤15 µm) offer a promising route to high‐energy‐density batteries due to their high capacity and low potential. This review presents design principles for ultrathin Li, evaluates fabrication strategies, and discusses challenges in liquid and solid‐state cells.
Cheng Wang, Caoyu Wang, Shuixin Xia, Jodie A. Yuwono, Mingnan Li, Yanqiu Lyu, Ruizhi Zhang, Jun Wang, Jianfeng Mao, Zaiping Guo   +9 more
wiley   +1 more source

On the valued constraint satisfaction problem

, 2018
The Valued Constraint Satisfaction Problem (VCSP) is a framework which captures many natural decision and optimisation problems. An instance of the VCSP consists of a set of variables, which are to be assigned labels from a finite domain, and a collection of local constraints, each specified by a weighted relation mapping labellings of the variables in
openaire   +3 more sources

Deep Learning Inverse Design of Phase‐Change Reconfigurable Terahertz Metadevices for Multidimensional Secure Communication

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, Xieyu Chen, Aarthy Nagarajan, Yi Yang, Zhihao Wang, Rui Yu, Chuang Zheng, Chunmei Ouyang, Xueqian Zhang, Tun Cao, Ranjan Singh, Zhen Tian   +11 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  

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, Myung Hwan Bae, Ye Jeong Shin, Joo Hwan Oh   +3 more
wiley   +1 more source

Conductive Additives for Next‐Generation Batteries: Emphasizing the Potential of Bio‐Derived 3D Carbon Architectures at Electrode–Electrolyte Interfaces

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, Inseo Ko, Jongyoung Choi, Weon Ho Shin, Sung Cik Mun, Jong Ho Won   +5 more
wiley   +1 more source

On the topology of solutions to random continuous constraint satisfaction problems

SciPost Physics
We consider the set of solutions to $M$ random polynomial equations whose $N$ variables are restricted to the $(N-1)$-sphere. Each equation has independent Gaussian coefficients and a target value $V_0$. When solutions exist, they form a manifold.
Jaron Kent-Dobias
doaj   +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

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, Shakti S. Gupta, Roger A. Sauer   +2 more
wiley   +1 more source