咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是2151-2160 订阅
排序:
parallel VORONOI DIAGRAM IN L1 (LINFINITY) METRIC ON A MESH-CONNECTED COMPUTER
收藏 引用
parallel COMPUTING 1991年 第2-3期17卷 241-252页
作者: JEONG, CS Department of Computer Science Pohang Institute of Science and Technology P.O. BOX 125 Pohang Kyungbuk 680 Korea
In this paper, we consider the problem of constructing a Voronoi diagram in L1(L-infinity) metric for a set of n points in the Cartesian plane on a mesh-connected computer. An O(square-root n) parellel algorithm on a ... 详细信息
来源: 评论
parallel SORTING ON CAYLE GRAPHS
收藏 引用
algorithmICA 1991年 第4期6卷 554-564页
作者: GORDON, DM 1. Department of Computer Science University of Georgia 30602 Athens GA USA
This paper presents a parallel algorithm for sorting on any graph with a Hamiltonian path and 1-factorization. For an n-cube the algorithm is equivalent to the sequential balanced sorting network of Dowd, Perl, Rudolp... 详细信息
来源: 评论
parallel PERMUTATION GENERATION ON LINEAR-ARRAY
收藏 引用
INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS 1991年 第3-4期38卷 113-121页
作者: LIN, CJ Department of Applied Mathematics National Chiao Tung University Hsinchu Taiwan
Givennitems, a parallel algorithm for generating all then! permutations is presented. The computational model used is a linear array which consists ofnidentical processing elements with a simple structure. One permuta... 详细信息
来源: 评论
UNIFORM APPROACH FOR SOLVING SOME CLASSICAL PROBLEMS ON A LINEAR-ARRAY
收藏 引用
IEEE TRANSACTIONS ON parallel AND DISTRIBUTED SYSTEMS 1991年 第2期2卷 236-241页
作者: OHALLARON, DR School of Computer Science Carnegie Mellon University Pittsburgh PA USA
We show that the same basic recurrence can be used to solve a number of classical problems from linear algebra and graph theory, including instances of the algebraic path problem, matrix multiplication, matrix triangu... 详细信息
来源: 评论
NEAREST NEIGHBOR CLASSIFICATION ON 2 TYPES OF SIMD-MACHINES
收藏 引用
parallel COMPUTING 1991年 第4-5期17卷 381-407页
作者: LI, XB Department of Computing Science University of Alberta Edmonton Alberta T6G 2H1 Canada
The nearest neighbor (NN) classification schemes have been popular in pattern recognition because of their efficiency and simplicity. The computation of distances of a testing pattern to the training patterns is very ... 详细信息
来源: 评论
FAST ORDER-RECURSIVE GENERALIZED HERMITIAN TOEPLITZ EIGENSPACE DECOMPOSITION
收藏 引用
MATHEMATICS OF CONTROL SIGNALS AND SYSTEMS 1991年 第1期4卷 99-117页
作者: FARGUES, MP BEEX, AAL VIRGINIA POLYTECH INST & STATE UNIV BRADLEY DEPT ELECT ENGNBLACKSBURGVA 24061 USN ELECT & COMP ENGN POSTGRAD SCHMONTEREYCA 93940
We present a parallel algorithm which computes recursively, in increasing order, the complete generalized eigendecompositions of the successive subpencils contained in a maximum size Hermitian Toeplitz generalized eig... 详细信息
来源: 评论
VARIABLE-RESOLUTION CHARACTER THINNING
收藏 引用
PATTERN RECOGNITION LETTERS 1991年 第4期12卷 241-248页
作者: LI, XO BASU, A Alberta Center for Machine Intelligence and Robotics Department of Computing Sciences University of Alberta Edmonton Alberta Canada T6G 2H1
Most current thinning algorithms use only small windows (templates) due to the heavy computation load associated with large template size. However, the lack of global information leads to severe shape distortion and m... 详细信息
来源: 评论
A SYSTOLIC SIMPLEX algorithm
收藏 引用
INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS 1991年 第1-2期38卷 1-30页
作者: EVANS, DJ MEGSON, GM UNIV NEWCASTLE UPON TYNE NEWCASTLE TYNE NE1 7RUTYNE & WEARENGLAND
In this paper a systolic algorithm is presented for the Simplex algorithm as used in Linear Programming applications. In addition, to reduce computer storage requirements, a revised form of the algorithm is considered... 详细信息
来源: 评论
COMPUTING TRANSITIVE CLOSURE ON SYSTOLIC ARRAYS OF FIXED SIZE
收藏 引用
DISTRIBUTED COMPUTING 1991年 第3期5卷 133-144页
作者: LISPER, B ROYAL INST TECHNOL S-10044 STOCKHOLM 70SWEDEN
Forming the transitive closure of a binary relation (or directed graph) is an important part of many algorithms. When the relation is represented by a bit matrix, the transitive closure can be efficiently computed in ... 详细信息
来源: 评论
NC algorithmS FOR RECOGNIZING PARTIAL 2-TREES AND 3-TREES
收藏 引用
SIAM JOURNAL ON DISCRETE MATHEMATICS 1991年 第3期4卷 342-354页
作者: GRANOT, D SKORINKAPOV, D SUNY STONY BROOK WA HARRIMAN SCH MANAGEMENT & POLICYSTONY BROOKNY 11794
The existence of a k-separator in a partial k-tree graph is proved and a linear time algorithm is constructed that finds such a separator in k-trees. This algorithm can be used to obtain a balanced binary decompositio... 详细信息
来源: 评论