Results 91 to 100 of about 15,021 (304)
SciPost Physics, 2017 Random constraint satisfaction problems (CSP) have been studied extensively using statistical physics techniques. They provide a benchmark to study average case scenarios instead of the worst case one.
Silvio Franz, Giorgio Parisi, Maksim Sevelev, Pierfrancesco Urbani, Francesco Zamponi
doaj +1 more source
Expected number of locally maximal solutions for random Boolean CSPs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2007 For a large number of random Boolean constraint satisfaction problems, such as random $k$-SAT, we study how the number of locally maximal solutions evolves when constraints are added.
Nadia Creignou +2 more
doaj +1 more source
Strong subalgebras and the Constraint Satisfaction Problem
J. Multiple Valued Log. Soft Comput., 2020 In 2007 it was conjectured that the Constraint Satisfaction Problem (CSP) over a constraint language $Γ$ is tractable if and only if $Γ$ is preserved by a weak near-unanimity (WNU) operation. After many efforts and partial results, this conjecture was independently proved by Andrei Bulatov and the author in 2017.
openaire +4 more sources
Robustly Solvable Constraint Satisfaction Problems [PDF]
SIAM Journal on Computing, 2016 An algorithm for a constraint satisfaction problem is called robust if it outputs an assignment satisfying at least $(1-g(\varepsilon))$-fraction of the constraints given a $(1-\varepsilon)$-satisfiable instance, where $g(\varepsilon) \rightarrow 0$ as $\varepsilon \rightarrow 0$.
Libor Barto, Marcin Kozik
openaire +3 more sources
Advanced Materials, EarlyView.The perspective presents an integrated view of neuromorphic technologies, from device physics to real‐time applicability, while highlighting the necessity of full‐stack co‐optimization. By outlining practical hardware‐level strategies to exploit device behavior and mitigate non‐idealities, it shows pathways for building efficient, scalable, and ...
Kapil Bhardwaj +8 more
wiley +1 more source
Tractability in constraint satisfaction problems: a survey [PDF]
Constraints, 2015 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Carbonnel, Clément, Cooper, Martin
openaire +4 more sources
Leaftronics: Bio‐Fractal Scaffolds From Leaf Venation for Low‐Waste Electronics
Advanced Materials, EarlyView.“Leaftronics” transforms naturally evolved leaf venation into quasi‐fractal scaffolds for sustainable electronics. Polymer‐infiltrated leaf skeletons can be used to fabricate ultra‐smooth, reflow‐ and thin‐film‐compatible decomposable substrates, while making the same lignocellulose networks conducting results in flexible transparent electrodes.
Rakesh Rajendran Nair +3 more
wiley +1 more source
Basic Techniques for Creating an Efficient CSP Solver [PDF]
Scientific Annals of Computer Science, 2007 Many computationally difficult problems from areas like planning and scheduling are easily modelled as constraint satisfaction problems (CSP). In order to have an uniform practical approach of these, a new programming paradigm emerged in the form of ...
C. Frăsinaru
doaj
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
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