咨询与建议

限定检索结果

文献类型

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

馆藏范围

  • 2,299 篇 电子文献
  • 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,299 篇 parallel algorit...
  • 97 篇 gpu
  • 53 篇 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,097 篇 英文
  • 169 篇 其他
  • 31 篇 中文
  • 1 篇 法文
  • 1 篇 俄文
检索条件"主题词=parallel Algorithm"
2299 条 记 录,以下是2221-2230 订阅
排序:
A parallel algorithm for the Determination of All Cliques of a Symmetric Graph
收藏 引用
IETE Journal of Research 1987年 第1期33卷 12-15页
This paper presents a very simple and efficient method for the determination of all cliques of symmetric graphs based on a divide-and-conquer strategy. The given graph is continually broken up into smaller and smaller... 详细信息
来源: 评论
A FULLY parallel algorithm FOR THE SYMMETRICAL EIGENVALUE PROBLEM
收藏 引用
SIAM JOURNAL ON SCIENTIFIC AND STATISTICAL COMPUTING 1987年 第2期8卷 S139-S154页
作者: DONGARRA, JJ SORENSEN, DC
In this paper we present a parallel algorithm for the symmetric algebraic eigenvalue problem. The algorithm is based upon a divide and conquer scheme suggested by Cuppen for computing the eigensystem of a symmetric tr... 详细信息
来源: 评论
A parallel AND VECTOR VARIANT OF THE CYCLIC REDUCTION algorithm
收藏 引用
SIAM JOURNAL ON SCIENTIFIC AND STATISTICAL COMPUTING 1988年 第4期9卷 761-765页
作者: SWEET, RA NATL CTR ATMOSPHER RES BOULDERCO 80307
The Buneman variant of the block cyclic reduction algorithm begins as a highly parallel algorithm, but collapses with each reduction to a very serial one. Using partial fraction expansions of rational matrix functions... 详细信息
来源: 评论
A parallel INTEGER LINEAR-PROGRAMMING algorithm
收藏 引用
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 1988年 第3期34卷 393-398页
作者: BOEHNING, RL BUTLER, RM GILLETT, BE ARGONNE NATL LAB DIV MATH CSCARGONNEIL 60439 UNIV MISSOURI DEPT COMP SCIROLLAMO 65401
The solution of large scale integer linear programming models is generally dependent, in some way, upon the branch and bound technique, which can be quite time consuming. This paper describes a parallel branch and bou... 详细信息
来源: 评论
ON SAVING SPACE IN parallel COMPUTATION
收藏 引用
INFORMATION PROCESSING LETTERS 1988年 第6期29卷 327-329页
作者: HAGERUP, T Fachbereich Informatik Universität des Saarlandes D-6600 Saarbrücken Fed. Rep. Germany
A CRCW PRAM (concurrent-read concurrent-write parallel random access memory) is a machine that is made up of a finite number of processors operating syncronously on common, shared memory cells. Simultaneous reading a... 详细信息
来源: 评论
parallel MERGE SORT
收藏 引用
SIAM JOURNAL ON COMPUTING 1988年 第4期17卷 770-785页
作者: COLE, R New York Univ NY United States
We give a parallel implementation of merge sort on a CREW PRAM that uses n processors and O(logn)O(log⁡n)O(\log n) time; the constant in the running time
来源: 评论
ON THE BIT COMPLEXITY OF parallel COMPUTATIONS
收藏 引用
INTEGRATION-THE VLSI JOURNAL 1988年 第2期6卷 201-212页
作者: AKL, SG MEIJER, H Department of Computing and Information Science Queen's University Kingston Ontario Canada
The theoretical models of computation commonly used to design and analyze algorithms, whether sequential or parallel, usually assume that the word size is fixed and that the entire word is available at once. The purpo... 详细信息
来源: 评论
parallel TRIANGULATION OF A POLYGON IN 2 CALLS TO THE TRAPEZOIDAL MAP
收藏 引用
algorithmICA 1988年 第2期3卷 279-288页
作者: YAP, CK 1. Courant Institute of Mathematical Sciences New York University 251 Mercer Street 10012 New York NY USA
We give a parallel method for triangulating a simple polygon by two (parallel) calls to the trapezoidal map computation. The method is simpler and more elegant than previous methods. Along the way we obtain an interes... 详细信息
来源: 评论
THE ACCELERATED CENTROID DECOMPOSITION TECHNIQUE FOR OPTIMAL parallel TREE EVALUATION IN LOGARITHMIC TIME
收藏 引用
algorithmICA 1988年 第3期3卷 329-346页
作者: COLE, R VISHKIN, U TEL AVIV UNIV SACKLER FAC EXACT SCIDEPT COMP SCIIL-69978 TEL AVIVISRAEL
A new general parallel algorithmic technique for computations on trees is presented. In particular, it provides the firstn/logn processor,O(logn)-time deterministic EREW PRAM algorithm for expression tree evaluation. ... 详细信息
来源: 评论
THE APPROXIMATE SOLUTION OF THE EUCLIDEAN TRAVELING SALESMAN PROBLEM ON A CRAY X-MP
收藏 引用
parallel COMPUTING 1988年 第1-3期8卷 177-183页
作者: GURKE, R Zentralinstitut für Angewandte Mathematik Kernforschungsanlage Jülich GmbH 5170 Jülich Fed. Rep. Germany
The efficient use of MIMD computers calls for a careful choice of adequate algorithms as for an implementation taking into account the particular architecture. To demonstrate these facts, a parallel algorithm to find ... 详细信息
来源: 评论