Theoretical analysis of local search strategies to optimize network communication subject to preserving the total number of links
暂无分享,去创建一个
[1] Matthew Doar,et al. A better model for generating test networks , 1996, Proceedings of GLOBECOM'96. 1996 IEEE Global Telecommunications Conference.
[2] N. Sheehan,et al. On the irreducibility of a Markov chain defined on a space of genotype configurations by a sampling scheme. , 1993, Biometrics.
[3] Hyunseung Choo,et al. On Generating Random Network Structures: Connected Graphs , 2004, ICOIN.
[4] Noam Nisan,et al. Algorithms for selfish agents mechanism design for distributed computation , 1999 .
[5] Éva Tardos,et al. Near-Optimal Network Design with Selfish Agents , 2008, Theory Comput..
[6] Russ Bubley,et al. Randomized algorithms , 1995, CSUR.
[7] Jie Wu,et al. Small Worlds: The Dynamics of Networks between Order and Randomness , 2003 .
[8] Dominique Chu. Modes of evolution in a parasite-host interaction: Dis-entangling factors determining the evolution of regulated fimbriation in E. coli , 2009, Biosyst..
[9] Jonathan E. Rowe,et al. Some results about the Markov chains associated to GPs and general EAs , 2006, Theor. Comput. Sci..
[10] Chai-Keong Toh,et al. Performance evaluation of crossover switch discovery algorithms for wireless ATM LANs , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.
[11] Jonathan E. Rowe,et al. An extension of geiringer's theorem for a wide class of evolutionary search algorithms , 2006 .
[12] Thomas Jansen,et al. Stability in the self-organized evolution of networks , 2007, GECCO '07.
[13] Éva Tardos,et al. Near-optimal network design with selfish agents , 2003, STOC '03.
[14] R. Syski. Passage Times for Markov Chains , 1992 .
[15] D. Watts,et al. Small Worlds: The Dynamics of Networks between Order and Randomness , 2001 .
[16] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[17] Jonathan E. Rowe,et al. A Schema-Based Version of Geiringer's Theorem for Nonlinear Genetic Programming with Homologous Crossover , 2005, FOGA.
[18] T. C. Hu,et al. Multi-Terminal Network Flows , 1961 .
[19] Scott Shenker,et al. On a network creation game , 2003, PODC '03.
[20] BERNARD M. WAXMAN,et al. Routing of multipoint connections , 1988, IEEE J. Sel. Areas Commun..
[21] N. Sheehan,et al. On a misconception about irreducibility of the single-site Gibbs sampler in a pedigree application. , 2002, Genetics.
[22] T. C. Hu. Optimum Communication Spanning Trees , 1974, SIAM J. Comput..
[23] Michael Kaufmann,et al. Evolutionary algorithms for the self-organized evolution of networks , 2005, GECCO '05.
[24] Hyunseung Choo,et al. On Generating Random Network Structures: Trees , 2003, International Conference on Computational Science.
[25] Xin Yao,et al. A study of drift analysis for estimating computation time of evolutionary algorithms , 2004, Natural Computing.
[26] Donald Geman,et al. Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[27] Sanjeev Goyal,et al. A Noncooperative Model of Network Formation , 2000 .
[28] B. Hajek. Hitting-time and occupation-time bounds implied by drift analysis with applications , 1982, Advances in Applied Probability.
[29] Dominique Chu,et al. The evolution of group-level pathogenic traits. , 2008, Journal of theoretical biology.