咨询与建议

限定检索结果

文献类型

  • 1,504 篇 会议
  • 105 篇 期刊文献

馆藏范围

  • 1,609 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 1,168 篇 工学
    • 1,111 篇 计算机科学与技术...
    • 557 篇 软件工程
    • 118 篇 电气工程
    • 75 篇 信息与通信工程
    • 46 篇 控制科学与工程
    • 37 篇 电子科学与技术(可...
    • 13 篇 材料科学与工程(可...
    • 13 篇 农业工程
    • 11 篇 机械工程
    • 11 篇 光学工程
    • 8 篇 化学工程与技术
    • 8 篇 生物工程
    • 7 篇 建筑学
    • 7 篇 生物医学工程(可授...
    • 6 篇 动力工程及工程热...
    • 5 篇 土木工程
    • 3 篇 力学(可授工学、理...
  • 579 篇 理学
    • 557 篇 数学
    • 55 篇 统计学(可授理学、...
    • 16 篇 物理学
    • 9 篇 生物学
    • 9 篇 系统科学
    • 8 篇 化学
  • 73 篇 管理学
    • 64 篇 管理科学与工程(可...
    • 40 篇 工商管理
    • 10 篇 图书情报与档案管...
  • 16 篇 农学
    • 16 篇 作物学
  • 6 篇 经济学
    • 6 篇 应用经济学
  • 3 篇 法学
    • 3 篇 社会学
  • 3 篇 教育学
    • 3 篇 教育学
  • 2 篇 医学
  • 1 篇 文学
  • 1 篇 军事学

主题

  • 237 篇 parallel algorit...
  • 173 篇 parallel process...
  • 80 篇 computer archite...
  • 74 篇 parallel process...
  • 57 篇 parallel program...
  • 55 篇 algorithms
  • 47 篇 parallel archite...
  • 41 篇 hardware
  • 30 篇 scheduling
  • 27 篇 computer program...
  • 21 篇 graph algorithms
  • 20 篇 computer systems...
  • 18 篇 approximation al...
  • 18 篇 processor schedu...
  • 18 篇 computational mo...
  • 18 篇 field programmab...
  • 17 篇 parallel computi...
  • 16 篇 computer science
  • 16 篇 performance
  • 16 篇 delay

机构

  • 32 篇 carnegie mellon ...
  • 15 篇 swiss fed inst t...
  • 15 篇 carnegie mellon ...
  • 11 篇 univ maryland de...
  • 11 篇 stanford univ st...
  • 10 篇 univ maryland co...
  • 10 篇 mit 77 massachus...
  • 10 篇 univ calif berke...
  • 8 篇 eth zurich
  • 7 篇 georgetown univ ...
  • 7 篇 mit cambridge ma...
  • 7 篇 univ texas austi...
  • 6 篇 penn state univ ...
  • 6 篇 mit csail cambri...
  • 5 篇 univ calif river...
  • 5 篇 princeton univer...
  • 5 篇 university of ma...
  • 5 篇 microsoft res re...
  • 5 篇 carnegie mellon ...
  • 5 篇 harvard univ cam...

作者

  • 38 篇 blelloch guy e.
  • 20 篇 gu yan
  • 18 篇 gibbons phillip ...
  • 18 篇 shun julian
  • 18 篇 goodrich michael...
  • 16 篇 fineman jeremy t...
  • 15 篇 sun yihan
  • 14 篇 dhulipala laxman
  • 13 篇 vishkin uzi
  • 12 篇 agrawal kunal
  • 11 篇 leiserson charle...
  • 10 篇 ballard grey
  • 10 篇 hoefler torsten
  • 10 篇 anon
  • 10 篇 miller gary l.
  • 10 篇 harris david g.
  • 9 篇 ghaffari mohsen
  • 9 篇 tangwongsan kana...
  • 9 篇 reif john h.
  • 9 篇 demmel james

语言

  • 1,569 篇 英文
  • 40 篇 其他
检索条件"任意字段=Annual ACM Symposium on Parallel Algorithms and Architectures"
1609 条 记 录,以下是1371-1380 订阅
排序:
Balanced routing. Towards the distance bound on grids  91
Balanced routing. Towards the distance bound on grids
收藏 引用
3rd annual acm symposium on parallel algorithms and architectures - SPAA'91
作者: Kunde, M. Institut f. Informatik TU Munich Arcisstr. 21 D-8000 Munich 2 Germany
The problem of packet routing on an r-dimensional mesh-connected array or grid of processors with side-length n is studied. Each processor is able to store rf(n) packets, f(n) 1-1/r. The new class of balanced routing ... 详细信息
来源: 评论
parallel resource allocation algorithms on macro-pipeline architectures  19
Parallel resource allocation algorithms on macro-pipeline ar...
收藏 引用
19th annual Conference on Computer Science, CSC 1991
作者: Mossaad, Karam M. Wu, Chaun-Lin Computer Science Department South West Texas State University at San Marcos United States Electrical and Computer Engineering Department University of Texas at Austin United States
Resource Allocation is one of the interesting problems in a high speed multiprocess/multiresource environment. In this paper, we present two novel parallel resource allocation algorithms using macro-pipeline architect... 详细信息
来源: 评论
parallel algorithms for information dissemination by packets  3
Parallel algorithms for information dissemination by packets
收藏 引用
Proceedings of the Third IEEE symposium on parallel and Distributed Processing
作者: Bagchi, A. Schmeichel, E.F. Hakimi, S.L. Bell Communications Research Department of Mathematics and Computer Science San Jose State University United States Department of Electrical Engineering and Computer Science University of California Davis United States
Each vertex of an undirected graph possesses a piece of information which must be sent to every other vertex. The method of communication is to send bounded size packets of messages from one vertex to another. We desc... 详细信息
来源: 评论
Efficient parallel algorithm for the row minima of a totally monotone matrix
Efficient parallel algorithm for the row minima of a totally...
收藏 引用
Proceedings of the Second annual acm-SIAM symposium on Discrete algorithms
作者: Atallah, Mikhail J. Kosaraju, S. Rao
来源: 评论
A parallel hybrid learning approach to artificial neural nets  3
A parallel hybrid learning approach to artificial neural net...
收藏 引用
3rd IEEE symposium on parallel and Distributed Processing, PDPS 1991
作者: Heistermann, J. Siemens AG Munchen-Perlach Otto-Hahn-Ring 6 Munchen 838000 Germany
The requirements of well chosen applications are of great importance for developing new parallel computer architectures. The algorithms presented are implemented on the EDS (European Declarative System) parallel compu... 详细信息
来源: 评论
A practical hierarchical model of parallel computation  3
A practical hierarchical model of parallel computation
收藏 引用
3rd IEEE symposium on parallel and Distributed Processing, PDPS 1991
作者: Heywood, T. Ranka, S. School of Computer and Information Science Syracuse University SyracuseNY13244 United States
A model of parallel computation is introduced which employs the PRAM as a sub-model, while simultaneously being more reflective of realistic parallel architectures by accounting for and providing abstract control over... 详细信息
来源: 评论
Sublinear-time randomized parallel algorithm for the maximum clique problem in perfect graphs
Sublinear-time randomized parallel algorithm for the maximum...
收藏 引用
Proceedings of the 2nd annual acm-SIAM symposium on Discrete algorithms
作者: Alizadeli, Farid
来源: 评论
ON FINDING MINIMAL 2-CONNECTED SUBGRAPHS  53
ON FINDING MINIMAL 2-CONNECTED SUBGRAPHS
收藏 引用
2ND annual SYMP OF THE ASSOC FOR COMPUTING MACHINERY AND THE SOC FOR INDUSTRIAL AND APPLIED MATHEMATICS : DISCRETE algorithms
作者: KELSEN, P RAMACHANDRAN, V Department of Computer Sciences University of Texas Austin 78712 TX United States
We present efficient parallel algorithms for the problems of finding a minimal 2-edge-connected spanning subgraph of a 2-edge-connected graph and finding a minimal biconnected spanning subgraph of a biconnected graph.... 详细信息
来源: 评论
On the parallel complexity of evaluating game trees
On the parallel complexity of evaluating game trees
收藏 引用
Proceedings of the 2nd annual acm-SIAM symposium on Discrete algorithms
作者: Broder, Andrei Z. Karlin, Anna R. Raghavan, Prabhakar Upfal, Eli
来源: 评论
A lower bound for parallel string matching  91
A lower bound for parallel string matching
收藏 引用
23rd annual acm symposium on Theory of Computing, STOC 1991
作者: Breslauer, Dany Galil, Zvi Columbia University United States Tel-Aviv University Israel
We present an Q(log log rn) lower bound on the number of rounds necessary for finding occurrences of a pattern string P[l. .rn] in a text string T[l .2rn] in lparallel using m comparisons in each round. This is the fi... 详细信息
来源: 评论