咨询与建议

限定检索结果

文献类型

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

馆藏范围

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

日期分布

学科分类号

  • 5,488 篇 工学
    • 4,483 篇 计算机科学与技术...
    • 1,617 篇 软件工程
    • 1,420 篇 电气工程
    • 453 篇 信息与通信工程
    • 295 篇 控制科学与工程
    • 270 篇 电子科学与技术(可...
    • 94 篇 仪器科学与技术
    • 75 篇 机械工程
    • 74 篇 力学(可授工学、理...
    • 63 篇 动力工程及工程热...
    • 63 篇 化学工程与技术
    • 60 篇 生物工程
    • 55 篇 生物医学工程(可授...
    • 51 篇 农业工程
    • 45 篇 材料科学与工程(可...
    • 43 篇 土木工程
    • 40 篇 光学工程
    • 29 篇 建筑学
  • 2,414 篇 理学
    • 1,991 篇 数学
    • 314 篇 物理学
    • 150 篇 统计学(可授理学、...
    • 113 篇 系统科学
    • 95 篇 生物学
    • 91 篇 化学
  • 514 篇 管理学
    • 397 篇 管理科学与工程(可...
    • 124 篇 图书情报与档案管...
    • 78 篇 工商管理
  • 81 篇 医学
    • 58 篇 临床医学
  • 67 篇 农学
    • 62 篇 作物学
  • 36 篇 经济学
    • 34 篇 应用经济学
  • 28 篇 法学
  • 13 篇 文学
  • 8 篇 教育学
  • 5 篇 艺术学
  • 4 篇 军事学

主题

  • 9,187 篇 parallel algorit...
  • 1,157 篇 concurrent compu...
  • 848 篇 algorithm design...
  • 673 篇 parallel process...
  • 615 篇 computer science
  • 460 篇 computational mo...
  • 375 篇 computer archite...
  • 289 篇 phase change ran...
  • 233 篇 application soft...
  • 224 篇 parallel archite...
  • 215 篇 hypercubes
  • 200 篇 very large scale...
  • 198 篇 costs
  • 196 篇 parallel program...
  • 177 篇 sorting
  • 175 篇 scalability
  • 165 篇 hardware
  • 151 篇 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,747 篇 英文
  • 362 篇 其他
  • 60 篇 中文
  • 9 篇 俄文
  • 4 篇 德文
  • 3 篇 西班牙文
  • 2 篇 法文
检索条件"主题词=parallel algorithms"
9187 条 记 录,以下是281-290 订阅
排序:
A CLASS OF parallel algorithms FOR COMPUTATION OF THE MANIPULATOR INERTIA MATRIX
收藏 引用
IEEE TRANSACTIONS ON ROBOTICS AND AUTOMATION 1989年 第5期5卷 600-615页
作者: FIJANY, A BEJCZY, AK Jet Propulsion Laboratory California Institute of Technology Pasadena CA USA
A class of parallel and parallel/pipeline algorithms for computation of the manipulator inertial matrix is presented. An algorithm based on the composite rigid-body spatial inertia method, which results in less data d... 详细信息
来源: 评论
Designing irregular parallel algorithms with mutual exclusion and lock-free protocols
收藏 引用
JOURNAL OF parallel AND DISTRIBUTED COMPUTING 2006年 第6期66卷 854-866页
作者: Cong, Guojing Bader, David A. Georgia Inst Technol Coll Comp Atlanta GA 30332 USA IBM Corp TJ Watson Res Ctr Yorktown Hts NY USA
Irregular parallel algorithms pose a significant challenge for achieving high performance because of the difficulty predicting memory access patterns or execution paths. Within an irregular application, fine-grained s... 详细信息
来源: 评论
parallel algorithms for maximum matching in interval graphs
Parallel algorithms for maximum matching in interval graphs
收藏 引用
Proceedings of the IEEE 9th International parallel Processing Symposium
作者: Andrews, Marilyn G. Atallah, Mikhail J. Chen, Danny Z. Lee, D.T. AT&T Bell Lab Naperville United States
Given a set of n intervals representing an interval graph, the problem of finding a maximum matching between pairs of disjoint (nonintersecting) intervals has been considered in the sequential model. Here we present p... 详细信息
来源: 评论
Some optimal parallel algorithms on interval and circular-arc graphs
收藏 引用
JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 2005年 第3期21卷 627-642页
作者: Hsu, FR Shan, MK Chao, HS Lee, RCT Feng Chia Univ Dept Informat Engn & Comp Sci Taichung 407 Taiwan Natl Chengchi Univ Dept Comp Sci Taipei 116 Taiwan Natl Chi Nan Univ Synopsys Taiwan Ltd Dept Comp Sci & Informat Engn Nantou 545 Taiwan
In this paper, we consider some shortest path related problems Iron interval and circular-arc graphs. For the all-pair shortest path query problem on interval and circular-arc graphs, instead of using the sophisticate... 详细信息
来源: 评论
Efficient external memory algorithms by simulating coarse-grained parallel algorithms
收藏 引用
ALGORITHMICA 2003年 第2期36卷 97-122页
作者: Dehne, F Dittrich, W Hutchinson, D Carleton Univ Sch Comp Sci Ottawa ON K1S 5B6 Canada Bosch Telecom GMBH Backnang Germany Carleton Univ Dept Syst & Comp Engn Ottawa ON K1S 5B6 Canada
External memory (EM) algorithms are designed for large-scale computational problems in which the size of the internal memory of the computer is only a small fraction of the problem size. Typical EM algorithms are spec... 详细信息
来源: 评论
OPTIMAL parallel algorithms FOR POINT-SET AND POLYGON PROBLEMS
收藏 引用
ALGORITHMICA 1992年 第1期7卷 3-23页
作者: COLE, R GOODRICH, MT JOHNS HOPKINS UNIV DEPT COMP SCIBALTIMOREMD 21218
In this paper we give parallel algorithms for a number of problems defined on point sets and polygons. All our algorithms have optimal T(n) * P(n) products, where T(n) is the time complexity and P(n) is the number of ... 详细信息
来源: 评论
Graph isomorphism and identification matrices: parallel algorithms
收藏 引用
IEEE TRANSACTIONS ON parallel AND DISTRIBUTED SYSTEMS 1996年 第3期7卷 308-319页
作者: Chen, L FRL Los Angeles CA USA
In this paper, we explore some properties of identification matrices and exhibit some uses of identification matrices in studying the graph isomorphism problem, a famous open problem. We show that, given two graphs in... 详细信息
来源: 评论
Sequential and parallel algorithms for global minimizing functions with lipschitzian derivatives
收藏 引用
COMPUTERS & MATHEMATICS WITH APPLICATIONS 1999年 第4-5期37卷 163-179页
作者: Gergel, VP Sergeyev, YD Nizhnii Novgorod State Univ Nizhnii Novgorod Russia Univ Calabria ISI CNR DEIS I-87036 Arcavacata Di Rende Italy
In this paper, sequential and parallel algorithms using derivatives for solving unconstrained one-dimensional global optimization problems are described. Sufficient conditions of convergence to all global minimizers a... 详细信息
来源: 评论
Energy cost evaluation of parallel algorithms for multiprocessor systems
收藏 引用
CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS 2013年 第1期16卷 77-90页
作者: Wang, Zhuowei Xu, Xianbin Xiong, Naixue Yang, Laurence T. Zhao, Wuqing Wuhan Univ Sch Comp Wuhan 430000 Peoples R China Georgia State Univ Dept Comp Sci Atlanta GA 30303 USA St Francis Xavier Univ Dept Comp Sci Antigonish NS B2G 1C0 Canada
With the continuous development of hardware and software, Graphics Processor Units (GPUs) have been used in the general-purpose computation field. They have emerged as a computational accelerator that dramatically red... 详细信息
来源: 评论
Efficient parallel algorithms for computing all pair shortest paths in directed graphs
收藏 引用
ALGORITHMICA 1997年 第4期17卷 399-415页
作者: Han, YJ Pan, VY Reif, JH UNIV KENTUCKY DEPT COMP SCILEXINGTONKY 40506 CUNY HERBERT H LEHMAN COLL DEPT MATH & COMP SCIBRONXNY 10468 DUKE UNIV DEPT COMP SCIDURHAMNC 27706
We present parallel algorithms for computing all pair shortest paths in directed graphs. Our algorithm has time complexity O(f(n)/p + I(n)log n) on the PRAM using p processors, where I(n) is log n on the EREW PRAM, lo... 详细信息
来源: 评论