检索结果-内蒙古大学图书馆

17th International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems (IPMU)

作者： Garcia-Valdez, Mario Merelo Guervos, Juan Julian Lara, Lucero Garcia-Sanchez, Pablo Inst Tecnol Tijuana Tijuana BC Mexico Univ Granada Granada Spain Univ Cadiz Cadiz Spain

ISBN: (纸本)9783319914794;9783319914787

distributed computing systems can be created using volunteers, users who spontaneously, after receiving an invitation, decide to provide their own resources or storage to contribute to a common effort. They can, for instance, run a script embedded in a web page;thus, collaboration is straightforward, but also ephemeral, with resources depending on the amount of time the user decides to lend. This implies that the user has to be kept engaged so as to obtain as many computing cycles as possible. In this paper, we analyze a volunteer-based evolutionary computing system called NodIO with the objective of discovering design decisions that encourage volunteer participation, thus increasing the overall computing power. We present the results of an experiment in which a gamification technique is applied by adding a leader-board showing the top scores achieved by registered contributors. In NodIO, volunteers can participate without creating an account, so one of the questions we wanted to address was if the need to register would have a negative impact on user participation. The experiment results show that even if only a small percentage of users created an account, those participating in the competition provided around 90% of the work, thus effectively increasing the performance of the overall system.

关键词： distributed evolutionary algorithms Volunteer computing Socio-technical systems

来源：评论

学校读者我要写书评

暂无评论

evospace-js: Asynchronous Pool-Based Execution of Heterogeneous Metaheuristics 17

evospace-js: Asynchronous Pool-Based Execution of Heterogene...

引用

Genetic and evolutionary Computation Conference (GECCO)

作者： Garcia-Valdez, Mario Merelo, J. J. Inst Tecnolg Tijuana Tijuana Bc Mexico Univ Granada Dept ATC CITIC Grp GeNeura Granada Spain

ISBN: (纸本)9781450349390

This paper is part of a continuing effort in the field of EC to develop algorithms that follow an opportunistic approach to computing, allowing the exploitation of freely available services over the Internet by using free tiers of cloud services or volunteer computing resources;the EvoSpace model is able to tap from both kind of resources, using asynchronous evolutionary algorithms. We present its design, which follows an an event-driven architecture and asynchronous I/O model, and its implementation, with a server-side tier programmed in *** that uses Redis as an in-memory and high performance data store for the population. This population store is exposed to clients running population-based and nature-inspired metaheuristics through a REST API. Additional capabilities where implemented in this version to allow the logging of experiments where heterogeneous algorithms are executed in parallel. These logs can then be transformed to other formats. As a case study an hybrid global optimization algorithm has been implemented mixing two algorithms: a PSO algorithm from the EvoloPy library and a GA using the DEAP framework. The result was transformed to files compatible to the Comparing Continuous Optimizer platform in order to use their post-processing code. Clients in this case have been developed in the Python language, the language used to implement both libraries. The results from this case study suggest, first, that EvoSpace can be used as a paradigm-and language-agnostic platform for population-based optimization algorithms, and also that this software can yield performance improvements and a viable platform to execute and compare asynchronous pool-based metaheuristics.

关键词： Nature-inspired metaheuristics distributed evolutionary algorithms

来源：评论

学校读者我要写书评

暂无评论

Benchmarking a Pool-Based Execution with GA and PSO Workers on the BBOB Noiseless Testbed 17

Benchmarking a Pool-Based Execution with GA and PSO Workers ...

引用

Genetic and evolutionary Computation Conference (GECCO)

作者： Garcia-Valdez, Mario Merelo, J. J. Inst Tecnolg Tijuana Tijuana Bc Mexico Univ Granada Dept ATC CITIC Grp GeNeura Granada Spain

ISBN: (纸本)9781450349390

In this work, we evaluate an asynchronous population-based algorithm following a pool-based approach. In Pool-based algorithms, a collection of workers collaborates through a shared population repository. In particular, we followed the EvoSpace approach in which workers asynchronously interact with a population pool by taking samples of the population to perform a standard search on the samples, to then return newly evolved solutions back to the pool. For this purpose, we use the BBOB Noiseless Testbed and a hybrid algorithm combining two kinds or workers: PSO and GA. We find that a Pool-based approach outperforms the canonical GA and PSO algorithms in nearly all cases. The results of these tests suggest that a Pool Based approach can be used to implement hybrid algorithms that can improve the performance of canonical population-based optimization algorithms.

关键词： Benchmarking Black-box optimization Nature-inspired metaheuristics distributed evolutionary algorithms

来源：评论

学校读者我要写书评

暂无评论

Large Scale Evolution of Convolutional Neural Networks Using Volunteer Computing 17

Large Scale Evolution of Convolutional Neural Networks Using...

引用

