98 related articles for article (PubMed ID: 28128289)
21. Merging Partially Labelled Trees: Hardness and a Declarative Programming Solution.
Labarre A; Verwer S
IEEE/ACM Trans Comput Biol Bioinform; 2014; 11(2):389-97. PubMed ID: 26355785
[TBL] [Abstract][Full Text] [Related]
22. Mining minimal motif pair sets maximally covering interactions in a protein-protein interaction network.
Boyen P; Neven F; van Dyck D; Valentim FL; van Dijk AD
IEEE/ACM Trans Comput Biol Bioinform; 2013; 10(1):73-86. PubMed ID: 23702545
[TBL] [Abstract][Full Text] [Related]
23. Discretized learning automata solutions to the capacity assignment problem for prioritized networks.
Oommen BJ; Roberts TD
IEEE Trans Syst Man Cybern B Cybern; 2002; 32(6):821-31. PubMed ID: 18244888
[TBL] [Abstract][Full Text] [Related]
24. Towards optimally multiplexed applications of universal arrays.
Ben-Dor A; Hartman T; Karp RM; Schwikowski B; Sharan R; Yakhini Z
J Comput Biol; 2004; 11(2-3):476-92. PubMed ID: 15285903
[TBL] [Abstract][Full Text] [Related]
25. An annealed chaotic maximum neural network for bipartite subgraph problem.
Wang J; Tang Z; Wang R
Int J Neural Syst; 2004 Apr; 14(2):107-16. PubMed ID: 15112368
[TBL] [Abstract][Full Text] [Related]
26. A box-covering algorithm for fractal scaling in scale-free networks.
Kim JS; Goh KI; Kahng B; Kim D
Chaos; 2007 Jun; 17(2):026116. PubMed ID: 17614703
[TBL] [Abstract][Full Text] [Related]
27. On the number of different dynamics in Boolean networks with deterministic update schedules.
Aracena J; Demongeot J; Fanchon E; Montalva M
Math Biosci; 2013 Apr; 242(2):188-94. PubMed ID: 23384974
[TBL] [Abstract][Full Text] [Related]
28. A deterministic annealing algorithm for approximating a solution of the linearly constrained nonconvex quadratic minimization problem.
Dang C; Liang J; Yang Y
Neural Netw; 2013 Mar; 39():1-11. PubMed ID: 23296021
[TBL] [Abstract][Full Text] [Related]
29. Performance comparison of heuristic algorithms for task scheduling in IaaS cloud computing environment.
Madni SHH; Abd Latiff MS; Abdullahi M; Abdulhamid SM; Usman MJ
PLoS One; 2017; 12(5):e0176321. PubMed ID: 28467505
[TBL] [Abstract][Full Text] [Related]
30. A deterministic annealing algorithm for the minimum concave cost network flow problem.
Dang C; Sun Y; Wang Y; Yang Y
Neural Netw; 2011 Sep; 24(7):699-708. PubMed ID: 21482456
[TBL] [Abstract][Full Text] [Related]
31. A Genetic Algorithm for the Bi-Level Topological Design of Local Area Networks.
Camacho-Vallejo JF; Mar-Ortiz J; López-Ramos F; Rodríguez RP
PLoS One; 2015; 10(6):e0128067. PubMed ID: 26102502
[TBL] [Abstract][Full Text] [Related]
32. Coordination of cluster ensembles via exact methods.
Christou IT
IEEE Trans Pattern Anal Mach Intell; 2011 Feb; 33(2):279-93. PubMed ID: 20421664
[TBL] [Abstract][Full Text] [Related]
33. Hierarchical genetic algorithm for near optimal feedforward neural network design.
Yen G; Lu H
Int J Neural Syst; 2002 Feb; 12(1):31-43. PubMed ID: 11852443
[TBL] [Abstract][Full Text] [Related]
34. Covering Convex Bodies and the Closest Vector Problem.
Naszódi M; Venzin M
Discrete Comput Geom; 2022; 67(4):1191-1210. PubMed ID: 35572812
[TBL] [Abstract][Full Text] [Related]
35. Perfect phylogenetic networks with recombination.
Wang L; Zhang K; Zhang L
J Comput Biol; 2001; 8(1):69-78. PubMed ID: 11339907
[TBL] [Abstract][Full Text] [Related]
36. LMI-based approach for global asymptotic stability analysis of recurrent neural networks with various delays and structures.
Wang Z; Zhang H; Jiang B
IEEE Trans Neural Netw; 2011 Jul; 22(7):1032-45. PubMed ID: 21609881
[TBL] [Abstract][Full Text] [Related]
37. Energy-Efficient Algorithm for Multicasting in Duty-Cycled Sensor Networks.
Chen Q; Cheng S; Gao H; Li J; Cai Z
Sensors (Basel); 2015 Dec; 15(12):31224-43. PubMed ID: 26690446
[TBL] [Abstract][Full Text] [Related]
38. Nonconvex compressed sensing by nature-inspired optimization algorithms.
Liu F; Lin L; Jiao L; Li L; Yang S; Hou B; Ma H; Yang L; Xu J
IEEE Trans Cybern; 2015 May; 45(5):1028-39. PubMed ID: 25148677
[TBL] [Abstract][Full Text] [Related]
39. A covering-graph approach to epidemics on SIS and SIS-like networks.
Floyd W; Kay L; Shapiro M
Bull Math Biol; 2012 Jan; 74(1):175-89. PubMed ID: 21989564
[TBL] [Abstract][Full Text] [Related]
40. A fully complex-valued radial basis function network and its learning algorithm.
Savitha R; Suresh S; Sundararajan N
Int J Neural Syst; 2009 Aug; 19(4):253-67. PubMed ID: 19731399
[TBL] [Abstract][Full Text] [Related]
[Previous] [Next] [New Search]
