Cover algebra - Open Access .click

Results 261 to 270 of about 3,158,775 (365)

Topological search and gradient descent boosted Runge–Kutta optimiser with application to engineering design and feature selection

CAAI Transactions on Intelligence Technology, EarlyView.
Abstract The Runge–Kutta optimiser (RUN) algorithm, renowned for its powerful optimisation capabilities, faces challenges in dealing with increasing complexity in real‐world problems. Specifically, it shows deficiencies in terms of limited local exploration capabilities and less precise solutions.
Jinge Shi +5 more
wiley +1 more source

An algebraic approach to circulant column parity mixers. [PDF]

Des Codes Cryptogr
Subroto RC.
europepmc +1 more source

Laplacian attention: A plug‐and‐play algorithm without increasing model complexity for vision tasks

CAAI Transactions on Intelligence Technology, EarlyView.
Abstract Most prevailing attention mechanism modules in contemporary research are convolution‐based modules, and while these modules contribute to enhancing the accuracy of deep learning networks in visual tasks, they concurrently augment the overall model complexity.
Xiaolei Chen, Yubing Lu, Runyu Wen
wiley +1 more source

Lower density soft operators and density soft topologies. [PDF]

Heliyon
Ameen ZA, Alqahtani MH, Alghamdi OF.
europepmc +1 more source

Covers of algebraic varieties V: Examples of covers of degree 8 and 9 as catalecticant loci

, 2003
Gianfranco Casnati
openalex +1 more source

On the hypercomplex numbers and normed division algebras in all dimensions: A unified multiplication. [PDF]

PLoS One
Singh P, Gupta A, Joshi SD.
europepmc +1 more source

ON PSEUDO-EFFECT ALGEBRAS WHICH CAN BE COVERED BY PSEUDO MV-ALGEBRAS