Genetic and evolutionary Computation Conference (GECCO)

作者： Desell, Travis Univ North Dakota 3950 Campus Rd Grand Forks ND 58201 USA

ISBN: (纸本)9781450349390

This work presents a new algorithm called evolutionary exploration of augmenting convolutional topologies (EXACT), which is capable of evolving the structure of convolutional neural networks (CNNs). EXACT is in part modeled after the neuroevolution of augmenting topologies (NEAT) algorithm, with notable exceptions to allow it to scale to large scale distributed computing environments and evolve networks with convolutional filters. In addition to multi-threaded and MPI versions, EXACT has been implemented as part of a BOINC volunteer computing project, allowing large scale evolution. During a period of two months, over 4,500 volunteered computers on the Citizen Science Grid trained over 120,000 CNNs and evolved networks reaching 98.32% test data accuracy on the MNIST handwritten digits dataset. Oese results are even stronger as the backpropagation strategy used to train the CNNs was fairly rudimentary (ReLU units, L2 regularization and Nesterov momentum) and these were initial test runs done without refinement of the backpropagation hyperparameters. Further, the EXACT evolutionary strategy is independent of the method used to train the CNNs, so they could be further improved by advanced techniques like elastic distortions, pretraining and dropout. The evolved networks are also quite interesting, showing "organic" structures and significant differences from standard human designed architectures.

关键词： Neuroevolution Convolutional Neural Networks Image Classification distributed evolutionary algorithms

来源：评论

学校读者我要写书评

暂无评论

Heterogenní ostrovní modely

Heterogenní ostrovní modely

引用

作者： Balcar, Štěpán Charles University of Prague

The work deals with heterogeneous island models. The work designs and implements a new island model based on knowledge of homogeneous models of evolutionary algorithms. The model allows dynamic replanning of general c... 详细信息

关键词： distributed evolutionary algorithms adaptability island architecture

来源：评论

学校读者我要写书评

暂无评论

Addressing High Dimensional Multi-objective Optimization Problems by Coevolutionary Islands with Overlapping Search Spaces 19th

Addressing High Dimensional Multi-objective Optimization Pro...

引用

19th European Conference on the Applications of evolutionary Computation (EvoApplications)

作者： Garcia-Sanchez, Pablo Ortega, Julio Gonzalez, Jesus Castillo, Pedro A. Merelo, Juan J. Univ Granada Dept Comp Architecture & Technol Granada Spain

ISBN: (纸本)9783319311531

Large-scale multi-objective optimization problems with many decision variables have recently attracted the attention of researchers as many data mining applications involving high dimensional patterns can be leveraged using them. Current parallel and distributed computer architectures can provide the required computing capabilities to cope with these problems once efficient procedures are available. In this paper we propose a cooperative coevolutionary island-model procedure based on the parallel execution of sub-populations, whose individuals explore different domains of the decision variables space. More specifically, the individuals belonging to the same sub-population (island) explore the same subset of decision variables. Two alternatives to distribute the decision variables among the different sub-populations have been considered and compared here. In the first approach, individuals in different sub-population explore disjoint subsets of decision variables (i.e. the chromosomes are divided into disjoints subsets). Otherwise, in the second alternative there are some overlapping among the variables explored by individuals in different sub-populations. The analysis of the obtained experimental results, by using different metrics, shows that coevolutionary approaches provide statistically significant improvements with respect to the base algorithm, being the relation of the number of islands (subpopulations) to the length of the chromosome (number of decision variables) a relevant factor to determine the most efficient alternative to distribute the decision variables.

关键词： Multi-objective algorithms NSGA-II Island model distributed evolutionary algorithms

来源：评论

学校读者我要写书评

暂无评论

The EvoSpace Model for Pool-Based evolutionary algorithms

引用

JOURNAL OF GRID COMPUTING 2015年第3期13卷 329-349页

作者： Garcia-Valdez, Mario Trujillo, Leonardo Merelo, Juan-J Fernandez de Vega, Francisco Olague, Gustavo Inst Tecnol Tijuana Tijuana 22414 BC Mexico Inst Tecnol Tijuana Dept Ingn Elect & Elect Posgrad Ciencias Ingn Tijuana 22414 BC Mexico Univ Granada Dept Arquitectura & Tecnol Comp Ctr Invest Tecnol Informac & Comunicac Granada Spain Univ Extremadura Grp Evoluc Artificial Extremadura Spain Ctr Invest Cient & Educ Super Ensenada Ensenada BC Mexico

