arXiv:1412.5384
Representation of Evolutionary Algorithms in FPGA Cluster for Project of Large-Scale Networks
원문 초록
Many problems are related to network projects, such as electric distribution, telecommunication and others. Most of them can be represented by graphs, which manipulate thousands or millions of nodes, becoming almost an impossible task to obtain real-time solutions. Many efficient solutions use Evolutionary Algorithms (EA), where researches show that performance of EAs can be substantially raised by using an appropriate representation, such as the Node-Depth Encoding (NDE). The objective of this work was to partition an implementation on single-FPGA (Field-Programmable Gate Array) based on NDE from 512 nodes to a multi-FPGAs approach, expanding the system to 4096 nodes.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Graph-Supported Dynamic Algorithm Configuration for Multi-Objective Combinatorial Optimization
Randomised Optimism via Competitive Co-Evolution for Matrix Games with Bandit Feedback
Benchmarking MOEAs for solving continuous multi-objective RL problems
Mergenetic: a Simple Evolutionary Model Merging Library
Evolutionary thoughts: integration of large language models and evolutionary algorithms
RainbowPlus: Enhancing Adversarial Prompt Generation via Evolutionary Quality-Diversity Search
토론
이 논문과 연결된 포럼 글이 아직 없습니다.