![]() Tantar, Alexandru-Adrian ![]() ![]() in GECCO 2014 - Companion Publication of the 2014 Genetic and Evolutionary Computation Conference (2014) The rise of the data centers industry, together with the emergence of large cloud computing that require large quantities of resources to be maintained, brought the need of providing a sustainable ... [more ▼] The rise of the data centers industry, together with the emergence of large cloud computing that require large quantities of resources to be maintained, brought the need of providing a sustainable development process. Through this paper we aim to provide an introductory insight on the status and tools available to tackle this perspective within the evolutionary and genetic algorithms community. Existing advancement are also emphasized and perspectives outlined. [less ▲] Detailed reference viewed: 96 (5 UL)![]() ; ; Tantar, Alexandru-Adrian ![]() Book published by Springer (2014) Detailed reference viewed: 157 (3 UL)![]() Tantar, Alexandru-Adrian ![]() ![]() in GECCO 2014 - Proceedings of the 2014 Genetic and Evolutionary Computation Conference (2014) This work presents an asymmetric quadratic approximation model and an ε-archiving algorithm. The model allows to construct, under local convexity assumptions, descriptors for local optima points in ... [more ▼] This work presents an asymmetric quadratic approximation model and an ε-archiving algorithm. The model allows to construct, under local convexity assumptions, descriptors for local optima points in continuous functions. A descriptor can be used to extract confidence radius information. The ε-archiving algorithm is designed to maintain and update a set of such asymmetric descriptors, spaced at some given threshold distance. An in-depth analysis is conducted on the stability and performance of the asymmetric model, comparing the results with the ones obtained by a quadratic polynomial approximation. A series of different applications are possible in areas such as dynamic and robust optimization. © 2014 ACM. [less ▲] Detailed reference viewed: 140 (4 UL)![]() Tantar, Emilia ![]() ![]() ![]() in Tantar, Alexandru-Adrian; Tantar, Emilia; Jian-Qiao, Sun (Eds.) et al EVOLVE - A Bridge between Probability, Set Oriented Numerics, and Evolutionary Computation V (2014) Detailed reference viewed: 243 (10 UL)![]() ; ; et al in Tantar, Alexandru-Adrian; Tantar, Emilia; Sun, Jian-Qiao (Eds.) et al EVOLVE - A Bridge between Probability, Set Oriented Numerics, and Evolutionary Computation V (2014) Detailed reference viewed: 217 (9 UL)![]() Bouvry, Pascal ![]() in Soft Computing - A Fusion of Foundations, Methodologies and Applications (2013), 17(6), 909-912 Detailed reference viewed: 171 (6 UL)![]() ; Tantar, Alexandru-Adrian ![]() ![]() in Studies in Computational Intelligence (2013), 447 Genetic type particle methods are increasingly used to sample from complex high-dimensional distributions. They have found a wide range of applications in applied probability, Bayesian statistics ... [more ▼] Genetic type particle methods are increasingly used to sample from complex high-dimensional distributions. They have found a wide range of applications in applied probability, Bayesian statistics, information theory, and engineering sciences. Understanding rigorously these new Monte Carlo simulation tools leads to fascinating mathematics related to Feynman-Kac path integral theory and their interacting particle interpretations. In this chapter, we provide an introduction to the stochastic modeling and the theoretical analysis of these particle algorithms. We also illustrate these methods through several applications. [less ▲] Detailed reference viewed: 188 (3 UL)![]() Tantar, Emilia ![]() ![]() ![]() Book published by Springer (2013) Detailed reference viewed: 165 (5 UL)![]() ; ; et al Book published by Springer (2013) Detailed reference viewed: 119 (7 UL)![]() ; ; Bouvry, Pascal ![]() Book published by Springer (2012) Detailed reference viewed: 153 (1 UL)![]() Varrette, Sébastien ![]() ![]() ![]() in Proc. of the 14th Intl. Workshop on Nature Inspired Distributed Computing (NIDISC 2011), part of the 25th IEEE/ACM Intl. Parallel and Distributed Processing Symposium (IPDPS 2011) (2011) Detailed reference viewed: 136 (1 UL)![]() Varrette, Sébastien ![]() ![]() ![]() in 25th IEEE International Symposium on Parallel and Distributed Processing (IPDPS 2011) (2011) Detailed reference viewed: 154 (2 UL)![]() Tantar, Alexandru-Adrian ![]() ![]() ![]() in A classification of dynamic multi-objective optimization problems (2011) Detailed reference viewed: 173 (1 UL)![]() Tantar, Emilia ![]() ![]() ![]() in On dynamic multi-objective optimization - classification and performance measures (2011) In this work we focus on defining how dynamism can be modeled in the context of multi-objective optimization. Based on this, we construct a component oriented classification for dynamic multi-objective ... [more ▼] In this work we focus on defining how dynamism can be modeled in the context of multi-objective optimization. Based on this, we construct a component oriented classification for dynamic multi-objective optimization problems. For each category we provide synthetic examples that depict in a more explicit way the defined model. We do this either by positioning existing synthetic benchmarks with respect to the proposed classification or through new problem formulations. In addition, an online dynamic MNK-landscape formulation is introduced together with a new comparative metric for the online dynamic multi-objective context. [less ▲] Detailed reference viewed: 201 (0 UL)![]() ; Tantar, Emilia ![]() ![]() in IEEE Transactions on Antennas and Propagation (2011), 59(8), 2862-2871 The interest in sparse antenna arrays is growing, mainly due to cost concerns, array size limitations, etc. Formally, it can be shown that their design can be expressed as a constrained multidimensional ... [more ▼] The interest in sparse antenna arrays is growing, mainly due to cost concerns, array size limitations, etc. Formally, it can be shown that their design can be expressed as a constrained multidimensional nonlinear optimization problem. Generally, through lack of convex property, such a multiextrema problem is very tricky to solve by usual deterministic optimization methods. In this article, a recent stochastic approach, called Cross-Entropy method, is applied to the continuous constrained design problem. The method is able to construct a random sequence of solutions which converges probabilistically to the optimal or the near-optimal solution. Roughly speaking, it performs adaptive changes to probability density functions according to the Kullback-Leibler cross-entropy. The approach efficiency is illustrated in the design of a sparse antenna array with various requirements. [less ▲] Detailed reference viewed: 156 (3 UL)![]() Tantar, Alexandru-Adrian ![]() ![]() ![]() in Load balancing for sustainable ICT (2011) Detailed reference viewed: 160 (1 UL)![]() ![]() Tantar, Emilia ![]() ![]() in Parallel Programming, Models and Applications in Grid and P2P Systems (2009) Detailed reference viewed: 77 (1 UL) |
||