Journal Article10.1016/J.JOCS.2011.08.002
A multi-agent memetic algorithm approach for distributed object allocation
10
TL;DR: It is shown that distributed object allocation problem in DCE with an objective to allocate objects over different servers so that the number of inter-server communications can be minimized is similar to the graph bisection problem.
read more
About: This article is published in Journal of Computational Science. The article was published on 01 Dec 2011. The article focuses on the topics: Distributed object & Memetic algorithm.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Distributed evolutionary algorithms and their models
Yue-Jiao Gong,Wei-Neng Chen,Zhi-Hui Zhan,Jun Zhang,Yun Li,Qingfu Zhang,Jingjing Li +6 more
- 01 Sep 2015
TL;DR: A comprehensive survey of the state-of-the-art distributed evolutionary algorithms and models, which have been classified into two groups according to their task division mechanism, and insights into the models are presented and discussed.
An enhanced genetic algorithm with new operators for task scheduling in heterogeneous computing systems
TL;DR: A genetic-based algorithm as a meta-heuristic method to address static task scheduling for processors in heterogeneous computing systems and improves the performance of genetic algorithm through significant changes in its genetic functions and introduction of new operators that guarantee sample variety and consistent coverage of the whole space.
119
Layout-aware scientific computing: A case study using the MILC code
TL;DR: A straightforward model to optimize the layout for scientific applications by minimizing inter-node communication cost is proposed that takes into account the latency and bandwidth of the network and associates them with the dominant layout variables of the application.
1
Exciting Times in Computational Science
TL;DR: This new issue of the Journal of Computational Science completes its second year of publication and covers a road range of computational science, with discussions of novel topics such as stochastic simulations f intra-cellular transport, new approaches to coupled systems in omputational fluid dynamics, the emergence of geographical paters of electoral preferences and the optimisation of climate model arameters.
1
Lower bounds for constrained task allocation problem in distributed computing environment
Parag C. Pendharkar
- 22 Oct 2012
TL;DR: This paper proposes a heuristic lower bound (HLB), a linear programming relaxation (LPR) lower bound and a lagrangean relaxation with subgradient optimization (LRSO) based lower bound for the constrained task allocation problem (CTAP).
1
References
Genetic algorithms in search, optimization and machine learning
David E. Goldberg
- 01 Jan 1989
TL;DR: This book brings together the computer techniques, mathematical tools, and research results that will enable both students and practitioners to apply genetic algorithms to problems in many fields.
58.6K
•Book
Genetic algorithms in search, optimization, and machine learning
David E. Goldberg
- 01 Sep 1988
TL;DR: In this article, the authors present the computer techniques, mathematical tools, and research results that will enable both students and practitioners to apply genetic algorithms to problems in many fields, including computer programming and mathematics.
Optimization by Simulated Annealing
TL;DR: There is a deep and useful connection between statistical mechanics and multivariate or combinatorial optimization (finding the minimum of a given function depending on many parameters), and a detailed analogy with annealing in solids provides a framework for optimization of very large and complex systems.
46.9K
•Book
Computers and Intractability: A Guide to the Theory of NP-Completeness
Michael Randolph Garey,David S. Johnson +1 more
- 01 Jan 1979
TL;DR: The second edition of a quarterly column as discussed by the authors provides a continuing update to the list of problems (NP-complete and harder) presented by M. R. Garey and myself in our book "Computers and Intractability: A Guide to the Theory of NP-Completeness,” W. H. Freeman & Co., San Francisco, 1979.