This work presents the EvoSpace model for the development of pool-based evolutionary algorithms (Pool-EA). Conceptually, the EvoSpace model is built around a central repository or population store, incorporating some of the principles of the tuple-space model and adding additional features to tackle some of the issues associated with Pool-EAs;such as, work redundancy, starvation of the population pool, unreliability of connected clients or workers, and a large parameter space. The model is intended as a platform to develop search algorithms that take an opportunistic approach to computing, allowing the exploitation of freely available services over the Internet or volunteer computing resources within a local network. A comprehensive analysis of the model at both the conceptual and implementation levels is provided, evaluating performance based on efficiency, optima found and speedup, while providing a comparison with a standard EA and an island-based model. The issues of lost connections and system parametrization are studied and validated experimentally with encouraging results, that suggest how EvoSpace can be used to develop and implement different Pool-EAs for search and optimization.

关键词： Pool-based evolutionary algorithms distributed evolutionary algorithms Heterogeneous computing platforms for bioinspired algorithms Parameter setting

来源：评论

学校读者我要写书评

暂无评论

distributed evolutionary algorithms to TSP with Ring Topology

Distributed Evolutionary Algorithms to TSP with Ring Topolog...

引用

4th International Symposium on Intelligence Computation and Applications

作者： Huang, Shanzhi Zhu, Li Zhang, Fang He, Yongxiang Xue, Haidong China Univ Geosci Fac Comp Sci Wuhan 430074 Hubei Peoples R China

ISBN: (纸本)9783642049613

distributed evolutionary algorithms (dEAs) are stochastic search methods applied successfully in many searches, optimization, and machine learning problems. This paper proposes a dEA based on IGT. The dEA uses a ring topology,with each population choosing a random individual from it in a migration interval. The individual will be sent to next population and replace the worst individual of the population. It can be seen from the experiment that dEA with Ring transmission can produce better solutions when the population size of a TSP problem is large enough. The numerical results show the utility, versatility, efficiency and potential value of the proposed distributed evolutionary algorithm.

关键词： TSP distributed evolutionary algorithms PVM cluster computing ring topologies

来源：评论

学校读者我要写书评

暂无评论

A Cooperative Parallel Search-Based Software Engineering Approach for Code-Smells Detection

引用

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 2014年第9期40卷 841-861页

作者： Kessentini, Wael Kessentini, Marouane Sahraoui, Houari Bechikh, Slim Ouni, Ali Univ Montreal Dept Comp Sci Montreal PQ Canada Univ Michigan Dept Comp Sci Dearborn MI 48128 USA

We propose in this paper to consider code-smells detection as a distributed optimization problem. The idea is that different methods are combined in parallel during the optimization process to find a consensus regarding the detection of code-smells. To this end, we used Parallel evolutionary algorithms (P-EA) where many evolutionary algorithms with different adaptations (fitness functions, solution representations, and change operators) are executed, in a parallel cooperative manner, to solve a common goal which is the detection of code-smells. An empirical evaluation to compare the implementation of our cooperative P-EA approach with random search, two single population-based approaches and two code-smells detection techniques that are not based on meta-heuristics search. The statistical analysis of the obtained results provides evidence to support the claim that cooperative P-EA is more efficient and effective than state of the art detection approaches based on a benchmark of nine large open source systems where more than 85 percent of precision and recall scores are obtained on a variety of eight different types of code-smells.

关键词： Search-based software engineering code-smells software quality distributed evolutionary algorithms

来源：评论

学校读者我要写书评

暂无评论

Unreliable Heterogeneous Workers in a Pool-Based evolutionary Algorithm 17

引用

17th European Conference on Applications of evolutionary Computation (EvpApplications)

作者： Garcia-Valdez, Mario Merelo Guervos, Juan Julian Fernandez de Vega, Francisco Inst Tecnol Tijuana Tijuana BC Mexico Univ Granada Granada Spain Univ Extremadura Grp Evoluc Artificial Merida Spain

ISBN: (纸本)9783662455234;9783662455227

In this paper the effect of node unavailability in algorithms using EvoSpace, a pool-based evolutionary algorithm, is assessed. EvoSpace is a framework for developing evolutionary algorithms (EAs) using heterogeneous and unreliable resources. It is based on Linda's tuple space coordination model. The core elements of EvoSpace are a central repository for the evolving population and remote clients, here called EvoWorkers, which pull random samples of the population to perform on them the basic evolutionary processes (selection, variation and survival), once the work is done, the modified sample is pushed back to the central population. To address the problem of unreliable EvoWorkers, EvoSpace uses a simple re-insertion algorithm using copies of samples stored in a global queue which also prevents the starvation of the population pool. Using a benchmark problem from the P-Peaks problem generator we have compared two approaches: (i) the re-insertion of previous individuals at the cost of keeping copies of each sample, and a common approach of other pool based EAs, (ii) inserting randomly generated individuals. We found that EvoSpace is fault tolerant to highly unreliable resources and also that the re-insertion algorithm is only needed when the population is near the point of starvation.

关键词： distributed evolutionary algorithms Cloud computing

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：