BIOMARKERS

Molecular Biopsy of Human Tumors

- a resource for Precision Medicine *

195 related articles for article (PubMed ID: 23096076)

  • 1. Towards a snowdrift game optimization to vertex cover of networks.
    Yang Y; Li X
    IEEE Trans Cybern; 2013 Jun; 43(3):948-56. PubMed ID: 23096076
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Asymmetric Game: A Silver Bullet to Weighted Vertex Cover of Networks.
    Tang C; Li A; Li X
    IEEE Trans Cybern; 2018 Oct; 48(10):2994-3005. PubMed ID: 29035235
    [TBL] [Abstract][Full Text] [Related]  

  • 3. Game-Based Memetic Algorithm to the Vertex Cover of Networks.
    Wu J; Shen X; Jiao K
    IEEE Trans Cybern; 2019 Mar; 49(3):974-988. PubMed ID: 29994575
    [TBL] [Abstract][Full Text] [Related]  

  • 4. 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]  

  • 5. Optimal decision rule with class-selective rejection and performance constraints.
    Grall-Maës E; Beauseroy P
    IEEE Trans Pattern Anal Mach Intell; 2009 Nov; 31(11):2073-82. PubMed ID: 19762932
    [TBL] [Abstract][Full Text] [Related]  

  • 6. Reaching unanimous agreements within agent-based negotiation teams with linear and monotonic utility functions.
    Sanchez-Anguix V; Julian V; Botti V; García-Fornes A
    IEEE Trans Syst Man Cybern B Cybern; 2012 Jun; 42(3):778-92. PubMed ID: 22207641
    [TBL] [Abstract][Full Text] [Related]  

  • 7. Cooperative output regulation with application to multi-agent consensus under switching network.
    Su Y; Huang J
    IEEE Trans Syst Man Cybern B Cybern; 2012 Jun; 42(3):864-75. PubMed ID: 22311865
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Geometric decision tree.
    Manwani N; Sastry PS
    IEEE Trans Syst Man Cybern B Cybern; 2012 Feb; 42(1):181-92. PubMed ID: 21896394
    [TBL] [Abstract][Full Text] [Related]  

  • 9. Calculating complete and exact Pareto front for multiobjective optimization: a new deterministic approach for discrete problems.
    Hu XB; Wang M; Di Paolo E
    IEEE Trans Cybern; 2013 Jun; 43(3):1088-101. PubMed ID: 23193246
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Detecting the solution space of vertex cover by mutual determinations and backbones.
    Wei W; Zhang R; Guo B; Zheng Z
    Phys Rev E Stat Nonlin Soft Matter Phys; 2012 Jul; 86(1 Pt 2):016112. PubMed ID: 23005496
    [TBL] [Abstract][Full Text] [Related]  

  • 11. A dynamic hybrid framework for constrained evolutionary optimization.
    Wang Y; Cai Z
    IEEE Trans Syst Man Cybern B Cybern; 2012 Feb; 42(1):203-17. PubMed ID: 21824851
    [TBL] [Abstract][Full Text] [Related]  

  • 12. A self-learning particle swarm optimizer for global optimization problems.
    Li C; Yang S; Nguyen TT
    IEEE Trans Syst Man Cybern B Cybern; 2012 Jun; 42(3):627-46. PubMed ID: 22067435
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Efficient model learning methods for actor-critic control.
    Grondman I; Vaandrager M; Buşoniu L; Babuska R; Schuitema E
    IEEE Trans Syst Man Cybern B Cybern; 2012 Jun; 42(3):591-602. PubMed ID: 22156998
    [TBL] [Abstract][Full Text] [Related]  

  • 14. 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]  

  • 15. Network formation: neighborhood structures, establishment costs, and distributed learning.
    Chasparis GC; Shamma JS
    IEEE Trans Cybern; 2013 Dec; 43(6):1950-62. PubMed ID: 23757585
    [TBL] [Abstract][Full Text] [Related]  

  • 16. An approach to solve group-decision-making problems with ordinal interval numbers.
    Fan ZP; Liu Y
    IEEE Trans Syst Man Cybern B Cybern; 2010 Oct; 40(5):1413-23. PubMed ID: 20172834
    [TBL] [Abstract][Full Text] [Related]  

  • 17. On the stress function-based OWA determination method with optimization criteria.
    Liu X; Yu S
    IEEE Trans Syst Man Cybern B Cybern; 2012 Feb; 42(1):246-57. PubMed ID: 21824850
    [TBL] [Abstract][Full Text] [Related]  

  • 18. 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]  

  • 19. A class of single-class minimax probability machines for novelty detection.
    Kwok JT; Tsang IW; Zurada JM
    IEEE Trans Neural Netw; 2007 May; 18(3):778-85. PubMed ID: 17526343
    [TBL] [Abstract][Full Text] [Related]  

  • 20. An architecture for adaptive algorithmic hybrids.
    Cassimatis N; Bignoli P; Bugajska M; Dugas S; Kurup U; Murugesan A; Bello P
    IEEE Trans Syst Man Cybern B Cybern; 2010 Jun; 40(3):903-14. PubMed ID: 19914898
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 10.