Results 21 to 30 of about 6,062,625 (214)
Parameterized Complexity of Graph Burning [PDF]
Graph Burning asks, given a graph G = (V,E) and an integer k, whether there exists (b₀,… ,b_{k-1}) ∈ V^{k} such that every vertex in G has distance at most i from some b_i. This problem is known to be NP-complete even on connected caterpillars of maximum
Otachi, Yota, Kobayashi, Yasuaki
core +1 more source
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
Counting Problems in Parameterized Complexity [PDF]
This survey is an invitation to parameterized counting problems for readers with a background in parameterized algorithms and complexity. After an introduction to the peculiarities of counting complexity, we survey the parameterized approach to counting ...
Curticapean, Radu
core +1 more source
Organic Materials of Tomorrow: Horizons of Artificial Intelligence
This review examines machine learning techniques accelerating the discovery of organic semiconductors by linking molecular structure to properties. Key methods include graph neural networks, generative models, and active learning. Applications to organic photovoltaics demonstrate practical impact.
Harold Mena +3 more
wiley +1 more source
Path‐decoupled III–V van der Waals memtransistors spatially separate ionic and electronic transport to overcome the conventional trade‐off between accuracy and energy in neuromorphic hardware. Mobile K+ ions in the vdW gaps set a wide conductance window, Gmax/Gmin, while gate‐tunable hole conduction lowers programming energy, enabling reliable ...
Jihong Bae +13 more
wiley +1 more source
Inverse Design of Nanoparticulate Materials
Inverse design shifts nanomaterial development from empirical trial‐and‐error to predictive model‐driven strategies. It can rely on knowledge‐based, data‐based, or hybrid process and property functions. This perspective article provides a practical framework for applying inverse design based on instructive examples. It discusses which modeling approach
Nabi Etienne Traoré +5 more
wiley +1 more source
Efficient in‐Plane Exciton Transport in a Discontinuous Layered Lead‐Bromide Perovskite
A new class of two‐dimensional lead‐bromide perovskite based on monovalent 4‐aminomethylbenzoic acid cations is presented, featuring a discontinuous inorganic layer. Despite the discontinuous lattice, transient photoluminescence microscopy demonstrates efficient though strongly anisotropic in‐plane exciton transport.
Raquel Utrera‐Melero +9 more
wiley +1 more source
Highly automated method for facial expression synthesis [PDF]
This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University.The synthesis of realistic facial expressions has been an unexplored area for computer graphics scientists.
Ersotelos, Nikolaos
core +5 more sources
Automated poultry processing lines still rely on humans to lift slippery, easily bruised carcasses onto a shackle conveyor. Deformability, anatomical variance, and hygiene rules make conventional suction and scripted motions unreliable. We present ChicGrasp, an end‐to‐end hardware‐software co‐designed imitation learning framework, to offer a ...
Amirreza Davar +8 more
wiley +1 more source
Towards decentralized and parameterized supervisor synthesis
This thesis studies the decentralized and parameterized supervisor synthesis problems in the Ramadge-Wonham paradigm. We obtain a characterization of the solvability of the decentralized realization problem, by reducing it to the problem of solving a set
Lin, Liyong
core +1 more source

