Intelligent techniques are urged to achieve automatic allocation of the computing resource in Open Radio Access Network (O-RAN), to save computing resource, increase utilization rate of them and decrease the delay. However, the existing problem formulation to solve this resource allocation problem is unsuitable as it defines the capacity utility of resource in an inappropriate way and tends to cause much delay. Moreover, the existing problem has only been attempted to be solved based on greedy search, which is not ideal as it could get stuck into local optima. Considering those, a new formulation that better describes the problem is proposed. In addition, as a well-known global search meta heuristic approach, an evolutionary algorithm (EA) is designed tailored for solving the new problem formulation, to find a resource allocation scheme to proactively and dynamically deploy the computing resource for processing upcoming traffic data. Experimental studies carried out on several real-world datasets and newly generated artificial datasets with more properties beyond the real-world datasets have demonstrated the significant superiority over a baseline greedy algorithm under different parameter settings. Moreover, experimental studies are taken to compare the proposed EA and two variants, to indicate the impact of different algorithm choices.
Reactive, Proactive, and Inductive Agents: An evolutionary path for biological and artificial spiking networks
Sony Computer Science Laboratories, Inc.（索尼计算机科学研究所）；Earth-Life Science Institute, Tokyo Institute of Technology（东京工业大学地球生命研究所）；The University of Tokyo（东京大学）
EvolKV: Evolutionary KV Cache Compression for LLM Inference
School of Advanced Interdisciplinary Sciences, University of Chinese Academy of Sciences（中国科学院大学先进交叉学科学院）；The Key Laboratory of Cognition and Decision Intelligence for Complex Systems, Institute of Automation, CAS（复杂系统认知与决策智能重点实验室）；ETH Zurich（苏黎世联邦理工学院）
Multi-Objective Evolutionary Optimization of Chance-Constrained Multiple-Choice Knapsack Problems with Implicit Probability Distributions
Southern University of Science and Technology（南方科技大学）；Central China Normal University（华中师范大学）；Institute of High Performance Computing, Agency for Science Technology and Research（新加坡科技研究局高性能计算研究所）；Nanyang Technological University（南洋理工大学）
