Results 101 to 110 of about 28,166 (165)

Interpretability and Representability of Commutative Algebra, Algebraic Topology, and Topological Spectral Theory for Real-World Data. [PDF]

Adv Intell Discov
Ren Y, Wei GW.
europepmc   +1 more source

Hybrid Deployment Optimization Algorithm for Reconfigurable Intelligent Surface. [PDF]

Sensors (Basel)
Lin Y, Lin X, Han Z, Wang Y.
europepmc   +1 more source

Exploring the Boundaries of Modern Quantum Annealers with RNA Structure Prediction. [PDF]

J Phys Chem B
Andrews B, Abraham J, Fox D, Radja A.
europepmc   +1 more source

New Binary Reptile Search Algorithms for Binary Optimization Problems. [PDF]

Biomimetics (Basel)
Crawford B, López Cortés B, Cisternas-Caneo F, Gómez-Pulido JM, Olivares R, Soto R, Barrera-Garcia J, Brante-Aguilera C, Giachetti G.   +8 more
europepmc   +1 more source

StabLyzeGraph: High-throughput screening of combinatorial mutations using graph neural networks. [PDF]

Protein Sci
Waqas M, Natale B, Roggia M, Saha PP, Mileni M, Cosconati S.   +5 more
europepmc   +1 more source

Combining greedy and evolutionary algorithms to maximize influence in networks under deterministic linear threshold model. [PDF]

PLoS One
Andreev A, Kochemazov S, Semenov A.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Combinatorial Problems

Canadian Journal of Mathematics, 1950
Let it be required to arrange v elements into v sets such that every set contains exactly k distinct elements and such that every pair of sets has exactly elements in common . This combinatorial problem is studied in conjunction with several similar problems, and these problems are proved impossible for an infinitude of v and k. An incidence matrix is
Chowla, Sarvadaman, Ryser, H. J.
openaire   +2 more sources

Non-similarity combinatorial problems

Biosystems, 1993
Similarity problems intensively investigated in computational molecular biology have the following two stringology models: find the longest string included in any string of a given finite language, and find the shortest string including every string of a given finite language.
A R, Rubinov, V G, Timkovsky
openaire   +2 more sources