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 *

111 related articles for article (PubMed ID: 35855459)

  • 21. Parameter setting of meta-heuristic algorithms: a new hybrid method based on DEA and RSM.
    Shadkam E
    Environ Sci Pollut Res Int; 2022 Mar; 29(15):22404-22426. PubMed ID: 34786624
    [TBL] [Abstract][Full Text] [Related]  

  • 22. Overlapping communities detection through weighted graph community games.
    Benati S; Puerto J; Rodríguez-Chía AM; Temprano F
    PLoS One; 2023; 18(4):e0283857. PubMed ID: 37014883
    [TBL] [Abstract][Full Text] [Related]  

  • 23. Robust treatment planning with conditional value at risk chance constraints in intensity-modulated proton therapy.
    An Y; Liang J; Schild SE; Bues M; Liu W
    Med Phys; 2017 Jan; 44(1):28-36. PubMed ID: 28044325
    [TBL] [Abstract][Full Text] [Related]  

  • 24. Robust min-max optimal control design for systems with uncertain models: A neural dynamic programming approach.
    Ballesteros M; Chairez I; Poznyak A
    Neural Netw; 2020 May; 125():153-164. PubMed ID: 32097830
    [TBL] [Abstract][Full Text] [Related]  

  • 25. A computational study of exact subgraph based SDP bounds for Max-Cut, stable set and coloring.
    Gaar E; Rendl F
    Math Program; 2020; 183(1):283-308. PubMed ID: 32863433
    [TBL] [Abstract][Full Text] [Related]  

  • 26. Using max cut to enhance rooted trees consistency.
    Snir S; Rao S
    IEEE/ACM Trans Comput Biol Bioinform; 2006; 3(4):323-33. PubMed ID: 17085842
    [TBL] [Abstract][Full Text] [Related]  

  • 27. Optimal shortening of uniform covering arrays.
    Torres-Jimenez J; Rangel-Valdez N; Avila-George H; Carrizalez-Turrubiates O
    PLoS One; 2017; 12(12):e0189283. PubMed ID: 29267343
    [TBL] [Abstract][Full Text] [Related]  

  • 28. A New Frequency Analysis Operator for Population Improvement in Genetic Algorithms to Solve the Job Shop Scheduling Problem.
    Viana MS; Contreras RC; Morandin Junior O
    Sensors (Basel); 2022 Jun; 22(12):. PubMed ID: 35746343
    [TBL] [Abstract][Full Text] [Related]  

  • 29. Decomposition methods for the two-stage stochastic Steiner tree problem.
    Leitner M; Ljubić I; Luipersbeck M; Sinnl M
    Comput Optim Appl; 2018; 69(3):713-752. PubMed ID: 31258249
    [TBL] [Abstract][Full Text] [Related]  

  • 30. Review of Serial and Parallel Min-Cut/Max-Flow Algorithms for Computer Vision.
    Jensen PM; Jeppesen N; Dahl AB; Dahl VA
    IEEE Trans Pattern Anal Mach Intell; 2023 Feb; 45(2):2310-2329. PubMed ID: 35471866
    [TBL] [Abstract][Full Text] [Related]  

  • 31. A fast saddle-point dynamical system approach to robust deep learning.
    Esfandiari Y; Balu A; Ebrahimi K; Vaidya U; Elia N; Sarkar S
    Neural Netw; 2021 Jul; 139():33-44. PubMed ID: 33677377
    [TBL] [Abstract][Full Text] [Related]  

  • 32. A novel competitive exact approach to solve assembly line balancing problems based on lexicographic order of vectors.
    Xu S; Shavarani SM; Ghadiri Nejad M; Vizvari B; Toghraie D
    Heliyon; 2023 Mar; 9(3):e13925. PubMed ID: 36879957
    [TBL] [Abstract][Full Text] [Related]  

  • 33. Application of the artificial bee colony algorithm for solving the set covering problem.
    Crawford B; Soto R; Cuesta R; Paredes F
    ScientificWorldJournal; 2014; 2014():189164. PubMed ID: 24883356
    [TBL] [Abstract][Full Text] [Related]  

  • 34. Approximating maximum clique with a Hopfield network.
    Jagota A
    IEEE Trans Neural Netw; 1995; 6(3):724-35. PubMed ID: 18263357
    [TBL] [Abstract][Full Text] [Related]  

  • 35. Exact solutions for the 2d-strip packing problem using the positions-and-covering methodology.
    Cid-Garcia NM; Rios-Solis YA
    PLoS One; 2021; 16(1):e0245267. PubMed ID: 33444394
    [TBL] [Abstract][Full Text] [Related]  

  • 36. Overtaking method based on sand-sifter mechanism: Why do optimistic value functions find optimal solutions in multi-armed bandit problems?
    Ochi K; Kamiura M
    Biosystems; 2015 Sep; 135():55-65. PubMed ID: 26166266
    [TBL] [Abstract][Full Text] [Related]  

  • 37. A clustering metaheuristic for large orienteering problems.
    Elzein A; Di Caro GA
    PLoS One; 2022; 17(7):e0271751. PubMed ID: 35867693
    [TBL] [Abstract][Full Text] [Related]  

  • 38. A hyper-matheuristic approach for solving mixed integer linear optimization models in the context of data envelopment analysis.
    Gonzalez M; López-Espín JJ; Aparicio J; Talbi EG
    PeerJ Comput Sci; 2022; 8():e828. PubMed ID: 35174264
    [TBL] [Abstract][Full Text] [Related]  

  • 39. Acceptable regret model in the end-of-life setting: Patients require high level of certainty before forgoing management recommendations.
    Tsalatsanis A; Hozo I; Djulbegovic B
    Eur J Cancer; 2017 Apr; 75():159-166. PubMed ID: 28235727
    [TBL] [Abstract][Full Text] [Related]  

  • 40. Optimism in the face of uncertainty supported by a statistically-designed multi-armed bandit algorithm.
    Kamiura M; Sano K
    Biosystems; 2017 Oct; 160():25-32. PubMed ID: 28838871
    [TBL] [Abstract][Full Text] [Related]  

    [Previous]   [Next]    [New Search]
    of 6.