咨询与建议

限定检索结果

文献类型

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

馆藏范围

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

日期分布

学科分类号

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

主题

  • 9,174 篇 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 篇 英文
  • 360 篇 其他
  • 60 篇 中文
  • 9 篇 俄文
  • 4 篇 德文
  • 3 篇 西班牙文
  • 2 篇 法文
检索条件"主题词=PARALLEL algorithms"
9174 条 记 录,以下是381-390 订阅
排序:
Fast parallel algorithms for the longest common subsequence problem using an optical bus
Fast parallel algorithms for the longest common subsequence ...
收藏 引用
International Conference on Computational Science and Its Applications (ICCSA 2005)
作者: Xu, XH Chen, L Pan, Y He, P Nanjing Univ Aeronaut & Astronaut Dept Comp Sci & Engn Nanjing 210016 Peoples R China Yangzhou Univ Dept Comp Sci Yangzhou 225009 Peoples R China Nanjing Univ Natl Key Lab Novel Software Tech Nanjing 210093 Peoples R China Georgia State Univ Dept Comp Sci Atlanta GA 30303 USA
A parallel algorithm for the longest common subsequence problem on LARPBS is presented. For two sequences of lengths m and n, the algorithm uses p processors and costs O(mn/p) computation time where 1 <= p <= ma... 详细信息
来源: 评论
Practical parallel algorithms for Near-Optimal Densest Subgraphs on Massive Graphs
Practical Parallel Algorithms for Near-Optimal Densest Subgr...
收藏 引用
Symposium on Algorithm Engineering and Experiments (ALENEX)
作者: Sukprasert, Pattara Liu, Quanquan C. Dhulipala, Laxman Shun, Julian Databricks San Francisco CA 94105 USA Northwestern Univ Evanston IL 60208 USA Univ Calif Berkeley Simons Inst Berkeley CA USA Univ Maryland College Pk MD 20742 USA MIT CSAIL 77 Massachusetts Ave Cambridge MA 02139 USA
The densest subgraph problem has received significant attention, both in theory and in practice, due to its applications in problems such as community detection, social network analysis, and spam detection. Due to the... 详细信息
来源: 评论
GRAPH THEORETICAL METHODS FOR THE DESIGN OF parallel algorithms  8th
收藏 引用
8TH INTERNATIONAL CONF ON FUNDAMENTALS OF COMPUTATION THEORY ( FCT 91 )
作者: REISCHUK, R Technische Hochschule Darmstadt Institut für Theoretische Informatik Darmstadt 6100 Germany
We give an overview on graph decomposition techniques to obtain fast algorithms for optimization problems on graphs. Based on the observation that most algorithmical problems can be solved easily on trees these method... 详细信息
来源: 评论
Sequential and Shared-Memory parallel algorithms for Partitioned Local Depths  22
Sequential and Shared-Memory Parallel Algorithms for Partiti...
收藏 引用
Conference on parallel Processing for Scientific Computing (PP)
作者: Devarakonda, Aditya Ballard, Grey Wake Forest Univ Dept Comp Sci Winston Salem NC 27109 USA
In this work, we design, analyze, and optimize sequential and shared-memory parallel algorithms for partitioned local depths (PaLD). Given a set of data points and pairwise distances, PaLD is a method for identifying ... 详细信息
来源: 评论
Fast parallel algorithms for Submodular p-Superseparable Maximization  21th
Fast Parallel Algorithms for Submodular p-Superseparable Max...
收藏 引用
21st International Workshop on Approximation and Online algorithms (WAOA) part of ALGO Conference
作者: Cervenjak, Philip Gan, Junhao Wirth, Anthony Univ Melbourne Sch Comp & Informat Syst Parkville Vic Australia
Maximizing a non-negative, monontone, submodular function f over n elements under a cardinality constraint k (SMCC) is a well-studied NP-hard problem. It has important applications in, e.g., machine learning and influ... 详细信息
来源: 评论
Synchronous and asynchronous parallel algorithms with overlap for almost linear systems  3rd
收藏 引用
3rd International Conference on Vector And parallel Processing (VECPAR 98)
作者: Arnal, J Migallón, V Penadés, J Univ Alicante Dept Ciencia Computac & Inteligencia Artificial E-03071 Alicante Spain
parallel algorithms for solving almost linear systems are studied. A non-stationary parallel algorithm based on the multi-splitting technique and its extension to an asynchronous model are considered. Convergence prop... 详细信息
来源: 评论
Fine and Coarse-grained parallel algorithms for the 2D Cutting Stock Problem
Fine and Coarse-grained Parallel Algorithms for the 2D Cutti...
收藏 引用
18th Euromicro International Conference on parallel, Distributed and Network-Based Processing (PDP)
作者: de Armas, Jesica Leon, Coromoto Miranda, Gara Univ La Laguna Depo Estadist IO & Comp Avda Astrofis Fco Sanchez S-N Tenerife 38271 Spain
This work analyses two different approaches to parallelise an exact algorithm for the solution of the Constrained Two-Dimensional Cutting Stock Problem. A fine-grained model based on the parallel execution of the gene... 详细信息
来源: 评论
TIME parallel algorithms FOR SOLUTION OF LINEAR PARABOLIC PDES
TIME PARALLEL ALGORITHMS FOR SOLUTION OF LINEAR PARABOLIC PD...
收藏 引用
1993 International Conference on parallel Processing
作者: FIJANY, A JET PROP LAB PASADENACA 91109
In this paper, fast time- A nd space-parallel algorithms for solution of parabolic PDEs are developed. It is shown that the seemingly strictly serial time-stepping procedures for solution of problem can be completely ... 详细信息
来源: 评论
OPTIMAL parallel algorithms FOR TRIANGULATED SIMPLE POLYGONS  92
OPTIMAL PARALLEL ALGORITHMS FOR TRIANGULATED SIMPLE POLYGONS
收藏 引用
8th Annual ACM Symposium on Computational Geometry
作者: HERSHBERGER, J DIGITAL EQUIPMENT CORP SYST RES CTR PALO ALTO CA 94301 USA
We provide optimal parallel solutions to several shortest path and visibility problems set in triangulated simple polygons. Let P be a triangulated simple polygon with n vertices, preprocessed to support shortest path... 详细信息
来源: 评论
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... 详细信息
来源: 评论