咨询与建议

限定检索结果

文献类型

  • 348 篇 会议
  • 18 篇 期刊文献

馆藏范围

  • 366 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 252 篇 工学
    • 249 篇 计算机科学与技术...
    • 163 篇 软件工程
    • 25 篇 电气工程
    • 23 篇 信息与通信工程
    • 17 篇 控制科学与工程
    • 5 篇 电子科学与技术(可...
    • 4 篇 农业工程
    • 3 篇 生物工程
    • 2 篇 机械工程
    • 2 篇 生物医学工程(可授...
    • 1 篇 材料科学与工程(可...
    • 1 篇 建筑学
    • 1 篇 化学工程与技术
  • 146 篇 理学
    • 143 篇 数学
    • 23 篇 统计学(可授理学、...
    • 3 篇 生物学
    • 3 篇 系统科学
    • 1 篇 化学
  • 13 篇 管理学
    • 10 篇 管理科学与工程(可...
    • 9 篇 工商管理
    • 3 篇 图书情报与档案管...
  • 6 篇 农学
    • 6 篇 作物学
    • 2 篇 农业资源与环境
  • 1 篇 经济学
    • 1 篇 应用经济学

主题

  • 83 篇 parallel algorit...
  • 69 篇 parallel process...
  • 12 篇 parallel program...
  • 11 篇 computer program...
  • 9 篇 scheduling
  • 7 篇 computer archite...
  • 7 篇 pram
  • 6 篇 computer systems...
  • 5 篇 graph algorithms
  • 4 篇 performance
  • 4 篇 parallel archite...
  • 4 篇 multithreading
  • 4 篇 transactional me...
  • 4 篇 work stealing
  • 3 篇 parallel process...
  • 3 篇 parallelism
  • 3 篇 approximation al...
  • 3 篇 cilk
  • 3 篇 sorting
  • 3 篇 chip multiproces...

机构

  • 10 篇 carnegie mellon ...
  • 4 篇 carnegie mellon ...
  • 4 篇 univ of paderbor...
  • 3 篇 department of co...
  • 3 篇 university of ma...
  • 3 篇 mit 77 massachus...
  • 2 篇 duke univ durham...
  • 2 篇 univ calif river...
  • 2 篇 carnegie mellon ...
  • 2 篇 univ of toronto ...
  • 2 篇 dept. of compute...
  • 2 篇 at and t bell la...
  • 2 篇 sandia national ...
  • 2 篇 computer science...
  • 2 篇 univ maryland de...
  • 2 篇 univ of californ...
  • 2 篇 department of ma...
  • 2 篇 digital systems ...
  • 2 篇 t.j. watson rese...
  • 2 篇 max planck inst ...

作者

  • 12 篇 gibbons phillip ...
  • 11 篇 blelloch guy e.
  • 6 篇 reif john h.
  • 6 篇 leiserson charle...
  • 5 篇 matias yossi
  • 4 篇 uzi vishkin
  • 4 篇 ramachandran vij...
  • 4 篇 vitter jeffrey s...
  • 4 篇 muthukrishnan s.
  • 4 篇 goodrich michael...
  • 4 篇 phillip b. gibbo...
  • 3 篇 snir marc
  • 3 篇 cormen thomas h.
  • 3 篇 deng xiaotie
  • 3 篇 tangwongsan kana...
  • 3 篇 sohn andrew
  • 3 篇 leighton tom
  • 3 篇 simhadri harsha ...
  • 3 篇 miller gary l.
  • 3 篇 gu yan

语言

  • 353 篇 英文
  • 13 篇 其他
检索条件"任意字段=Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures"
366 条 记 录,以下是1-10 订阅
排序:
parallel Best Arm Identification in Heterogeneous Environments  24
Parallel Best Arm Identification in Heterogeneous Environmen...
收藏 引用
36th acm symposium on parallelism in algorithms and architectures (SPAA)
作者: Karpov, Nikolai Zhang, Qin Indiana Univ Bloomington IN 47405 USA
In this paper, we study the tradeoffs between the time and the number of communication rounds of the best arm identification problem in the heterogeneous collaborative learning model, where multiple agents interact wi... 详细信息
来源: 评论
Brief Announcement: New Pruning Rules for Optimal Task Scheduling on Identical parallel Machines  24
Brief Announcement: New Pruning Rules for Optimal Task Sched...
收藏 引用
36th acm symposium on parallelism in algorithms and architectures (SPAA)
作者: Akram, Matthew Schreiber, Dominik Karlsruhe Inst Technol Karlsruhe Baden Wurttembe Germany
We address optimal makespan-minimizing identical parallel machine scheduling (P vertical bar vertical bar C-max) by introducing new pruning rules for branch-and-bound (BnB) and integrating them into a prior BnB algori... 详细信息
来源: 评论
parallel Dynamic Maximal Matching  24
Parallel Dynamic Maximal Matching
收藏 引用
36th acm symposium on parallelism in algorithms and architectures (SPAA)
作者: Ghaffari, Mohsen Trygub, Anton MIT 77 Massachusetts Ave Cambridge MA 02139 USA
We present the first (randomized) parallel dynamic algorithm for maximal matching, which can process an arbitrary number of updates simultaneously. Given a batch of edge deletion or insertion updates to the graph, our... 详细信息
来源: 评论
Brief Announcement: PASGAL: parallel And Scalable Graph Algorithm Library  24
Brief Announcement: PASGAL: Parallel And Scalable Graph Algo...
收藏 引用
36th acm symposium on parallelism in algorithms and architectures (SPAA)
作者: Dong, Xiaojun Gu, Yan Sun, Yihan Wang, Letong UC Riverside Riverside CA 92521 USA
We introduce PASGAL (parallel And Scalable Graph Algorithm Library), a parallel graph library that scales to a variety of graph types, many processors, and large graphs. One special focus of PASGAL is the efficiency o... 详细信息
来源: 评论
An Optimal MPC Algorithm for Subunit-Monge Matrix Multiplication, with Applications to LIS  24
An Optimal MPC Algorithm for Subunit-Monge Matrix Multiplica...
收藏 引用
36th acm symposium on parallelism in algorithms and architectures (SPAA)
作者: Koo, Jaehyun MIT 77 Massachusetts Ave Cambridge MA 02139 USA
We present an O(1)-round fully-scalable deterministic massively parallel algorithm for computing the min-plus matrix multiplication of unit-Monge matrices. We use this to derive a O(log n)-round fully-scalable massive... 详细信息
来源: 评论
Brief Announcement: Distributed Unconstrained Local Search for Multilevel Graph Partitioning  24
Brief Announcement: Distributed Unconstrained Local Search f...
收藏 引用
36th acm symposium on parallelism in algorithms and architectures (SPAA)
作者: Sanders, Peter Seemaier, Daniel Karlsruhe Inst Technol Karlsruhe Germany
Partitioning a graph into blocks of roughly equal weight while cutting only few edges is a fundamental problem in computer science with numerous practical applications. While shared-memory parallel partitioners have r... 详细信息
来源: 评论
parallel and (Nearly) Work-Efficient Dynamic Programming  24
Parallel and (Nearly) Work-Efficient Dynamic Programming
收藏 引用
36th acm symposium on parallelism in algorithms and architectures (SPAA)
作者: Ding, Xiangyun Gu, Yan Sun, Yihan Univ Calif Riverside Riverside CA 92521 USA
The idea of dynamic programming (DP), proposed by Bellman in the 1950s, is one of the most important algorithmic techniques. However, in parallel, many fundamental and sequentially simple problems become more challeng... 详细信息
来源: 评论
Deterministic and Low-Span Work-Efficient parallel Batch-Dynamic Trees  24
Deterministic and Low-Span Work-Efficient Parallel Batch-Dyn...
收藏 引用
36th acm symposium on parallelism in algorithms and architectures (SPAA)
作者: Anderson, Daniel Blelloch, Guy E. Carnegie Mellon Univ Pittsburgh PA 15213 USA
Dynamic trees are a well-studied and fundamental building block of dynamic graph algorithms dating back to the seminal work of Sleator and Tarjan [STOC'81, (1981), pp. 114-122]. The problem is to maintain a tree s... 详细信息
来源: 评论
A Framework for parallelizing Approximate Gaussian Elimination  24
A Framework for Parallelizing Approximate Gaussian Eliminati...
收藏 引用
36th acm symposium on parallelism in algorithms and architectures (SPAA)
作者: Baumann, Yves Kyng, Rasmus Swiss Fed Inst Technol Zurich Switzerland
In a breakthrough result, Spielman and Teng (2004) developed a nearly-linear time solver for Laplacian linear equations, i.e. equations where the coefficient matrix is symmetric with non-negative diagonals and zero ro... 详细信息
来源: 评论
Optimal parallel algorithms for Dendrogram Computation and Single-Linkage Clustering  24
Optimal Parallel Algorithms for Dendrogram Computation and S...
收藏 引用
36th acm symposium on parallelism in algorithms and architectures (SPAA)
作者: Dhulipala, Laxman Dong, Xiaojun Gowda, Kishen N. Gu, Yan Univ Maryland College Pk MD 20742 USA Univ Calif Riverside Riverside CA 92521 USA
Computing a Single-Linkage Dendrogram (SLD) is a key step in the classic single-linkage hierarchical clustering algorithm. Given an input edge-weighted tree), the SLD of) is a binary dendrogram that summarizes the n =... 详细信息
来源: 评论