These tools will no longer be maintained as of December 31, 2024. Archived website can be found here. PubMed4Hh GitHub repository can be found here. Contact NLM Customer Service if you have questions.


BIOMARKERS

Molecular Biopsy of Human Tumors

- a resource for Precision Medicine *

121 related articles for article (PubMed ID: 33378868)

  • 1. Optimized packing multidimensional hyperspheres: a unified approach.
    Stoyan Y; Yaskov G; Romanova T; Litvinchev I; Yakovlev S; Velarde Cantú JM
    Math Biosci Eng; 2020 Sep; 17(6):6601-6630. PubMed ID: 33378868
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Preserving multi-dimensional information: A hypersphere method for parameter space analysis.
    Davey NAC; Chase JG; Zhou C; Murphy L
    Heliyon; 2024 Apr; 10(7):e28822. PubMed ID: 38601671
    [TBL] [Abstract][Full Text] [Related]  

  • 3. An efficient optimizer for the 0/1 knapsack problem using group counseling.
    Ghadi YY; AlShloul T; Nezami ZI; Ali H; Asif M; Aljuaid H; Ahmad S
    PeerJ Comput Sci; 2023; 9():e1315. PubMed ID: 37346609
    [TBL] [Abstract][Full Text] [Related]  

  • 4. Smart Pack: Online Autonomous Object-Packing System Using RGB-D Sensor Data.
    Hong YD; Kim YJ; Lee KB
    Sensors (Basel); 2020 Aug; 20(16):. PubMed ID: 32784913
    [TBL] [Abstract][Full Text] [Related]  

  • 5. A Column-Generation and Branch-and-Cut Approach to the Bandwidth-Packing Problem.
    Villa C; Hoffman K
    J Res Natl Inst Stand Technol; 2006; 111(2):161-85. PubMed ID: 27274927
    [TBL] [Abstract][Full Text] [Related]  

  • 6. Effect of dimensionality on the continuum percolation of overlapping hyperspheres and hypercubes.
    Torquato S
    J Chem Phys; 2012 Feb; 136(5):054106. PubMed ID: 22320724
    [TBL] [Abstract][Full Text] [Related]  

  • 7. Improved Online Algorithms for Knapsack and GAP in the Random Order Model.
    Albers S; Khan A; Ladewig L
    Algorithmica; 2021; 83(6):1750-1785. PubMed ID: 34720295
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Automating the packing heuristic design process with genetic programming.
    Burke EK; Hyde MR; Kendall G; Woodward J
    Evol Comput; 2012; 20(1):63-89. PubMed ID: 21609273
    [TBL] [Abstract][Full Text] [Related]  

  • 9. Large-W limit of the knapsack problem.
    Williams M
    Phys Rev E; 2024 Apr; 109(4-1):044151. PubMed ID: 38755943
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Piecewise hypersphere modeling by particle swarm optimization in QSAR studies of bioactivities of chemical compounds.
    Lin WQ; Jiang JH; Shen Q; Wu HL; Shen GL; Yu RQ
    J Chem Inf Model; 2005; 45(3):535-41. PubMed ID: 15921443
    [TBL] [Abstract][Full Text] [Related]  

  • 11. A Multi-Sensor Data Fusion Approach for Atrial Hypertrophy Disease Diagnosis Based on Characterized Support Vector Hyperspheres.
    Zhu Y; Liu D; Grosu R; Wang X; Duan H; Wang G
    Sensors (Basel); 2017 Sep; 17(9):. PubMed ID: 28880228
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Modeling and efficient optimization for object-based scalability and some related problems.
    Batra P
    IEEE Trans Image Process; 2000; 9(10):1677-92. PubMed ID: 18262907
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Genetic algorithms with decomposition procedures for multidimensional 0-1 knapsack problems with block angular structures.
    Kato K; Sakawa M
    IEEE Trans Syst Man Cybern B Cybern; 2003; 33(3):410-9. PubMed ID: 18238188
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Virial series for fluids of hard hyperspheres in odd dimensions.
    Rohrmann RD; Robles M; López de Haro M; Santos A
    J Chem Phys; 2008 Jul; 129(1):014510. PubMed ID: 18624486
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Genetic programming over context-free languages with linear constraints for the knapsack problem: first results.
    Bruhn P; Geyer-Schulz A
    Evol Comput; 2002; 10(1):51-74. PubMed ID: 11928691
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Optimizing e-commerce warehousing through open dimension management in a three-dimensional bin packing system.
    Yang J; Liang K; Liu H; Shan M; Zhou L; Kong L; Li X
    PeerJ Comput Sci; 2023; 9():e1613. PubMed ID: 37869457
    [TBL] [Abstract][Full Text] [Related]  

  • 17. A Case Study of Controlling Crossover in a Selection Hyper-heuristic Framework Using the Multidimensional Knapsack Problem.
    Drake JH; Özcan E; Burke EK
    Evol Comput; 2016; 24(1):113-41. PubMed ID: 25635698
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Rigorous packing of unit squares into a circle.
    Montanher T; Neumaier A; Csaba Markót M; Domes F; Schichl H
    J Glob Optim; 2019; 73(3):547-565. PubMed ID: 30880874
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Fast Polynomial Time Approximate Solution for 0-1 Knapsack Problem.
    Wang Z; Zhang H; Li Y
    Comput Intell Neurosci; 2022; 2022():1266529. PubMed ID: 36317076
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Packing hyperspheres in high-dimensional Euclidean spaces.
    Skoge M; Donev A; Stillinger FH; Torquato S
    Phys Rev E Stat Nonlin Soft Matter Phys; 2006 Oct; 74(4 Pt 1):041127. PubMed ID: 17155042
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 7.