Search alternatives:
algorithms would » algorithm could (Expand Search), algorithms based (Expand Search), algorithms used (Expand Search)
algorithm python » algorithm within (Expand Search), algorithms within (Expand Search), algorithm both (Expand Search)
python function » protein function (Expand Search)
would function » yield function (Expand Search)
algorithm a » algorithm _ (Expand Search), algorithm b (Expand Search), algorithms _ (Expand Search)
a function » _ function (Expand Search)
algorithms would » algorithm could (Expand Search), algorithms based (Expand Search), algorithms used (Expand Search)
algorithm python » algorithm within (Expand Search), algorithms within (Expand Search), algorithm both (Expand Search)
python function » protein function (Expand Search)
would function » yield function (Expand Search)
algorithm a » algorithm _ (Expand Search), algorithm b (Expand Search), algorithms _ (Expand Search)
a function » _ function (Expand Search)
-
121
Four examples of runs around the median () from La Fuenfría’s Function Recovery Uunit.
Published 2022“…<p>(<b>FRU</b>). <b>A</b>: Total admissions (<b>Adm</b>) sequence (<i>n</i> = 22, <i>n</i><sub><i>runs</i></sub> = 11, <i>P</i><sub><i>rnd</i></sub> ≈ 0.15); <b>B</b>, Total discharges (<b>Dis</b>) sequence (<i>n</i> = 22, <i>n</i><sub><i>runs</i></sub> = 8, <i>P</i><sub><i>rnd</i></sub> ≈ 0.04); <b>C</b>, is the sum of lengths of stay (<b>LoS</b>) for all in–patients (<b>InP</b>) in the Unit during each month (<i>n</i> = 23, <i>n</i><sub><i>runs</i></sub> = 5, <i>P</i><sub><i>rnd</i></sub> ≈ 4.5 ⋅ 10<sup>−4</sup>); <b>D</b>, is a sequence of the average stay duration (Mean <b>LoS</b>) of each in–patient at the Unit (<i>n</i> = 23, <i>n</i><sub><i>runs</i></sub> = 10, <i>P</i><sub><i>rnd</i></sub> ≈ 0.13); <b>E</b>, throughout the observation period the Function Recovery Unit gained relevance and the number of beds were increased, the panel shows the changes in beds at the behind ib several months, as expenses, the analysis of this senescence was found to be non random (<i>n</i> = 23, <i>n</i><sub><i>run</i></sub> = 5, <i>P</i><sub><i>rnd</i></sub> ≈ 4.5 ⋅ 10<sup>−4</sup>, actually <i>n</i> runs may be just in this case, the algorithm probably found very minor decimal differences between data an in one segment; if n <i>runs</i> = 3, should n runs be 3 than <i>P</i><sub><i>rnd</i></sub> 4.5 ⋅ 10<sup>−4</sup>. …”
-
122
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). …”
-
123
-
124
-
125
-
126
-
127
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. …”
-
128
-
129
-
130
-
131
-
132
-
133
-
134
Search-based testing (Genetic Algorithm) - Chapter 11 of the book "Software Testing Automation"
Published 2022“…</p> <p><br></p> <p>3. Algorithm</p> <p>Below is the main body of the test data generator program:</p> <p> </p> <p>the main body of a Python program to generate test data for Python functions.…”
-
135
-
136
-
137
-
138
-
139
-
140