咨询与建议

限定检索结果

文献类型

  • 1,547 篇 期刊文献
  • 736 篇 会议
  • 11 篇 学位论文
  • 3 册 图书

馆藏范围

  • 2,297 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 1,934 篇 工学
    • 1,499 篇 计算机科学与技术...
    • 536 篇 电气工程
    • 304 篇 软件工程
    • 146 篇 信息与通信工程
    • 111 篇 控制科学与工程
    • 61 篇 机械工程
    • 57 篇 电子科学与技术(可...
    • 53 篇 力学(可授工学、理...
    • 37 篇 航空宇航科学与技...
    • 30 篇 材料科学与工程(可...
    • 28 篇 仪器科学与技术
    • 25 篇 动力工程及工程热...
    • 18 篇 土木工程
    • 15 篇 测绘科学与技术
    • 14 篇 化学工程与技术
    • 14 篇 石油与天然气工程
    • 10 篇 生物医学工程(可授...
    • 10 篇 网络空间安全
  • 707 篇 理学
    • 511 篇 数学
    • 121 篇 物理学
    • 44 篇 化学
    • 29 篇 地球物理学
    • 26 篇 生物学
    • 19 篇 系统科学
    • 18 篇 统计学(可授理学、...
  • 169 篇 管理学
    • 156 篇 管理科学与工程(可...
    • 10 篇 工商管理
    • 10 篇 图书情报与档案管...
  • 32 篇 医学
    • 24 篇 临床医学
  • 9 篇 经济学
    • 8 篇 应用经济学
  • 9 篇 农学
  • 6 篇 法学
  • 4 篇 教育学
  • 2 篇 艺术学

主题

  • 2,297 篇 parallel algorit...
  • 97 篇 gpu
  • 52 篇 cuda
  • 50 篇 domain decomposi...
  • 45 篇 image processing
  • 42 篇 finite element
  • 38 篇 mapreduce
  • 35 篇 mpi
  • 34 篇 parallel algorit...
  • 30 篇 hypercube
  • 27 篇 time complexity
  • 26 篇 optimization
  • 26 篇 navier-stokes eq...
  • 25 篇 sorting
  • 24 篇 data mining
  • 23 篇 openmp
  • 21 篇 graphics process...
  • 20 篇 load balancing
  • 20 篇 parallel computi...
  • 20 篇 selection

机构

  • 21 篇 southwest univ s...
  • 13 篇 natl taiwan univ...
  • 12 篇 guizhou normal u...
  • 10 篇 georgia state un...
  • 8 篇 hunan univ coll ...
  • 7 篇 griffith univ sc...
  • 7 篇 beihang univ sch...
  • 6 篇 virginia tech de...
  • 6 篇 beihang univ sta...
  • 6 篇 suny coll new pa...
  • 6 篇 china univ geosc...
  • 5 篇 nanyang technol ...
  • 5 篇 soochow univ sch...
  • 5 篇 univ chinese aca...
  • 5 篇 iowa state univ ...
  • 5 篇 natl univ def te...
  • 5 篇 guangxi teachers...
  • 5 篇 univ texas dept ...
  • 5 篇 natl taiwan univ...
  • 5 篇 univ naples fede...

作者

  • 32 篇 shang yueqiang
  • 22 篇 horng sj
  • 16 篇 zheng bo
  • 13 篇 li kenli
  • 13 篇 shen h
  • 12 篇 akl sg
  • 12 篇 chung kl
  • 11 篇 bahig hazem m.
  • 10 篇 ito yasuaki
  • 10 篇 pan y
  • 10 篇 liu jie
  • 10 篇 nakano koji
  • 9 篇 mei gang
  • 9 篇 tsai hr
  • 8 篇 shi hc
  • 7 篇 bozejko wojciech
  • 7 篇 kao tw
  • 7 篇 wang wei
  • 7 篇 li keqin
  • 7 篇 zapata el

语言

  • 2,095 篇 英文
  • 169 篇 其他
  • 31 篇 中文
  • 1 篇 法文
  • 1 篇 俄文
检索条件"主题词=Parallel algorithm"
2297 条 记 录,以下是2161-2170 订阅
排序:
DETERMINING THE MODE IN parallel
收藏 引用
parallel Processing Letters 1991年 第1期1卷 3-10页
作者: ELIEZER A. ALBACEA Department of Computer Science Australian National University GPO Box 4 Canberra ACT 2601 Australia
We show that the problem of finding the element with the highest frequency in a set, the mode of the set, is bounded by the problem of sorting multisets. As a consequence, we obtained an improvement of the upper bound... 详细信息
来源: 评论
A parallel algorithm FOR THE MAXIMUM 2-CHAIN EDGE PACKING PROBLEM
收藏 引用
INFORMATION PROCESSING LETTERS 1989年 第6期32卷 277-279页
作者: SHIRAISHI, S Dep. Appl. Math. Fukuoka Univ. Fukuoka 814-01 Japan
The author presents a parallel algorithm for finding a maximum 2-chain edge packing of an undirected graph G = (V, E). It runs in O(log n) time using O(n + m) processors on a CRCW PRAM, where n = !V! and m = !E!.
来源: 评论
A parallel algorithm FOR FINDING THE MAXIMUM VALUE
收藏 引用
parallel COMPUTING 1989年 第1期10卷 101-108页
作者: HORIGUCHI, S MIRANKER, WL IBM Thomas J. Watson Research Center Yorktown Heights NY 10598 U.S.A.
A new parallel algorithm for finding the maximum value of a data set is proposed. Execution times are investigated by taking into account the effect of the overhead time of communication for four kinds of interconnect... 详细信息
来源: 评论
A parallel algorithm FOR DETERMINING TWO-DIMENSIONAL OBJECT POSITIONS USING INCOMPLETE INFORMATION ABOUT THEIR BOUNDARIES
收藏 引用
PATTERN RECOGNITION 1989年 第1期22卷 21-28页
作者: AMINI, AA WEYMOUTH, TE ANDERSON, DJ UNIV MICHIGAN DEPT ELECT ENGN & COMP SCIANN ARBORMI 48109
Extraction of two-dimensional object locations using current techniques is a computationally intensive process. In this paper a parallel algorithm is presented that can specify the location of objects from edge streak... 详细信息
来源: 评论
MODELLING A MORPHOLOGICAL THINNING algorithm FOR SHARED MEMORY SIMD COMPUTERS
收藏 引用
parallel Processing Letters 1991年 第1期1卷 59-65页
作者: ABHIJIT DATTA SHIRISH V. JOSHI RABI N. MAHAPATRA Department of Electronics and Electrical Communication Engineering Indian Institute of Technology Kharagpur 721302 India
This letter presents the modelling of a morphological thinning algorithm suggested by Jang and Chin [1] on the four models of shared memory SIMD computers. The time and cost complexity analyses for the models have bee... 详细信息
来源: 评论
FAST parallel algorithm FOR ALL-PAIRS SHORTEST-PATH PROBLEM AND ITS VLSI IMPLEMENTATION
收藏 引用
IEE PROCEEDINGS-E COMPUTERS AND DIGITAL TECHNIQUES 1989年 第2期136卷 85-89页
作者: DEY, S SRIMANI, PK SO ILLINOIS UNIV DEPT COMP SCICARBONDALEIL 62901
We present a new parallel algorithm to solve the all-pairs shortest path problem in a given graph which is considerably faster than the most recently published algorithm [7] for the same problem. Next we propose a sui... 详细信息
来源: 评论
AN EFFICIENT parallel algorithm FOR RANDOM SAMPLING
收藏 引用
INFORMATION PROCESSING LETTERS 1989年 第5期30卷 265-268页
作者: RAJAN, VY GHOSH, RK GUPTA, P Dep. Comp. Sci. and Eng. IIT Kanpur-208016 India
All sequential algorithms for sampling select items one at a time, making updates to a data structure after each selection. None lends itself to a straightforward parallelization. A fast sampling algorithm, SAMPLE, ... 详细信息
来源: 评论
Molecular Dynamics On The Connection Machine Using Fortran
收藏 引用
Molecular Simulation 1991年 第1-2期7卷 1-42页
作者: Boltjes, B. De Leeuw, S.W. Department for Physical Chemistry University of Amsterdam NL-1018 WS Amsterdam Nieuwe Achtergracht 127 Netherlands Material Science Division Argonne National Laboratory Argonne III. 60439 United States
A new algorithm for molecular dynamics on the Connection Machine is presented and compared to an algorithm known from literature. The algorithms have been in implemented in CM Fortran 8x. Their performances, measured ... 详细信息
来源: 评论
SOME OBSERVATIONS ON parallel algorithmS FOR FAST EXPONENTIATION IN GF(2N)
收藏 引用
SIAM JOURNAL ON COMPUTING 1990年 第4期19卷 711-717页
作者: STINSON, DR UNIV MANITOBA DEPT COMP SCI WINNIPEG R3T 2N2 MANITOBA CANADA
A normal basis representation of GF(2n)<span