A genetic programming based learning system to derive multipole and local expansions for the fast multipole method
暂无分享,去创建一个
Nicolas Gaud | Abder Koukam | Nasser Mozayani | Seyed Naser Razavi | A. Koukam | N. Mozayani | S. Razavi | N. Gaud
[1] D. Zorin,et al. A kernel-independent adaptive fast multipole algorithm in two and three dimensions , 2004 .
[2] Byoung-Tak Zhang,et al. Evolving Optimal Neural Networks Using Genetic Algorithms with Occam's Razor , 1993, Complex Syst..
[3] John R. Koza,et al. Genetic programming - on the programming of computers by means of natural selection , 1993, Complex adaptive systems.
[4] Leslie Greengard,et al. A fast algorithm for particle simulations , 1987 .
[5] V. Rokhlin. Rapid solution of integral equations of classical potential theory , 1985 .
[6] Riccardo Poli,et al. Using Schema Theory To Explore Interactions Of Multiple Operators , 2002, GECCO.
[7] Byoung-Tak Zhang,et al. Balancing Accuracy and Parsimony in Genetic Programming , 1995, Evolutionary Computation.
[8] Lexing Ying,et al. A New Parallel Kernel-Independent Fast Multipole Method , 2003, ACM/IEEE SC 2003 Conference (SC'03).
[9] Jack J. Dongarra,et al. Guest Editors Introduction to the top 10 algorithms , 2000, Comput. Sci. Eng..
[10] J A Foster,et al. Effects of code growth and parsimony pressure on populations in genetic programming. , 1998, Evolutionary computation.
[11] Bo Zhang,et al. A Fourier-series-based kernel-independent fast multipole method , 2011, J. Comput. Phys..
[12] Lee Spector,et al. Size Control Via Size Fair Genetic Operators In The PushGP Genetic Programming System , 2002, GECCO.
[13] Anoop Gupta,et al. Load Balancing and Data locality in Adaptive Hierarchical N-Body Methods: Barnes-Hut, Fast Multipole, and Rasiosity , 1995, J. Parallel Distributed Comput..
[14] Paulo Cortez,et al. Opening black box Data Mining models using Sensitivity Analysis , 2011, 2011 IEEE Symposium on Computational Intelligence and Data Mining (CIDM).
[15] Nicolas Gaud,et al. Multi-agent based simulations using fast multipole method: application to large scale simulations of flocking dynamical systems , 2010, Artificial Intelligence Review.
[16] Terence Soule,et al. Effects of Code Growth and Parsimony Pressure on Populations in Genetic Programming , 1998, Evolutionary Computation.
[17] K. Kinnear. Fitness landscapes and difficulty in genetic programming , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.
[18] Pat Hanrahan,et al. A rapid hierarchical radiosity algorithm , 1991, SIGGRAPH.
[19] Lexing Ying,et al. A kernel independent fast multipole algorithm for radial basis functions , 2006, J. Comput. Phys..
[20] L. Greengard. The Rapid Evaluation of Potential Fields in Particle Systems , 1988 .
[21] Per-Gunnar Martinsson,et al. An Accelerated Kernel-Independent Fast Multipole Method in One Dimension , 2007, SIAM J. Sci. Comput..
[22] William B. Langdon,et al. Size Fair and Homologous Tree Crossovers for Tree Genetic Programming , 2000, Genetic Programming and Evolvable Machines.
[23] P. Angeline. An Investigation into the Sensitivity of Genetic Programming to the Frequency of Leaf Selection Duri , 1996 .
[24] Riccardo Poli,et al. A Simple but Theoretically-Motivated Method to Control Bloat in Genetic Programming , 2003, EuroGP.
[25] Riccardo Poli,et al. A Field Guide to Genetic Programming , 2008 .
[26] V. Rokhlin,et al. Rapid Evaluation of Potential Fields in Three Dimensions , 1988 .
[27] A. E. Eiben,et al. Introduction to Evolutionary Computing , 2003, Natural Computing Series.
[28] Nicolas Gaud,et al. Automatic dynamics simplification in Fast Multipole Method: application to large flocking systems , 2012, The Journal of Supercomputing.
[29] Byoung-Tak Zhang,et al. Evolutionary Induction of Sparse Neural Trees , 1997, Evolutionary Computation.
[30] Riccardo Poli,et al. The evolution of size and shape , 1999 .
[31] William B. Langdon,et al. Size fair and homologous tree genetic programming crossovers , 1999 .