Results 121 to 130 of about 2,188,345 (345)
New polynomial-time algorithms for Camion bases
Discrete Mathematics, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Komei Fukuda, Antoine Musitelli
openaire +1 more source
Advanced Electronic Materials, EarlyView.Ising machines are emerging as specialized hardware solvers for computationally hard optimization problems. This review examines five major platforms—digital CMOS, analog CMOS, emerging devices, coherent optics, and quantum systems—highlighting physics‐rooted advantages and shared bottlenecks in scalability and connectivity.
Hyunjun Lee, Joon Pyo Kim, Sanghyeon Kim
wiley +1 more source
Symmetric Encryption Algorithms in a Polynomial Residue Number System
Journal of Applied MathematicsIn this paper, we develop the theoretical provisions of symmetric cryptographic algorithms based on the polynomial residue number system for the first time. The main feature of the proposed approach is that when reconstructing the polynomial based on the
I. Yakymenko +3 more
doaj +1 more source
Model‐Based Time‐Modulated Write Algorithm for 1R Analog Memristive Crossbar Arrays
Advanced Electronic Materials, EarlyView.A novel model‐based time‐modulated write algorithm efficiently programs analog 1R memristive crossbar arrays by varying pulse duration at a fixed voltage. By leveraging a physics‐based compact model and a dynamic gain mechanism, this approach overcomes device nonlinearities and parasitic effects.
Richard Schroedter +7 more
wiley +1 more source
Seifert's algorithm, Châtelet bases and the Alexander ideals of classical knots [PDF]
, 2002 I begin by developing a procedure for the construction of a Seifert surface, using Seifert's algorithm, and the calculation of a Seifert matrix for a knot from a suitable encoding of a knot diagram. This procedure deals with the inherent indeterminacy of
O'Brien, Killian Michael
core
Advanced Electronic Materials, EarlyView.Physical reservoir computing (PRC) based on spin wave interference has demonstrated high computational performance, yet room for improvement remains. In this study, we fabricated this concept PRC with eight detectors and evaluated the impact of the number of detectors using a chaotic time series prediction task.
Sota Hikasa +6 more
wiley +1 more source
IEEE AccessThis paper presents a scheme that is designed for the effective implementation of lattice reduction for polynomial matrices within the list-decoding algorithm that is applied to the binary Goppa codes.
Ki-Soon Yu, Dae-Woon Lim
doaj +1 more source
A Polynomial Optimization Approach to Constant Rebalanced Portfolio Selection
We address the multi-period portfolio optimization problem with the constant rebalancing strategy. This problem is formulated as a polynomial optimization problem (POP) by using a mean-variance criterion.
Sotirov, R., Takano, Y.
core
Evaluating a weighted graph polynomial for graphs of bounded tree-width
, 2009 We show that for any $k$ there is a polynomial time algorithm to evaluate the weighted graph polynomial $U$ of any graph with tree-width at most $k$ at any point.
Noble, Steven, Noble, S D
core
Synchronization of Analog Neuron Circuits With Digital Memristive Synapses: An Hybrid Approach
Advanced Electronic Materials, EarlyView.An hybrid circuit mimicking neural units coupled using memristive synapses is introduced. The analog neurons provide flexibility and robustness, and the digital memristive coupling guarantees the full reconfigurability of the interconnection. The onset of a synchronized spiking behavior in two circuits mimicking the Izhikevich neuron is discussed from ...
Lamberto Carnazza +3 more
wiley +1 more source