Description: - XCS for Dynamic Environments
+ Continuous versions of XCS
+ Test problem: real multiplexer
+ Experiments: XCS is explored in dynamic environments with different magnitudes of change to the underlying concepts.
+Reference papers:
H.H. Dam, H.A. Abbass, C.J. Lokan, Evolutionary Online Data Mining – an Investigation in a Dynamic Environment. 2005, accepted for a book chapter in Springer Series on Studies in Computational Intelligence
H.H. Dam, H.A. Abbass, C.J. Lokan, Be Real! XCS with Continuous-Valued Inputs. IWLCS 2005, (International Workshop on Learning Classifier Systems). Washington DC, June 2005.-- XCS for Continuous Dynamic Environments Test versions of XCS problem : real multiplexer Experiments : XCS is explored in dynamic environments with di fferent magnitudes of change to the underlying concepts. Reference papers : H. H. Dam, H. A. Abbass, C. J. Lokan. Evolutionary Online Data Mining-an Investiga tion in a Dynamic Environment. 2005. accepted for a book chapter in Springer Series o n Studies in Computational Intelligence H.H. D am, H. A. Abbass, C. J. Lokan. Be Real! XCS with Continuous - Valued Inputs. IW LCS 2005. (International Workshop on Learning Classifi er Systems). Washington DC, June 2005. Platform: |
Size: 23001 |
Author:李恆寬 |
Hits:
Description: Recent peer-to-peer (P2P) systems are characterized by decentralized control, large scale and extreme dynamism of their operating environment. As such, they can be seen as instances of complex adaptive systems (CAS) typically found in biological and social sciences. Anthill is a framework to support the design, implementation and evaluation of P2P applications based on ideas such as multi-agent and evolutionary programming borrowed from CAS. An Anthill system consists of a dynamic network of peer nodes societies of adaptive agents travel through this network, interacting with nodes and cooperating with other agents in order to solve complex problems. Anthill can be used to construct different classes of P2P services that exhibit resilience, adaptation and self-organization properties. Platform: |
Size: 5886840 |
Author:ada |
Hits:
Description: - XCS for Dynamic Environments
+ Continuous versions of XCS
+ Test problem: real multiplexer
+ Experiments: XCS is explored in dynamic environments with different magnitudes of change to the underlying concepts.
+Reference papers:
H.H. Dam, H.A. Abbass, C.J. Lokan, Evolutionary Online Data Mining – an Investigation in a Dynamic Environment. 2005, accepted for a book chapter in Springer Series on Studies in Computational Intelligence
H.H. Dam, H.A. Abbass, C.J. Lokan, Be Real! XCS with Continuous-Valued Inputs. IWLCS 2005, (International Workshop on Learning Classifier Systems). Washington DC, June 2005.-- XCS for Continuous Dynamic Environments Test versions of XCS problem : real multiplexer Experiments : XCS is explored in dynamic environments with di fferent magnitudes of change to the underlying concepts. Reference papers : H. H. Dam, H. A. Abbass, C. J. Lokan. Evolutionary Online Data Mining-an Investiga tion in a Dynamic Environment. 2005. accepted for a book chapter in Springer Series o n Studies in Computational Intelligence H.H. D am, H. A. Abbass, C. J. Lokan. Be Real! XCS with Continuous- Valued Inputs. IW LCS 2005. (International Workshop on Learning Classifi er Systems). Washington DC, June 2005. Platform: |
Size: 22528 |
Author:李恆寬 |
Hits:
Description: Recent peer-to-peer (P2P) systems are characterized by decentralized control, large scale and extreme dynamism of their operating environment. As such, they can be seen as instances of complex adaptive systems (CAS) typically found in biological and social sciences. Anthill is a framework to support the design, implementation and evaluation of P2P applications based on ideas such as multi-agent and evolutionary programming borrowed from CAS. An Anthill system consists of a dynamic network of peer nodes societies of adaptive agents travel through this network, interacting with nodes and cooperating with other agents in order to solve complex problems. Anthill can be used to construct different classes of P2P services that exhibit resilience, adaptation and self-organization properties. Platform: |
Size: 5886976 |
Author:ada |
Hits:
Description: 关于电力系统无功优化方面的论文，该论文使用改进的进化算法并结合动态的突变标准。-With regard to reactive power optimization papers, the papers use the improved evolutionary algorithm combined with dynamic mutation standard. Platform: |
Size: 228352 |
Author:xiaofang |
Hits:
Description: 多目标优化进化算法目前公认效果收敛性最好的算法NSGA2c++源码,具有一般性，可在此基础上继续改进，对实现其他多目标优化算法很有帮助.-Multi-objective optimization evolutionary algorithm is currently the best recognized effect of convergence of the algorithm NSGA2c++ Source, with the general, could be on this basis to continue to improve the achievement of other multi-objective optimization algorithm helpful. Platform: |
Size: 116736 |
Author:antercy |
Hits:
Description: 细菌觅食随机优化论文及matlab源码。该算法属于进化算法的一种，可以处理全局优化、多目标优化、约束优化和动态优化等问题。-Bacterial feeding stochastic optimization papers and matlab source code. The algorithm belongs to a kind of evolutionary algorithm that can deal with global optimization, multi-objective optimization, constrained optimization and dynamic optimization problems. Platform: |
Size: 2452480 |
Author:bxingliu |
Hits:
Description: 蚁群算法是一种用来在图中寻找优化路径的机率型技术，该算法具有许多优良的性质，具有一种新的模拟进化优化方法的有效性和应用价值， 是一种求解组合最优化问题的新型通用启发式方法，可以解决一维静态优化问题甚至多维动态组合优化问题。
-Ant colony algorithm is a method used to find optimal path in the graph of the probability-based technology, the algorithm has many good properties, with a new kind of simulated evolutionary optimization method is effective and value is a kind of solving combinatorial optimization issue a new general-purpose heuristic method to solve the static optimization problem of one-dimensional or even multi-dimensional dynamic combinatorial optimization problems. Platform: |
Size: 2048 |
Author:曹艳丽 |
Hits:
Description: 矩形条带装箱问题(RSPP)是指将一组矩形装入在一个宽度固定高度不限的矩形容器中，以期
获得最小装箱高度．RSPP理论上属于NP难问题，在新闻组版、布料下料以及金属切割等工业领域中
有着广泛的应用．为解决该问题，采用了一种混合算法，即将一种新的启发式算法—— 动态匹配算
法—— 与遗传算法结合起来．混合算法中，动态匹配算法能根据4类启发式规则动态选择与装填区域相
匹配的下一个待装矩形，同时将装箱后所需容器高度用遗传算法的进化策略进行优化．对2组标准测试
问题的计算结果表明，相对于文献中的已有算法，提出的算法更加有效．-Given a set of small rectangular pieces of different sizes and a rectangular container of fixed
width and infinite length，the rectangular strip packing problem (RSPP) consists of orthogonally
placing all the pieces within the container，without overlapping，such that the overall length of the
packing is minimized． RSPP belongs to NP—hard problem in theory and has many industrial
applications such as the composition of news，the cutting of elothing and the cutting of metal，etc．To
solve the rectangular strip packing problem ，a hybrid algorithm ，which combines a novel heuristic
algorithm- dynamic—fit heuristic algorithm (DFHA)，with the genetic algorithm，is adopted． The
DFHA algorithm can dynamically select the better-fit rectangle for packing，according to the width—fit
first(W FF)rule，the height—fit first(HFF) rule，the placeable first(PF) rule，and the biggest—
rectangle first(BRF)rule，and the evolutionary capability of genetic algorithm is used to optimize the
height of the packing Platform: |
Size: 477184 |
Author:郭事业 |
Hits:
Description: 演化博弈理论的经典书籍之一，主要讲演化动态博弈及其扩展形式，值得一读-Evolutionary game theory, one of the classic books, the main lecture of the dynamic game and its extended form, is worth reading Platform: |
Size: 1414144 |
Author:MGC |
Hits:
Description: 多宇宙并行量子多目标进化算法。该算法主要思想如下：将所有的量子个体按给定的拓扑结构分成多个独立的子种群，划分为多个宇宙；采用目标个体均匀分配原则和动态调整旋转角机制对各宇宙量子个体进行演化；宇宙之间采用最佳移民操作来交换信息，设计最优个体保留方案以便各宇宙共享全局信息，提高算法的执行效率。-Multi-quantum universe parallel multi-objective evolutionary algorithm. The main idea of the algorithm is as follows: all quantum individual at a given topology into a plurality of separate sub-population is divided into a plurality of space uniform distribution of target individual using the principles and mechanisms for dynamic adjustment of the rotation angle of the quantum universe evolution individuals universe using the best migration operation to exchange information, design the optimal solution for each individual reservations universe shared global information to enhance the efficiency of the algorithm. Platform: |
Size: 98304 |
Author:baiyang |
Hits:
Description: An Evolutionary Routing Protocol for Dynamic Clustering of Wireless Sensor Networks using HCR-An Evolutionary Routing Protocol for Dynamic Clustering of Wireless Sensor Networks using HCR Platform: |
Size: 151552 |
Author:Bhardwaj |
Hits:
Description: 电力系统无功优化对确保电力系统优化运行具有重要作用,它直接关系到电力系统运行的安全性与经济性。在已有研究成果的基础上,提出了单目标／多目标的导向搜索算法与单目标／多目标的动态多群体自适应差分进化算法,对电力系统静态单目标无功优化、静态多目标无功优化、动态单目标无功优化、动态多目标无功优化、典型函数优化等问题进行了深入的研究和探讨。-Reactive power optimization to ensure the optimal operation of the power system plays an important role, it is directly related to the operation of the power system security and economy. On the basis of existing research results on the proposed single-objective/multiple targets with a single goal-oriented search algorithm adaptive differential dynamic multi-group/multi-objective evolutionary algorithm for power system static single objective reactive power optimization, static multi-objective without power optimization, dynamic single objective reactive power optimization, dynamic multi-objective optimization of reactive power, the typical function optimization problems in-depth study and discussion. Platform: |
Size: 10393600 |
Author:杰 |
Hits:
Search - dynamic evolutionary