Search alternatives:
protein optimization » process optimization (Expand Search), property optimization (Expand Search), driven optimization (Expand Search)
joint optimization » policy optimization (Expand Search), wolf optimization (Expand Search), codon optimization (Expand Search)
basic protein » based protein (Expand Search), capsid protein (Expand Search)
binary basic » binary mask (Expand Search)
binary a » binary _ (Expand Search), binary b (Expand Search), hilary a (Expand Search)
a joint » _ joint (Expand Search)
Showing 1 - 10 results of 10 for search '(( binary a joint optimization algorithm ) OR ( binary basic protein optimization algorithm ))*', query time: 0.26s Refine Results
  1. 1
    Homomorphic binary tree.

    Homomorphic binary tree. by Jianhua He (341366)

    Published 2024
    Save to List
    Saved in:
  2. 2
    Hierarchical clustering to infer a binary tree with <i>K</i> = 4 sampled populations.

    Hierarchical clustering to infer a binary tree with <i>K</i> = 4 sampled populations. by Tristan Mary-Huard (3864)

    Published 2023
    Save to List
    Saved in:
  3. 3
    Image1_Bipartite graph search optimization for type II diabetes mellitus Jamu formulation using branch and bound algorithm.JPEG

    Image1_Bipartite graph search optimization for type II diabetes mellitus Jamu formulation using branch and bound algorithm.JPEG by Wisnu Ananta Kusuma (9276182)

    Published 2022
    Save to List
    Saved in:
  4. 4
    Image2_Bipartite graph search optimization for type II diabetes mellitus Jamu formulation using branch and bound algorithm.JPEG

    Image2_Bipartite graph search optimization for type II diabetes mellitus Jamu formulation using branch and bound algorithm.JPEG by Wisnu Ananta Kusuma (9276182)

    Published 2022
    Save to List
    Saved in:
  5. 5
    Image4_Bipartite graph search optimization for type II diabetes mellitus Jamu formulation using branch and bound algorithm.jpg

    Image4_Bipartite graph search optimization for type II diabetes mellitus Jamu formulation using branch and bound algorithm.jpg by Wisnu Ananta Kusuma (9276182)

    Published 2022
    Save to List
    Saved in:
  6. 6
    Image5_Bipartite graph search optimization for type II diabetes mellitus Jamu formulation using branch and bound algorithm.jpg

    Image5_Bipartite graph search optimization for type II diabetes mellitus Jamu formulation using branch and bound algorithm.jpg by Wisnu Ananta Kusuma (9276182)

    Published 2022
    Save to List
    Saved in:
  7. 7
    Image3_Bipartite graph search optimization for type II diabetes mellitus Jamu formulation using branch and bound algorithm.JPEG

    Image3_Bipartite graph search optimization for type II diabetes mellitus Jamu formulation using branch and bound algorithm.JPEG by Wisnu Ananta Kusuma (9276182)

    Published 2022
    Save to List
    Saved in:
  8. 8
    DataSheet1_Bipartite graph search optimization for type II diabetes mellitus Jamu formulation using branch and bound algorithm.docx

    DataSheet1_Bipartite graph search optimization for type II diabetes mellitus Jamu formulation using branch and bound algorithm.docx by Wisnu Ananta Kusuma (9276182)

    Published 2022
    Save to List
    Saved in:
  9. 9
    Supplementary Material for: Penalized Logistic Regression Analysis for Genetic Association Studies of Binary Phenotypes

    Supplementary Material for: Penalized Logistic Regression Analysis for Genetic Association Studies of Binary Phenotypes by Yu Y. (3096192)

    Published 2022
    “…We consider two approximate approaches to maximizing the marginal likelihood: (i) a Monte Carlo EM algorithm (MCEM) and (ii) a Laplace approximation (LA) to each integral, followed by derivative-free optimization of the approximation. …”
    Save to List
    Saved in:
  10. 10
    Variable Selection with Multiply-Imputed Datasets: Choosing Between Stacked and Grouped Methods

    Variable Selection with Multiply-Imputed Datasets: Choosing Between Stacked and Grouped Methods by Jiacong Du (12035845)

    Published 2022
    “…Building on existing work, we (i) derive and implement efficient cyclic coordinate descent and majorization-minimization optimization algorithms for continuous and binary outcome data, (ii) incorporate adaptive shrinkage penalties, (iii) compare these methods through simulation, and (iv) develop an R package <i>miselect</i>. …”
    Save to List
    Saved in:

Search Tools: