咨询与建议

限定检索结果

文献类型

  • 5,672 篇 会议
  • 3,455 篇 期刊文献
  • 42 篇 学位论文
  • 4 册 图书
  • 1 篇 资讯

馆藏范围

  • 9,174 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 5,483 篇 工学
    • 4,477 篇 计算机科学与技术...
    • 1,615 篇 软件工程
    • 1,420 篇 电气工程
    • 449 篇 信息与通信工程
    • 296 篇 控制科学与工程
    • 268 篇 电子科学与技术(可...
    • 94 篇 仪器科学与技术
    • 75 篇 机械工程
    • 74 篇 力学(可授工学、理...
    • 63 篇 动力工程及工程热...
    • 63 篇 化学工程与技术
    • 61 篇 生物工程
    • 55 篇 生物医学工程(可授...
    • 51 篇 农业工程
    • 46 篇 材料科学与工程(可...
    • 43 篇 土木工程
    • 40 篇 光学工程
    • 29 篇 建筑学
  • 2,404 篇 理学
    • 1,983 篇 数学
    • 312 篇 物理学
    • 149 篇 统计学(可授理学、...
    • 113 篇 系统科学
    • 97 篇 生物学
    • 89 篇 化学
  • 506 篇 管理学
    • 390 篇 管理科学与工程(可...
    • 123 篇 图书情报与档案管...
    • 76 篇 工商管理
  • 81 篇 医学
    • 58 篇 临床医学
  • 67 篇 农学
    • 62 篇 作物学
  • 34 篇 经济学
    • 32 篇 应用经济学
  • 28 篇 法学
  • 13 篇 文学
  • 7 篇 教育学
  • 5 篇 艺术学
  • 4 篇 军事学

主题

  • 9,174 篇 parallel algorit...
  • 1,158 篇 concurrent compu...
  • 847 篇 algorithm design...
  • 672 篇 parallel process...
  • 616 篇 computer science
  • 460 篇 computational mo...
  • 374 篇 computer archite...
  • 289 篇 phase change ran...
  • 233 篇 application soft...
  • 224 篇 parallel archite...
  • 215 篇 hypercubes
  • 200 篇 very large scale...
  • 198 篇 costs
  • 196 篇 parallel program...
  • 176 篇 sorting
  • 175 篇 scalability
  • 165 篇 hardware
  • 152 篇 data mining
  • 147 篇 routing
  • 144 篇 clustering algor...

机构

  • 26 篇 carnegie mellon ...
  • 19 篇 school of electr...
  • 17 篇 department of co...
  • 17 篇 ibm thomas j. wa...
  • 16 篇 department of co...
  • 15 篇 old dominion uni...
  • 15 篇 hiroshima univ d...
  • 13 篇 purdue univ dept...
  • 13 篇 univ texas dept ...
  • 12 篇 georgia inst tec...
  • 12 篇 univ maryland de...
  • 12 篇 old dominion uni...
  • 12 篇 school of comput...
  • 11 篇 swiss fed inst t...
  • 11 篇 univ maryland co...
  • 11 篇 univ maryland in...
  • 10 篇 georgia inst tec...
  • 10 篇 department of co...
  • 10 篇 department of co...
  • 10 篇 eth zurich

作者

  • 35 篇 shun julian
  • 33 篇 olariu s
  • 30 篇 p. banerjee
  • 30 篇 blelloch guy e.
  • 26 篇 nakano koji
  • 24 篇 bader david a.
  • 18 篇 dhulipala laxman
  • 18 篇 gu yan
  • 17 篇 ito yasuaki
  • 16 篇 schwing jl
  • 15 篇 v. kumar
  • 15 篇 khan maleq
  • 14 篇 sun yihan
  • 14 篇 shi-jinn horng
  • 14 篇 vishkin uzi
  • 13 篇 ballard grey
  • 13 篇 takefuji y
  • 13 篇 banerjee p
  • 13 篇 han yj
  • 12 篇 ramachandran v

语言

  • 8,734 篇 英文
  • 360 篇 其他
  • 60 篇 中文
  • 9 篇 俄文
  • 4 篇 德文
  • 3 篇 西班牙文
  • 2 篇 法文
检索条件"主题词=Parallel algorithms"
9174 条 记 录,以下是461-470 订阅
排序:
Irregular parallel algorithms in Java  13th
收藏 引用
13th International parallel Processing Symposium, IPPS 1999 Held in Conjunction with the 10th Symposium on parallel and Distributed Processing, SPDP 1999
作者: Blount, Brian Chatterjee, Siddhartha Philippsen, Michael The University of North Carolina Chapel HillNC27599-3175 United States The University of Karlsruhe Karlsruhe76128 Germany
The nested data-parallel programming model supports the design and implementation of irregular parallel algorithms. This paper describes work in progress to incorporate nested data parallelism into the object model of... 详细信息
来源: 评论
Efficient parallel algorithms for path problems in directed graphs  89
Efficient parallel algorithms for path problems in directed ...
收藏 引用
1st Annual ACM Symposium on parallel algorithms and Architectures, SPAA 1989
作者: Lucas, Joan M. Sackrowitz, Marian Gunsher Department of Computer Science Rutgers University New BrunswickNJ08903 United States
In this paper we describe a technique for finding efficient parallel algorithms for problems on directed graphs that involve checking the ezistence of certain kinds of paths in the graph. This technique provides effic... 详细信息
来源: 评论
MIMD versus SIMD computation: Experience with non-numeric parallel algorithms  26
MIMD versus SIMD computation: Experience with non-numeric pa...
收藏 引用
26th Hawaii International Conference on System Sciences, HICSS 1993
作者: Breshears, C. Langston, M.A. Department of Computer Science University of Tennessee KnoxvilleTN37996-1301 United States
We focus on differences inherent in the design and implementation of non-numeric parallel algorithms on MIMD and SIMD architectures. We take as our prototypical examples time-space optimal merging and sorting routines... 详细信息
来源: 评论
Some fast parallel algorithms for parentheses matching  3rd
收藏 引用
3rd International Conference on Computing and Information, ICCI 1991
作者: Das, Sajal K. Chen, Calvin C.-Y. Lewis, Gene Prasad, Sushil Center for Research in Parallel and Distributed Computing Department of Computer Science University of North Texas P.O. Box 13886 DentonTX76203-3886 United States Department of Mathematics and Computer Science Georgia State University AtlantaGA30303 United States
The parentheses matching problem is to determine the mate of each parenthesis in a balanced string of n parentheses. In this paper, we present three novel and elegant parallel algorithms for this problem on parallel r... 详细信息
来源: 评论
Efficient parallel algorithms for mining associations  5th
Efficient parallel algorithms for mining associations
收藏 引用
5th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 1999
作者: Joshi, Mahesh V. Han, Eui-Hong Sam Karypis, George Kumar, Vipin Department of Computer Science University of Minnesota MinneapolisMN55455 United States
The problem of mining hidden associations present in the large amounts of data has seen widespread applications in many practical domains such as customer-oriented planning and marketing, telecommunication network mon... 详细信息
来源: 评论
The twin bottleneck effects (parallel algorithms)  26
The twin bottleneck effects (parallel algorithms)
收藏 引用
26th Hawaii International Conference on System Sciences, HICSS 1993
作者: Wikstrom, M.C. Gustafson, J.L. Ames Laboratory ISU 335 Wilhelm AmesIA50011 United States Ames Laboratory ISU 236 Wilhelm AmesIA5011 United States
For a class of parallel algorithms common in scientific applications, the authors have derived equations that determine idle and elapsed execution time, and account for overlap of communication and task execution. An ... 详细信息
来源: 评论
Studying the Structural Features of the Geophysical Potential Fields with the Use of parallel algorithms  17
Studying the Structural Features of the Geophysical Potentia...
收藏 引用
17th Annual Conference of the International Association for Mathematical Geosciences, IAMG 2015
作者: Martyshko, P.S. Fedorova, N.V. Rublev, A.L. Bulashevich Institute of Geophysics Ural Branch Russian Academy of Sciences Russia
The computer technology is used for constructing the maps of the regional and local anomalies the magnetic fields for the Northern Eurasia sector of within an area confined between 48°-72° E and 60°-68&... 详细信息
来源: 评论
Optimal parallel algorithms for string matching  84
Optimal parallel algorithms for string matching
收藏 引用
16th Annual ACM Symposium on Theory of Computing, STOC 1984
作者: Galil, Zvi Tel-Aviv University Columbia University Israel
Let WRAM [PRAM] be a parallel computer with p processors (RAM's) which share a common memory and are allowed simultaneous reads and writes [only simultaneous reads]. The only type of simultaneous writes allowed is... 详细信息
来源: 评论
Self-optimizing parallel algorithms for haplotype reconstruction and their evaluation on the JPT and CHB genotype data
Self-optimizing parallel algorithms for haplotype reconstruc...
收藏 引用
7th IEEE International Conference on Bioinformatics and Bioengineering, BIBE
作者: Trinca, Dragos Rajasekaran, Sanguthevar Department of Computer Science and Engineering University of Connecticut Storrs CT 06269 United States
The haplotype reconstruction problem has received a great deal of attention in the bioinformatics literature. The algorithms proposed thus far for this problem can be grouped into two main categories: statistical and ... 详细信息
来源: 评论
Efficient sublinear time parallel algorithms for dynamic programming and context-free recognition  9th
Efficient sublinear time parallel algorithms for dynamic pro...
收藏 引用
9th Annual Symposium on Theoretical Aspects of Computer Science, STACS 1992
作者: Larmore, Lawrence L. Rytter, Wojciech University of California at Riverside Dept. Of Computer Science Riverside United States Warsaw University Institute of Informatics ul. Banacha 2 Warszawa 5900-913 Poland
We design a sublinear time parallel algorithm for the computation of the general dynamic programming recurrences. Its total work matches the work of the best known sequential algorithm. It is the first optimal subline... 详细信息
来源: 评论