咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是401-410 订阅
排序:
Mapping Networks via parallel kth-Hop Traceroute Queries  39
Mapping Networks via Parallel kth-Hop Traceroute Queries
收藏 引用
39th International Symposium on Theoretical Aspects of Computer Science, STACS 2022
作者: Afshar, Ramtin Goodrich, Michael T. Matias, Pedro Osegueda, Martha C. University of California IrvineCA United States
For a source node, v, and target node, w, the traceroute command iteratively issues "kth-hop" queries, for k = 1, 2, . . ., δ(v, w), which return the name of the kth vertex on a shortest path from v to w, w... 详细信息
来源: 评论
parallel Binary Search Tree Construction Inspired by Thread-Level Speculation  23
Parallel Binary Search Tree Construction Inspired by Thread-...
收藏 引用
23rd ACIS International Summer Virtual Conference on Software Engineering, Artificial Intelligence, Networking and parallel/Distributed Computing, SNPD-Summer 2022
作者: Hirata, Hiroaki Nunome, Atsushi Kyoto Institute of Technology Faculty of Information and Human Sciences Kyoto City Japan
Binary search trees (BSTs) are one of the most important data structures in computer science. A parallel construction algorithm of a BST can be easily derived from the sequential algorithm. Since the structure of the ... 详细信息
来源: 评论
parallel Implementation Of Clutter Suppression Of Passive Radar Based On LDLT  5
Parallel Implementation Of Clutter Suppression Of Passive Ra...
收藏 引用
5th IEEE International Conference on Electronic Information and Communication Technology, ICEICT 2022
作者: Dong, Jia Yangjing, Luo Wanyuan, Cai Hai-Tao, Wang School of Information and Communication Guilin University of Electronic Technology Guilin541004 China
With the increasing signal bandwidth of oppor-tunistic radiators, real-time clutter suppression has become a serious challenge for passive radars. To solve the problem, this paper designs an inter-segment parallel alg... 详细信息
来源: 评论
parallel Minimum Cuts in Near-linear Work and Low Depth
收藏 引用
ACM TRANSACTIONS ON parallel COMPUTING 2021年 第2期8卷 1–20页
作者: Geissmann, Barbara Gianinazzi, Lukas Swiss Fed Inst Technol Dept Comp Sci Univ Str 6 CAB Zurich Switzerland
We present the first near-linear work and poly-logarithmic depth algorithm for computing a minimum cut in an undirected graph. Previous parallel algorithms with poly-logarithmic depth required at least quadratic work ... 详细信息
来源: 评论
Large-scale parallel exact diagonalization algorithm of the Hubbard model on Tianhe-2 supercomputer  22
Large-scale parallel exact diagonalization algorithm of the ...
收藏 引用
6th International Conference on High Performance Compilation, Computing and Communications, HP3C 2022
作者: Li, Biao Liu, Jie Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Hunan Changsha China
We propose a parallel exact diagonalization method for solving the large-scale Hubbard model. The core of this algorithm is the parallelization of the Lanczos algorithm, for which we propose a hierarchical communicati... 详细信息
来源: 评论
A multicore-based algorithm for optimal multi-way number partitioning
收藏 引用
International Journal of Information Technology (Singapore) 2023年 第6期15卷 2929-2940页
作者: Abdelsalam, Kamel M. K. Khamis, Soheir M. Bahig, Hatem M. Bahig, Hazem M. Computer Science Division Mathematics Department Faculty of Science Ain Shams University Cairo Egypt Information and Computer Science Department College of Computer Science and Engineering Ha’il University Ha’il Saudi Arabia
The Multi-Way Number Partitioning (MWNP) problem is to divide a multiset of n numbers into k subsets in such a way that the largest subset sum is minimized. MWNP is an NP-hard combinatorial optimization problem which ... 详细信息
来源: 评论
parallel Network Mapping algorithms  21
Parallel Network Mapping Algorithms
收藏 引用
Proceedings of the 33rd ACM Symposium on parallelism in algorithms and Architectures
作者: Ramtin Afshar Michael T. Goodrich Pedro Matias Martha C. Osegueda University of California Irvine Irvine CA USA
Motivated from parallel network mapping, we provide efficient query complexity and round complexity bounds for graph reconstruction using distance queries, including a bound that improves a previous sequential complex... 详细信息
来源: 评论
parallel simulation via SPPARKS of on-lattice kinetic and Metropolis Monte Carlo models for materials processing
收藏 引用
MODELLING AND SIMULATION IN MATERIALS SCIENCE AND ENGINEERING 2023年 第5期31卷 055001-055001页
作者: Mitchell, John A. Abdeljawad, Fadi Battaile, Corbett Garcia-Cardona, Cristina Holm, Elizabeth A. Homer, Eric R. Madison, Jon Rodgers, Theron M. Thompson, Aidan P. Tikare, Veena Webb, Ed Plimpton, Steven J. Sandia Natl Labs Albuquerque NM 87123 USA Clemson Univ Dept Mech Engn Dept Mat Sci & Engn Clemson SC USA Los Alamos Natl Lab Los Alamos NM USA Univ Michigan Ann Arbor MI USA Brigham Young Univ Provo UT USA IAEA Vienna Austria Lehigh Univ Bethlehem PA USA
SPPARKS is an open-source parallel simulation code for developing and running various kinds of on-lattice Monte Carlo models at the atomic or meso scales. It can be used to study the properties of solid-state material... 详细信息
来源: 评论
A parallel Algorithm for Solving Linear Symmetric Transformation Equations  1
收藏 引用
5th International Conference on Innovative Computing, IC 2022
作者: Ma, Xiaoxiao School of Traffic and Transportation Chongqing Vocational College of Transportation Chongqing402247 China
Successive relaxation iterative algorithm (SOR) is a common iterative algorithm for solving linear symmetric transformation equations. When the coefficient matrix is positive, it has faster convergence speed. However,... 详细信息
来源: 评论
Maximum Length-Constrained Flows and Disjoint Paths: Distributed, Deterministic, and Fast  2023
Maximum Length-Constrained Flows and Disjoint Paths: Distrib...
收藏 引用
55th Annual ACM Symposium on Theory of Computing (STOC) part of the ACM Federated Computing Research Conference (FCRC)
作者: Haeupler, Bernhard Hershkowitz, D. Ellis Saranurak, Thatchaphol Swiss Fed Inst Technol Zurich Switzerland Carnegie Mellon Univ Pittsburgh PA 15213 USA Univ Michigan Ann Arbor MI USA
Computing routing schemes that support both high throughput and low latency is one of the core challenges of network optimization. Such routes can be formalized as h-length flows which are defined as flows whose flow ... 详细信息
来源: 评论