Results 91 to 100 of about 15,438 (311)
Dominion : an architecture-driven approach to generating efficient constraint solvers
, 2011 This work is supported by the EPSRC grant “A Constraint Solver Synthesiser” (EP/H004092/1) and SICSA studentships.Constraints are used to solve combinatorial problems in a variety of industrial and academic disciplines.
Balasubramaniam, Dharini +11 more
core +1 more source
Absorption in Universal Algebra and CSP [PDF]
, 2017 The algebraic approach to Constraint Satisfaction Problem led to many developments in both CSP and universal algebra. The notion of absorption was successfully applied on both sides of the connection.
Kozik, Marcin, Barto, Libor
core +1 more source
Advanced Materials, EarlyView.This review summarizes the principles and challenges of nonaqueous lithium‐oxygen batteries and recent advances in cathode catalysts, including carbon‐based materials, metals, oxides, sulfides, nitrides, carbides, and redox mediators. It highlights emerging design strategies and artificial intelligence‐driven approaches, emphasizing data‐assisted ...
Yuqing Yao +8 more
wiley +1 more source
The complexity of positive first-order logic without equality II: The four-element case [PDF]
, 2010 We study the complexity of evaluating positive equality-free sentences of first-order (FO) logic over fixed, finite structures B. This may be seen as a natural generalisation of the non-uniform quantified constraint satisfaction problem QCSP(B ...
Martin, Jos +3 more
core +1 more source
Advances in Magnesium‐Based Thermoelectrics: A Critical Review
Advanced Materials, EarlyView.Magnesium‐based thermoelectric materials have emerged as promising candidates for low‐to‐mid‐temperature energy conversion due to their abundance, low cost, and competitive performance. This review summarizes recent advances in Mg3X2, MgAgSb, and Mg2X systems, covering transport mechanisms, fabrication strategies, stability challenges, and device ...
Li‐Min Zhang +5 more
wiley +1 more source
A Novel Multi-Thread Parallel Constraint Propagation Scheme
IEEE Access, 2019 Constraint Programming (CP) is an efficient technique for solving combinatorial (optimization) problems. In modern constraint solver, a CP Model is defined over reversible variables that take values in domains and propagators which filter the domains of ...
Zhe Li +4 more
doaj +1 more source
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
, 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
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 +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