Results 81 to 90 of about 15,438 (311)

New‐Era Polymer Thermoelectrics: Material Innovations, Doping Frontiers, Decoupling Strategies, and Unconventional Applications

open access: yesAdvanced Materials, EarlyView.
The field of polymer thermoelectrics is entering a new era, featuring breakthroughs in addressing the conventional performance disparity between p‐type and n‐type polymers, pioneering doping frontiers, and sophisticated decoupling strategies. This review explores innovations in molecular design and superior stabilities, bridging the gap from ...
Suhao Wang
wiley   +1 more source

DFU, Volume 7, The Constraint Satisfaction Problem: Complexity and Approximability, Complete Volume

open access: yes, 2017
DFU, Volume 7, The Constraint Satisfaction Problem: Complexity and Approximability, Complete ...
Krokhin, Andrei   +4 more
core   +1 more source

Thermodynamic Limits to Molecular Doping in Conjugated Polymers: A Perspective on Phase Behavior and Miscibility

open access: yesAdvanced Materials, EarlyView.
Molecular doping of conjugated polymers is fundamentally constrained by thermodynamic phase behavior. This Perspective reframes doping efficiency and stability in terms of miscibility limits, binodals, and solvus boundaries, highlighting the role of effective interaction parameters and charge transfer.
Somayeh Kashani   +10 more
wiley   +1 more source

Strong subalgebras and the Constraint Satisfaction Problem

open access: yesJ. 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]

open access: yesSIAM 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

Neuromorphic Electronics for Intelligence Everywhere: Emerging Devices, Flexible Platforms, and Scalable System Architectures

open access: yesAdvanced 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]

open access: yesConstraints, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Carbonnel, Clément, Cooper, Martin
openaire   +4 more sources

Phase transition behaviour in constraint satisfaction problems [PDF]

open access: yes, 1997
Many problems in artificial intelligence and computer science can be formulated as constraint satisfaction problems (CSPs). A CSP consists of a set of variables among which a set of constraints are imposed, with a solution corresponding to an assignment ...
Stuart Alexander Grant   +1 more
core  

Leaftronics: Bio‐Fractal Scaffolds From Leaf Venation for Low‐Waste Electronics

open access: yesAdvanced 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

A HYBRID ALGORITHM FOR THE ROBUST GRAPH COLORING PROBLEM

open access: yesRevista de Matemática: Teoría y Aplicaciones, 2016
A hybridalgorithm which combines mathematical programming techniques (Kruskal’s algorithm and the strategy of maintaining arc consistency to solve constraint satisfaction problem “CSP”) and heuristic methods (musical composition method and DSATUR) to ...
Román Anselmo Mora Gutiérrez   +4 more
doaj   +1 more source

Home - About - Disclaimer - Privacy