找回密碼
 To register

QQ登錄

只需一步,快速開始

掃一掃,訪問微社區(qū)

打印 上一主題 下一主題

Titlebook: Nature Inspired Cooperative Strategies for Optimization (NICSO 2011); David Alejandro Pelta,Natalio Krasnogor,Rodica Lun Book 2011 Springe

[復(fù)制鏈接]
樓主: Flexible
41#
發(fā)表于 2025-3-28 17:00:46 | 只看該作者
Cooperation and Self-organized Criticality for Studying Economic Crises,vestigated and the solutions that can prevent these phenomena are searched for. A new economic model inspired by the . based on a connective structure is introduced. Interesting complex behaviour emerges from the simple interactions between the agents. A new, unconventional, cause for economic crises is identified and described.
42#
發(fā)表于 2025-3-28 21:01:40 | 只看該作者
43#
發(fā)表于 2025-3-29 02:06:33 | 只看該作者
44#
發(fā)表于 2025-3-29 03:59:06 | 只看該作者
Estimation of Distribution Algorithm for the Quay Crane Scheduling Problem, to/from) by means of the available quay cranes at a container terminal. The experimental results confirm that such algorithms are suitable for solving the QCSP and perform a wide exploration of the solution space using reduced computational times.
45#
發(fā)表于 2025-3-29 07:49:21 | 只看該作者
Enhancing the Computational Mechanics of Cellular Automata,st widely studied cellular automata computation problem, the Density Classification Task, where incorporation of the proposed method almost always pushes the search beyond the simple block-expanding rules.
46#
發(fā)表于 2025-3-29 12:44:01 | 只看該作者
47#
發(fā)表于 2025-3-29 17:40:56 | 只看該作者
An Adaptive Multiagent Strategy for Solving Combinatorial Dynamic Optimization Problems, in order to obtain a more robust behaviour. The adaptive scheme is also tested on an evolutionary algorithm (EA). Finally, both Agents and EA are compared against the recent state of the art adaptive hill-climbing memetic algorithm (AHMA).
48#
發(fā)表于 2025-3-29 22:56:17 | 只看該作者
49#
發(fā)表于 2025-3-30 01:23:09 | 只看該作者
50#
發(fā)表于 2025-3-30 05:32:14 | 只看該作者
Gravitational Swarm Approach for Graph Coloring, move as particles in the gravitational field defined by some target objects corresponding to graph node colors. Knowledge of the graph to be colored is encoded in the agents as friend-or-foe information. We discuss the convergence of the algorithm and test it over well-known benchmarking graphs, achieving good results in a reasonable time.
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點(diǎn)評 投稿經(jīng)驗(yàn)總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-5 16:41
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
琼中| 泰和县| 修武县| 揭东县| 浦东新区| 永宁县| 新闻| 遂平县| 大化| 伊川县| 鄂托克旗| 八宿县| 汝州市| 麻阳| 隆林| 南城县| 原阳县| 华亭县| 汕尾市| 元阳县| 安宁市| 抚松县| 布拖县| 玉山县| 上林县| 深泽县| 专栏| 宜阳县| 任丘市| 且末县| 东城区| 大邑县| 仁布县| 越西县| 东宁县| 子洲县| 永川市| 怀集县| 云安县| 凤凰县| 临颍县|