咨询与建议

限定检索结果

文献类型

  • 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 订阅
排序:
VDS: A Variant of Δ-stepping Algorithm for parallel SSSP Problem
VDS: A Variant of Δ-stepping Algorithm for Parallel SSSP Pr...
收藏 引用
2022 IEEE International Conference on Data Science and Information System, ICDSIS 2022
作者: Kumar, Praveen Singh, Anil Kumar Mnnit Allahabad Computer Science and Engineering Department Prayagraj India
Δ-stepping is a famous parallel algorithm for the single-source shortest path problem. It requires a tuning parameter (delta) to achieve a good trade-off between parallelism and work efficiency. The performance of Δ... 详细信息
来源: 评论
A parallelized Self-Driving Vehicle Controller Using Unsupervised Machine Learning
收藏 引用
IEEE TRANSACTIONS ON INDUSTRY APPLICATIONS 2022年 第4期58卷 5148-5156页
作者: Abegaz, Brook W. Loyola Univ Dept Engn Chicago IL 60626 USA
In this article, a self-driving vehicle controller that optimizes the path a vehicle follows from its initial position to its destination is presented. The methods include clustering-based k-means, hierarchical, Gauss... 详细信息
来源: 评论
Performance portable Vlasov code with C++ parallel algorithm  5
Performance portable Vlasov code with C++ parallel algorithm
收藏 引用
5th IEEE/ACM International Workshop on Performance, Portability and Productivity in HPC, P3HPC 2022
作者: Asahi, Yuuichi Padioleau, Thomas Latu, Guillaume Bigot, Julien Grandgirard, Virginie Obrejan, Kevin Japan Atomic Energy Agency Ccse Chiba Japan Maison de la Simulation Université Paris-Saclay Uvsq Cnrs Cea Gif-sur-Yvette France Cea DES/IRESNE/DEC St.Paul-lez-Durance France Cea Irfm St.Paul-lez-Durance France
This paper presents the performance portable implementation of a kinetic plasma simulation code with C++ parallel algorithm to run across multiple CPUs and GPUs. Relying on the language standard parallelism stdpar and... 详细信息
来源: 评论
Design of GPU parallel Algorithm for Landscape Index Based on Virtual Reality Technology
Design of GPU Parallel Algorithm for Landscape Index Based o...
收藏 引用
2022 IEEE International Conference on Knowledge Engineering and Communication Systems, ICKES 2022
作者: Fu, Yi Bao, Runbo Shenyang Jianzhu University Shenyang China
With the rapid development of society and the continuous improvement of science and technology, people have higher and higher requirements for the quality of life. At the same time, they have put forward higher, stric... 详细信息
来源: 评论
On Network Reliability Evaluation by Monte Carlo Method Using High-Performance Computing
收藏 引用
LOBACHEVSKII JOURNAL OF MATHEMATICS 2023年 第8期44卷 3122-3129页
作者: Migov, D. A. Weins, D. V. Novosibirsk State Tech Univ Novosibirsk 630073 Russia Russian Acad Sci Inst Computat Math & Math Geophys Siberian Branch Novosibirsk 630090 Russia
The paper considers the NP-hard problem of calculation the reliability of a network, which elements are subject to accidental failures. As network reliability, we mean the probabilistic connectivity of a random graph ... 详细信息
来源: 评论
Scalability analysis of a two level domain decomposition approach in space and time solving data assimilation models
Scalability analysis of a two level domain decomposition app...
收藏 引用
作者: Cacciapuoti, Rosalba D'Amore, Luisa Department of Mathematics and Applications Renato Caccioppoli University of Naples Federico II Naples Italy
We are concerned with the mapping on high performance hybrid architectures of a parallel software implementing a two level overlapping domain decomposition, that is, along space and time directions, of the four dimens... 详细信息
来源: 评论
Fractional Linear Matroid Matching Is in Quasi-NC  32
Fractional Linear Matroid Matching Is in Quasi-NC
收藏 引用
32nd Annual European Symposium on algorithms, ESA 2024
作者: Gurjar, Rohit Oki, Taihei Raj, Roshan Department of Computer Science and Engineering Indian Institute of Technology Bombay Mumbai India Department of Mathematical Informatics Graduate School of Information Science and Technology The University of Tokyo Japan
The matching and linear matroid intersection problems are solvable in quasi-NC, meaning that there exist deterministic algorithms that run in polylogarithmic time and use quasi-polynomially many parallel processors. H... 详细信息
来源: 评论
On the parallel Parameterized Complexity of MaxSAT Variants  25
On the Parallel Parameterized Complexity of MaxSAT Variants
收藏 引用
25th International Conference on Theory and Applications of Satisfiability Testing, SAT 2022
作者: Bannach, Max Skambath, Malte Tantau, Till Institute for Theoretical Computer Science Universität zu Lübeck Germany Department of Computer Science Universität Kiel Germany
In the maximum satisfiability problem (max-sat) we are given a propositional formula in conjunctive normal form and have to find an assignment that satisfies as many clauses as possible. We study the parallel paramete... 详细信息
来源: 评论
parallel Algorithm for Pattern Matching Problems Under Substring Consistent Equivalence Relations  33
Parallel Algorithm for Pattern Matching Problems Under Subst...
收藏 引用
33rd Annual Symposium on Combinatorial Pattern Matching, CPM 2022
作者: Jargalsaikhan, Davaajav Hendrian, Diptarama Yoshinaka, Ryo Shinohara, Ayumi Graduate School of Information Sciences Tohoku University Sendai Japan
Given a text and a pattern over an alphabet, the pattern matching problem searches for all occurrences of the pattern in the text. An equivalence relation ≈ is a substring consistent equivalence relation (SCER), if f... 详细信息
来源: 评论
Brief Announcement: A parallel (?, G)-Stepping Algorithm for the Constrained Shortest Path Problem  34
Brief Announcement: A Parallel (?, G)-Stepping Algorithm for...
收藏 引用
34th ACM Symposium on parallelism in algorithms and Architectures, SPAA 2022
作者: Bahreini, Tayebeh Fisher, Nathan Grosu, Daniel Wayne State University DetroitMI United States
We design a parallel algorithm for the Constrained Shortest Path (CSP) problem. The CSP problem is known to be NP-hard and there exists a pseudo-polynomial time sequential algorithm that solves it. To design the paral... 详细信息
来源: 评论