Results 171 to 180 of about 73,753 (309)

A strongly polynomial-time algorithm for minimizing submodular functions

This paper presents a combinatorial polynomial-time algorithm for minimizing submolular set functions. The algorithm employs a scaling scheme that uses a flow in the complete directed graph on the underlying set with each arc capacity equal to thescaled ...
IWATA, Satoru, FLEISCHER, Lisa, FUJISHIGE, Satoru   +2 more
core  

Stable Neural Signal Recording Processed by Memristor‐Based Reservoir Computing System

Advanced Intelligent Systems, EarlyView.
This work introduces a memristor‐based reservoir computing (RC) system for real‐time, energy‐efficient processing of neural signals in brain‐machine interface (BMI). Combined with flexible mesh neural probes with tissue‐like flexibility and subcellular‐scale features that enable consistent, long‐term tracking of single‐cell neural activities, the ...
Soohyeon Kim, Yuting Wu, Finn Moore, Mingtao Hu, Xiaoyu Zhang, Sangmin Yoo, Eric Yeu‐Jer Lee, Hao Shen, Yichun He, Jia Liu, Wei D. Lu   +10 more
wiley   +1 more source

List 3-coloring on comb-convex and caterpillar-convex bipartite graphs. [PDF]

J Comb Optim
Şen BB, Erlebach T, Yaşar Ö.
europepmc   +1 more source

A Polynomial-Time Dual Simplex Algorithm for the Transportation Problem

, 1983
A Polynomial-Time Dual Simplex Algorithm for the Transportation ...
Ikura, Y., Nemhauser, G.
core  

SiOx‐Based Probabilistic Bits Enabling Invertible Logic Gate for Cryptographic Applications

Advanced Intelligent Systems, EarlyView.
To enable lightweight hardware encryption and decryption, a Ti/SiOx/Ti threshold switching device is engineered to generate controllable stochastic oscillations. By tuning the input voltage, the device produces a programmable spike probability governed by intrinsic switching dynamics, enabling probabilistic bits that construct an invertible ...
Jihyun Kim, Hyeonsik Choi, Jiyong Woo
wiley   +1 more source

Research on Error Compensation Methods of Dynamic Gravity Measurement Based on Swarm Cooperation Evolution Strategy and Optimized LSTM. [PDF]

Entropy (Basel)
Li X, Zhou Z, Zhang Z, Liang Z, Chang Z, Li Y.   +5 more
europepmc   +1 more source

A Polynomial-time Algorithm for Constructing k-Maintainable Policies

, 2004
In this paper we present a polynomial time algorithm for constructing k-maintainable policies (Nakamura, Baral, & Bjareland 2000). Our algorithm, in polynomial time, constructs a k-maintainable control policy, if one exists, or tells that no such
Chitta Baral, Thomas Eiter
core  

Shapley Additive Explanation for Local Class Differentiation: Local Explainability for Class Differentiation in Classification Models

Advanced Intelligent Systems, EarlyView.
An instance‐level, model‐agnostic explanation of class differentiation is introduced through SHAP‐LCD, linking probability shifts to feature‐wise Shapley contributions. The method operates on tabular and image data and is released in a fully reproducible implementation, offering a transparent way to examine, at each instance, why predictive models ...
Roxana M. Romero Luna, Hugo A. Ordoñez Erazo, Carlos A. Cobos Lozada   +2 more
wiley   +1 more source

Quantum algorithms for equational reasoning. [PDF]

Sci Adv
Rattacaso D, Jaschke D, Ballarin M, Siloi I, Montangero S.   +4 more
europepmc   +1 more source

Generalized Task‐Driven Design of Soft Robots via Reduced‐Order Finite Element Method‐Based Surrogate Modeling

Advanced Intelligent Systems, EarlyView.
A unified, reusable modeling pipeline enables task‐driven design of soft robots across actuator families and task scenarios. High‐fidelity simulations are compressed into compact pseudo‐rigid‐body joint surrogates, while a design‐conditioned meta‐model generates new surrogates from geometry parameters without rerunning finite element method.
Yao Yao, David Howard, Perla Maiolino
wiley   +1 more source