Results 301 to 310 of about 2,051,541 (361)

Benchmarking the Transferability of Real‐Time State of Charge Algorithms to Sodium‐Ion Cells Using an Open‐Source Diagnostics Framework

Batteries &Supercaps, EarlyView.
Our open‐source evaluation framework enables rigorous benchmarking of real‐time algorithims. We showcase its functionality through a sodium‐ion battery case study, highlighting key strenghts and limitations for SOC diagnostics. Despite the abundance of battery state estimation algorithms in the BMS literature, their applicability to emerging cell ...
Katharina Lilith Quade, Elias Hempen, Hanna van den Berg, Dominik Jöst, Franziska Berger, Florian Ringbeck, Dirk Uwe Sauer   +6 more
wiley   +1 more source

Entanglement-assisted variational algorithm for discrete optimization problems. [PDF]

Commun Phys
Fioroni L, Savona V.
europepmc   +1 more source

LLMs augmented hierarchical reinforcement learning with action primitives for long-horizon manipulation tasks. [PDF]

Sci Rep
Zhang N, Zhao Y, Yang M, Dai S.
europepmc   +1 more source

DT-HRL: Mastering Long-Sequence Manipulation with Reimagined Hierarchical Reinforcement Learning. [PDF]

Biomimetics (Basel)
Zhang J, Zhang Y, Sun H, Zhang Y, Hashimoto K.   +4 more
europepmc   +1 more source

AQEA-QAS: An Adaptive Quantum Evolutionary Algorithm for Quantum Architecture Search. [PDF]

Entropy (Basel)
Li Y, Zhang J, Zhou R, Qu Y, Xu R.
europepmc   +1 more source

Finding Key Nodes in Complex Networks Through Quantum Deep Reinforcement Learning. [PDF]

Entropy (Basel)
Xiong J, Ren XL, Lü L.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Parameterized Complexity Theory

Texts in Theoretical Computer Science. An EATCS Series, 2006
AbstractThis chapter offers a closer look at parameterized computational complexity theory. Central concepts in this context are parameterized problems, parameterized reducibility, parameterized complexity classes, W[1], complete problems, and W[1]-hardness proofs.
J. Flum, Martin Grohe
semanticscholar   +3 more sources

The Parameterized Complexity of Coordinated Motion Planning

International Symposium on Computational Geometry, 2023
In Coordinated Motion Planning (CMP), we are given a rectangular-grid on which $k$ robots occupy $k$ distinct starting gridpoints and need to reach $k$ distinct destination gridpoints.
E. Eiben, R. Ganian, Iyad A. Kanj
semanticscholar   +1 more source

Fundamentals of Parameterized Complexity

Texts in Computer Science, 2013
R. Downey, M. Fellows
semanticscholar   +2 more sources