Search alternatives:
algorithm python » algorithm within (Expand Search), algorithms within (Expand Search), algorithm both (Expand Search)
python function » protein function (Expand Search)
algorithms spc » algorithms mc (Expand Search), algorithms used (Expand Search), algorithms hamc (Expand Search)
spc function » gpcr function (Expand Search), fc function (Expand Search), _ function (Expand Search)
algorithm a » algorithm _ (Expand Search), algorithm b (Expand Search), algorithms _ (Expand Search)
a function » _ function (Expand Search)
algorithm python » algorithm within (Expand Search), algorithms within (Expand Search), algorithm both (Expand Search)
python function » protein function (Expand Search)
algorithms spc » algorithms mc (Expand Search), algorithms used (Expand Search), algorithms hamc (Expand Search)
spc function » gpcr function (Expand Search), fc function (Expand Search), _ function (Expand Search)
algorithm a » algorithm _ (Expand Search), algorithm b (Expand Search), algorithms _ (Expand Search)
a function » _ function (Expand Search)
-
81
Performance as a function of the number of algorithm executions for the full-sized matrix design.
Published 2020“…<p>Performance as a function of the number of algorithm executions for the full-sized matrix design.…”
-
82
-
83
-
84
Dataset of networks used in assessing the Troika algorithm for clique partitioning and community detection
Published 2025“…Each network is provided in .gml format or .pkl format which can be read into a networkX graph object using standard functions from the networkX library in Python. …”
-
85
Search Algorithms and Loss Functions for Bayesian Clustering
Published 2022“…<p>We propose a randomized greedy search algorithm to find a point estimate for a random partition based on a loss function and posterior Monte Carlo samples. …”
-
86
-
87
-
88
-
89
-
90
Comparison of deconvolution and optimization algorithms on a batch of data.
Published 2021“…Both experimental data have been resampled at 50ms and used to compute a set of TFs (in orange) either with direct deconvolution approaches (Fourier or Toeplitz methods, middle-upper panel TFs) or with 1-Γ function optimization performed by 3 different algorithms (middle-lower panel TFs). …”
-
91
-
92
-
93
-
94
A Genetic Algorithm Approach for Compact Wave Function Representations in Spin-Adapted Bases
Published 2025“…<i>Quantum Anamorphosis</i> addresses this challenge through physically motivated localization of molecular orbitals and site reordering, which yield unique block-diagonal Hamiltonian matrices and compact spin-adapted many-body wave functions. In this work, we introduce a genetic algorithm to identify optimal orbital/site orderings that enhance wave function compactness, thereby enabling the study of larger systems than previously possible. …”
-
95
-
96
-
97
-
98
-
99
-
100