咨询与建议

限定检索结果

文献类型

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

馆藏范围

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

日期分布

学科分类号

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

主题

  • 9,175 篇 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 篇 英文
  • 361 篇 其他
  • 60 篇 中文
  • 9 篇 俄文
  • 4 篇 德文
  • 3 篇 西班牙文
  • 2 篇 法文
检索条件"主题词=PARALLEL algorithms"
9175 条 记 录,以下是391-400 订阅
排序:
OPTIMAL parallel algorithms FOR TESTING ISOMORPHISM OF TREES AND OUTERPLANAR GRAPHS  10th
收藏 引用
10TH CONF ON FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE
作者: LEVCOPOULOS, C LINGAS, A PETERSSON, O RYTTER, W Lund University Dept. of Computer Science Box 118 Lund S-221 00 Sweden Warsaw University Institute of Informatics PKiN Warsaw 00-901 Poland
We show that isomorphism of trees and outerplanar graphs can be tested in O(log n) time with n/log(n) processors on a CRCW PRAM and in O(log2n) time with n/log2n processors on an EREW PRAM. This gives the first optima... 详细信息
来源: 评论
Communication-efficient deterministic parallel algorithms for planar point location and 2d Voronoi Diagram
收藏 引用
15th Annual Symposium on Theoretical Aspects of Computer Science (STACS 98)
作者: Diallo, M Ferreira, A Rau-Chaplin, A IFMA LIMOS F-63175 Aubiere France INRIA CNRS Projet SLOOP F-06902 Sophia Antipolis France Dalhousie Univ Fac Comp Sci Halifax NS B3J 2X4 Canada
In this paper we describe deterministic parallel algorithms for planar point location and for building the Voronoi Diagram of n co-planar points. These algorithms are designed for BSP-like models of computation, where... 详细信息
来源: 评论
Work Efficient parallel algorithms for Large Graph Exploration
Work Efficient Parallel Algorithms for Large Graph Explorati...
收藏 引用
20th International Conference on High Performance Computing (HiPC)
作者: Banerjee, Dip Sankar Sharma, Shashank Kothapalli, Kishore Int Inst Informat Technol Hyderabad 500032 Andhra Pradesh India
Graph algorithms play a prominent role in several fields of sciences and engineering. Notable among them are graph traversal, finding the connected components of a graph, and computing shortest paths. There are severa... 详细信息
来源: 评论
Generalized parallel algorithms for BVPs in ODEs
Generalized Parallel Algorithms for BVPs in ODEs
收藏 引用
2nd International Conference on the Applications of Digital Information and Web Technologies
作者: Khalaf, Bashir M. Al-Nema, Mohammed Wajid Univ Mosul Coll Educ Dept Comp Sci Mosul Iraq Univ Mosul Coll Educ Girls Mosul Iraq
The main objective of this paper is the development of a new parallel integration algorithm for Solving Boundary Value Problem (BVPs) in Ordinary Differential Equation, (ODEs). This algorithm is suitable for running o... 详细信息
来源: 评论
Efficient parallel algorithms for constructing a k-tree center and a k-tree core of a tree network
收藏 引用
16th International Symposium on algorithms and Computations (ISAAC 2005)
作者: Wang, Y Wang, DQ Liu, W Tian, BY Dalian Maritime Univ Dalian 116026 Peoples R China
In this paper, we propose two efficient parallel algorithms for constructing a k-tree center and a k-tree core of a tree network, respectively. Both algorithms take O(log n) time using O(n) work on the EREW PRAM. Our ... 详细信息
来源: 评论
Engineering parallel algorithms
Engineering parallel algorithms
收藏 引用
5th IEEE International Symposium on High Performance Distributed Computing
作者: Fang, ND UNIV BASEL DEPT COMP ENGNCH-4056 BASELSWITZERLAND
The rise of explicit parallel programming involves new problems: lack of structure for parallel algorithms and the ad hoc development of parallel algorithms. We use skeletons to characterize and design parallel algori... 详细信息
来源: 评论
EFFICIENT SEQUENTIAL AND parallel algorithms FOR PLANAR MINIMUM COST FLOW  1st
收藏 引用
INTERNATIONAL SYMP ON algorithms ( SIGAL 90 )
作者: IMAI, H IWANO, K Department of Information Science Faculty of Science University of Tokyo Hongo Bunkyo-ku Tokyo 113 Japan IBM Research Tokyo Research Laboratory 5-11 Sanban-cho Chiyoda-ku Tokyo 102 Japan
This paper presents efficient sequential and parallel algorithms for the minimum cost flow problem on planar networks. Our algorithms are based on the interior point method for linear programming, and make full use of... 详细信息
来源: 评论
An evaluation of parallel algorithms on current memory consistency models
An evaluation of parallel algorithms on current memory consi...
收藏 引用
18th IASTED International Conference on parallel and Distributed Computing and Systems
作者: Cong, Guojing IBM Corp Thomas J Watson Res Ctr Yorktown Hts NY 10598 USA
Memory consistency model is crucial to the performance of shared-memory multiprocessors, and in current architectures several different models are adopted. In this paper, using graph algorithms for illustrative purpos... 详细信息
来源: 评论
Efficient parallel algorithms for String Comparison  21
Efficient Parallel Algorithms for String Comparison
收藏 引用
50th International Conference on parallel Processing (ICPP)
作者: Mishin, Nikita Berezun, Daniil Tiskin, Alexander St Petersburg State Univ St Petersburg Russia JetBrains Res Prague Czech Republic
The longest common subsequence (LCS) problem on a pair of strings is a classical problem in string algorithms. Its extension, the semilocal LCS problem, provides a more detailed comparison of the input strings, withou... 详细信息
来源: 评论
Low-constant parallel algorithms for Finite Element Simulations using Linear Octrees  07
Low-constant Parallel Algorithms for Finite Element Simulati...
收藏 引用
ACM/IEEE SC07 Conference
作者: Sundar, Hari Sampath, Rahul S. Adavani, Santi S. Davatzikos, Christos Biros, George Univ Penn Dept Bioengn Philadelphia PA 19104 USA Univ Penn Dept MEAM Philadelphia PA USA Univ Penn Dept Radiol Philadelphia PA USA
In this article we propose parallel algorithms for the construction of conforming finite-element discretization on linear octrees. Existing octree-based discretizations scale to billions of elements, but the complexit... 详细信息
来源: 评论