助力国内外作者成功发表NatureScience等国际顶尖期刊!

投稿难?全流程投稿协助,直达Accept!

CSSCICSCD北大统计源知网万方维普

专注期刊投稿咨询

多年服务铸就口碑期刊服务信赖之选
免费咨询

大类学科: 不限 医学 生物 物理 化学 农林科学 数学 地学天文 地学 环境科学与生态学 综合性期刊 管理科学 社会科学 查看全部热门领域

中科院分区: 不限 1区 2区 3区 4区

期刊收录: 不限 SCI SCIE

Memetic Computing

SCI期刊查询网 更新时间:2026-04-01 23:04:04
Memetic Computing封面

简称:MEMET COMPUT

ISSN:1865-9284

ESSN:1865-9284

所属分区:2区

出版地:GERMANY

出版周期:4 issues per year

创刊时间:2009

研究方向:COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE-OPERATIONS RESEARCH & MANAGEMENT SCIENCE

易录用期刊推荐+论文格式模板+论文快速过审指导

填写需求
联系方式
PS:专业学术顾问会及时联系解答。

Memetic Computing英文简介

Memes have been defined as basic units of transferrable information that reside in the brain and are propagated across populations through the process of imitation. From an algorithmic point of view, memes have come to be regarded as building-blocks of prior knowledge, expressed in arbitrary computational representations (e.g., local search heuristics, fuzzy rules, neural models, etc.), that have been acquired through experience by a human or machine, and can be imitated (i.e., reused) across problems.

The Memetic Computing journal welcomes papers incorporating the aforementioned socio-cultural notion of memes into artificial systems, with particular emphasis on enhancing the efficacy of computational and artificial intelligence techniques for search, optimization, and machine learning through explicit prior knowledge incorporation. The goal of the journal is to thus be an outlet for high quality theoretical and applied research on hybrid, knowledge-driven computational approaches that may be characterized under any of the following categories of memetics:

Type 1: General-purpose algorithms integrated with human-crafted heuristics that capture some form of prior domain knowledge; e.g., traditional memetic algorithms hybridizing evolutionary global search with a problem-specific local search.
Type 2: Algorithms with the ability to automatically select, adapt, and reuse the most appropriate heuristics from a diverse pool of available choices; e.g., learning a mapping between global search operators and multiple local search schemes, given an optimization problem at hand.
Type 3: Algorithms that autonomously learn with experience, adaptively reusing data and/or machine learning models drawn from related problems as prior knowledge in new target tasks of interest; examples include, but are not limited to, transfer learning and optimization, multi-task learning and optimization, or any other multi-X evolutionary learning and optimization methodologies.

IF值(影响因子)趋势图