找回密碼
 To register

QQ登錄

只需一步,快速開始

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

打印 上一主題 下一主題

Titlebook: Computational Science and Its Applications -- ICCSA 2012; 12th International C Beniamino Murgante,Osvaldo Gervasi,Bernady O. Apdu Conferenc

[復制鏈接]
樓主: interleukins
11#
發(fā)表于 2025-3-23 11:07:54 | 只看該作者
12#
發(fā)表于 2025-3-23 15:03:01 | 只看該作者
13#
發(fā)表于 2025-3-23 19:16:31 | 只看該作者
14#
發(fā)表于 2025-3-23 23:51:29 | 只看該作者
Global Hybrid Ant Bee Colony Algorithm for Training Artificial Neural Networksordinary ABC, Levenberg-Marquardt (LM) training algorithms. From the investigated results, the proposed GHABC algorithm did get better the learning efficiency for NNs using Boolean Function classification task.
15#
發(fā)表于 2025-3-24 06:05:44 | 只看該作者
Swarm Grid: A Proposal for High Performance of Parallel Particle Swarm Optimization Using GPGPUan reduce total execution time drastically and also, improve greatly the optimization process convergence. These parameters include the number of swarms and that of particles per swarm, together with their mapping into blocks and threads, respectively. All the swarms and particles therein operate in
16#
發(fā)表于 2025-3-24 07:33:07 | 只看該作者
An Artificial Immune System Approach to Associative Classificationach generates dramatically less rules than traditional AC algorithms. Hence, the proposed approach is indeed significantly more efficient than traditional AC algorithms while achieving good competitive accuracy.
17#
發(fā)表于 2025-3-24 12:44:06 | 只看該作者
Axis-Parallel Dimension Reduction for Biometric Research FAR (False Accept Rate) and FRR (False Reject Rate) both individually and if used together. Finally, the last section proposes the alternative multimodal system architecture with additional features that can further improve system performance in terms of accuracy and circumvention.
18#
發(fā)表于 2025-3-24 17:00:57 | 只看該作者
19#
發(fā)表于 2025-3-24 19:53:27 | 只看該作者
Processor Allocation for Optimistic Parallelization of Irregular Programsally, and the runtime system detects conflicts between concurrent activities, aborting and rolling back conflicting tasks. However, parallelism in irregular algorithms is very complex. In a regular algorithm like dense matrix multiplication, the amount of parallelism can usually be expressed as a fu
20#
發(fā)表于 2025-3-25 01:19:04 | 只看該作者
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學 Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點評 投稿經(jīng)驗總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學 Yale Uni. Stanford Uni.
QQ|Archiver|手機版|小黑屋| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-13 22:00
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復 返回頂部 返回列表
四川省| 苗栗县| 错那县| 鹤岗市| 仙桃市| 绥滨县| 南汇区| 子长县| 濮阳市| 辽中县| 潞西市| 苏州市| 易门县| 彰化县| 灵宝市| 长岛县| 东乌珠穆沁旗| 宣恩县| 盘锦市| 徐水县| 渭南市| 顺昌县| 镶黄旗| 平乐县| 运城市| 韶关市| 尚义县| 临朐县| 随州市| 鄂尔多斯市| 大名县| 罗山县| 北京市| 萝北县| 慈溪市| 莲花县| 东阿县| 茂名市| 无锡市| 靖江市| 永修县|