找回密碼
 To register

QQ登錄

只需一步,快速開始

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

打印 上一主題 下一主題

Titlebook: Proceedings / Parcella 1988; Fourth International Gottfried Wolf,Tamáas Legendi,Udo Schendel Conference proceedings 1989 Springer-Verlag Be

[復(fù)制鏈接]
樓主: Fuctionary
21#
發(fā)表于 2025-3-25 04:10:48 | 只看該作者
22#
發(fā)表于 2025-3-25 09:11:11 | 只看該作者
Prolog implementations for cellular architectures, memory type, massively parallel computers, where the processor elements are identical and connected in a regular, neighbourhood oriented network. The second project investigates the possibility of implementing Prolog on a tipical SIMD machine, called Distributed Array Processor (DAP). The third pro
23#
發(fā)表于 2025-3-25 15:19:59 | 只看該作者
24#
發(fā)表于 2025-3-25 16:35:58 | 只看該作者
Fast parallel algorithms and the complexity of parallelism (basic issues and recent advances),lize. The notions of NC.-reducibilities, RNC.-reducibilities, log-space reducibilities are presented and problems complete (or randomly complete) for P are defined and discussed. The notion of optimal parallel time-number of processors tradeoff is highlighted and several techniques to achieve optima
25#
發(fā)表于 2025-3-25 20:14:52 | 只看該作者
Process-structured architectures to transform information flowing through,emembering, and reasoning in real time, even approaching the brain‘s speed and power — IF we knew how to build them. This paper proposes and explores a promising but largely ignored information-flow approach..For maximum speed and efficiency, massively parallel networks should be structured so that
26#
發(fā)表于 2025-3-26 02:39:19 | 只看該作者
27#
發(fā)表于 2025-3-26 04:39:58 | 只看該作者
Parallel conflict-free optimal access to complete extended q-ary trees,assignment function S is supposed to be recursively linear and nonlinear. Known results for extended binary subtree access are generalized to the case of extended q-ary subtrees. Furthermore optimal solutions for isotropic nonlinear extended q-ary subtree access are given.
28#
發(fā)表于 2025-3-26 10:02:35 | 只看該作者
29#
發(fā)表于 2025-3-26 15:35:13 | 只看該作者
Multiprocessor systems for large numerical applications, and many-body-models. The mathematical approximative methods used are numerical grid methods, molecular dynamics, Monte Carlo methods etc. The more complicate the considered phenomenon and the more refined the model is, the higher is the demand for computational power and storage capacity. Future h
30#
發(fā)表于 2025-3-26 18:54:22 | 只看該作者
https://doi.org/10.1007/3-540-50647-0Boolean function; Supercomputer; algorithm; algorithms; automata; complexity; image processing; processor; p
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點(diǎn)評(píng) 投稿經(jīng)驗(yàn)總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-9 14:07
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
三都| 安丘市| 永川市| 花莲市| 黄陵县| 离岛区| 绍兴县| 洞头县| 察哈| 双柏县| 密云县| 桦甸市| 三亚市| 思茅市| 永兴县| 闻喜县| 宾川县| 铁力市| 芜湖县| 班玛县| 新蔡县| 伊宁市| 洪江市| 任丘市| 五家渠市| 乐至县| 砀山县| 东平县| 渭源县| 句容市| 隆子县| 随州市| 台北县| 克东县| 乐业县| 当雄县| 昆山市| 永安市| 绥滨县| 东辽县| 巢湖市|