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 *

163 related articles for article (PubMed ID: 24737968)

  • 1. An iterated tabu search approach for the clique partitioning problem.
    Palubeckis G; Ostreika A; Tomkevičius A
    ScientificWorldJournal; 2014; 2014():353101. PubMed ID: 24737968
    [TBL] [Abstract][Full Text] [Related]  

  • 2. A Hybrid Evolutionary Algorithm for the Clique Partitioning Problem.
    Lu Z; Zhou Y; Hao JK
    IEEE Trans Cybern; 2022 Sep; 52(9):9391-9403. PubMed ID: 33635807
    [TBL] [Abstract][Full Text] [Related]  

  • 3. An impatient evolutionary algorithm with probabilistic tabu search for unified solution of some NP-hard problems in graph and set theory via clique finding.
    Guturu P; Dantu R
    IEEE Trans Syst Man Cybern B Cybern; 2008 Jun; 38(3):645-66. PubMed ID: 18558530
    [TBL] [Abstract][Full Text] [Related]  

  • 4. Three-dimensional surface mesh segmentation using curvedness-based region growing approach.
    Jagannathan A; Miller EL
    IEEE Trans Pattern Anal Mach Intell; 2007 Dec; 29(12):2195-204. PubMed ID: 17934228
    [TBL] [Abstract][Full Text] [Related]  

  • 5. Iterated Clique Reductions in Vertex Weighted Coloring for Large Sparse Graphs.
    Fan Y; Zhang Z; Yu Q; Lai Y; Su K; Wang Y; Pan S; Latecki LJ
    Entropy (Basel); 2023 Sep; 25(10):. PubMed ID: 37895498
    [TBL] [Abstract][Full Text] [Related]  

  • 6. A flooding algorithm for multirobot exploration.
    Cabrera-Mora F; Xiao J
    IEEE Trans Syst Man Cybern B Cybern; 2012 Jun; 42(3):850-63. PubMed ID: 22275717
    [TBL] [Abstract][Full Text] [Related]  

  • 7. Analyses of simple hybrid algorithms for the vertex cover problem.
    Friedrich T; He J; Hebbinghaus N; Neumann F; Witt C
    Evol Comput; 2009; 17(1):3-19. PubMed ID: 19207086
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Generalizing Swendsen-Wang to sampling arbitrary posterior probabilities.
    Barbu A; Zhu SC
    IEEE Trans Pattern Anal Mach Intell; 2005 Aug; 27(8):1239-53. PubMed ID: 16119263
    [TBL] [Abstract][Full Text] [Related]  

  • 9. Affinity learning with diffusion on tensor product graph.
    Yang X; Prasad L; Latecki LJ
    IEEE Trans Pattern Anal Mach Intell; 2013 Jan; 35(1):28-38. PubMed ID: 22392704
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Dynamic graph cuts for efficient inference in Markov Random Fields.
    Kohli P; Torr PH
    IEEE Trans Pattern Anal Mach Intell; 2007 Dec; 29(12):2079-88. PubMed ID: 17934219
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Wrapper-filter feature selection algorithm using a memetic framework.
    Zhu Z; Ong YS; Dash M
    IEEE Trans Syst Man Cybern B Cybern; 2007 Feb; 37(1):70-6. PubMed ID: 17278560
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Comments on "the 1993 DIMACS graph coloring challenge" and "energy function-based approaches to graph coloring".
    Liu J; Zhong W; Jiao L
    IEEE Trans Neural Netw; 2006 Mar; 17(2):533. PubMed ID: 16566482
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Unsupervised object segmentation with a hybrid graph model (HGM).
    Liu G; Lin Z; Yu Y; Tang X
    IEEE Trans Pattern Anal Mach Intell; 2010 May; 32(5):910-24. PubMed ID: 20299714
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Solving minimum distance problems with convex or concave bodies using combinatorial global optimization algorithms.
    Carretero JA; Nahon MA
    IEEE Trans Syst Man Cybern B Cybern; 2005 Dec; 35(6):1144-55. PubMed ID: 16366241
    [TBL] [Abstract][Full Text] [Related]  

  • 15. MAWA∗-a memory-bounded anytime heuristic-search algorithm.
    Vadlamudi SG; Aine S; Chakrabarti PP
    IEEE Trans Syst Man Cybern B Cybern; 2011 Jun; 41(3):725-35. PubMed ID: 21095872
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Weights and topology: a study of the effects of graph construction on 3D image segmentation.
    Grady L; Jolly MP
    Med Image Comput Comput Assist Interv; 2008; 11(Pt 1):153-61. PubMed ID: 18979743
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Learning graph matching.
    Caetano TS; McAuley JJ; Cheng L; Le QV; Smola AJ
    IEEE Trans Pattern Anal Mach Intell; 2009 Jun; 31(6):1048-58. PubMed ID: 19372609
    [TBL] [Abstract][Full Text] [Related]  

  • 18. A hopfield network learning method for bipartite subgraph problem.
    Wang RL; Tang Z; Cao QP
    IEEE Trans Neural Netw; 2004 Nov; 15(6):1458-65. PubMed ID: 15565773
    [TBL] [Abstract][Full Text] [Related]  

  • 19. An improved hybrid encoding cuckoo search algorithm for 0-1 knapsack problems.
    Feng Y; Jia K; He Y
    Comput Intell Neurosci; 2014; 2014():970456. PubMed ID: 24527026
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Common Visual Pattern Discovery via Directed Graph.
    Wang C; Ma KK
    IEEE Trans Image Process; 2014 Mar; 23(3):1408-18. PubMed ID: 24723536
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 9.