咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是571-580 订阅
排序:
Communication in parallel algorithms for constraint-based local search
Communication in parallel algorithms for constraint-based lo...
收藏 引用
25th IEEE International parallel and Distributed Processing Symposium, Workshops and Phd Forum, IPDPSW 2011
作者: Caniou, Yves Codognet, Philippe JFLI CNRS NII Tokyo Japan JFLI CNRS / UPMC University of Tokyo Tokyo Japan
We address the issue of parallelizing constraint solvers based on local search methods for massively parallel architectures, involving several thousands of CPUs. We present a family of a constraint-based local search ... 详细信息
来源: 评论
Faster bit-parallel algorithms for unordered pseudo-tree matching and tree homeomorphism
Faster bit-parallel algorithms for unordered pseudo-tree mat...
收藏 引用
作者: Kaneta, Yusaku Arimura, Hiroki Raman, Rajeev Graduate School of Information Science and Technology Hokkaido University N14 W9 Sapporo 060-0814 Japan Department of Computer Science University of Leicester University Road Leicester LE1 7RH United Kingdom
In this paper, we consider the unordered pseudo-tree matching problem, which is a problem of, given two unordered labeled trees P and T, finding all occurrences of P in T via such many-to-one matchings that preserve n... 详细信息
来源: 评论
Recent advancements in parallel algorithms for string matching on computing models - A survey and experimental results
Recent advancements in parallel algorithms for string matchi...
收藏 引用
International Conference on Advanced Computing, Networking and Security, ADCONS 2011
作者: Someswararao, Chinta Raju, K. Butchi Appaji, S.V. Raju, S. Viswanadha Reddy, K.K.V.V.V.S. Department of CSE SRKR Engg. College Bhimavaram AP India Department of CSE GRIET Hyderabad AP India School of IT JNTUH Hyderabad AP India Rayalasheema University AP India
The increase in huge amount of data is seen clearly in present days because of requirement for storing more information. To extract certain data from this large database is a very difficult task, including text proces... 详细信息
来源: 评论
From randomizing polynomials to parallel algorithms  12
From randomizing polynomials to parallel algorithms
收藏 引用
3rd Conference on Innovations in Theoretical Computer Science, ITCS 2012
作者: Ishai, Yuval Kushilevitz, Eyal Paskin-Cherniavsky, Anat Computer Science Technion Haifa Israel
Randomizing polynomials represent a function f(x) by a low-degree randomized mapping p(x, r) over a finite field F such that, for any input x, the output distribution of p(x, r) depends only on the value of f(x). We s... 详细信息
来源: 评论
Programming data parallel algorithms on distributed memory machines using Kali  5
Programming data parallel algorithms on distributed memory m...
收藏 引用
5th ACM International Conference on Supercomputing
作者: Koelbel, Charles Mehrotra, Piyush Center for Research on Parallel Computation Rice University Houston 77251-1892 TX United States ICASE NASA Langley Research Center Hampton 23665 VA United States
Current languages for distributed memory machines tend to directly reflect the underlying hardware and thus provide little support for implementing data parallel algorithms. This paper describes a programming environm... 详细信息
来源: 评论
Improved parallel algorithms for the depth-first search and monotone circuit value problems  87
Improved parallel algorithms for the depth-first search and ...
收藏 引用
15th Annual Conference on Computer Science, CSC 1987
作者: Varman, Peter Doshi, Kshitij Department of Electrical and Computer Engineering Rice University HoustonTX77251-1892 United States
parallel algorithms for ordered depth-first search (ODFS) and the monotone circuit value (MCV) on parallel random access machines (PRAMS) and single bus multiprocessors are presented. While it is known that these prob... 详细信息
来源: 评论
Distributed memory parallel algorithms for minimum spanning trees
Distributed memory parallel algorithms for minimum spanning ...
收藏 引用
2013 World Congress on Engineering, WCE 2013
作者: Lončar, Vladmir Škrbić, Srdjan Balaž, Antun Department of Mathematics and Informatics Faculty of Science University of Novi Sad Serbia University of Belgrade Institue of Physics Serbia
Finding a minimum spanning tree of a graph is a well known problem in graph theory with many practical applications. We study serial variants of Prim's and Kruskal's algorithm and present their parallelization... 详细信息
来源: 评论
Optimal parallel algorithms for the recognition and colouring outerplanar graphs  14th
收藏 引用
14th Symposium on Mathematical Foundations of Computer Science, MFCS 1989
作者: Diks, Krzysztof Hagerup, Torben Rytter, Wojciech Instytut Informatyki Uniwersytet Warszawski PKiN p. 850 Warszawa00-901 Poland Fachbereich Informatik Universität des Saarlandes SaarbrückenD-6600 Germany
We show how to test outerplanarity in time T(n)=O(lognlog n) using n/T(n) processors of CREW PRAM. It is the first optimal parallel algorithm recognizing a nontrivial class of graphs and it is the main result of the p... 详细信息
来源: 评论
Optimal parallel algorithms for expression tree evaluation and list ranking  3rd
收藏 引用
3rd Aegean Workshop on Computing: VLSI algorithms and Architectures, AWOC 1988
作者: Cole, Richard Vishkin, Uzi Courant Institute of Mathematical Sciences New York University United States Sackler Faculty of Exact Sciences Tel Aviv University Israel
Two related results are presented. The first is a simple n/log n processor, O(log n) time parallel algorithm for list ranking. The second is a general parallel algorithmic technique for computations on trees;it yields... 详细信息
来源: 评论
Optimal parallel algorithms for b-matchings in trees  2nd
Optimal parallel algorithms for b-matchings in trees
收藏 引用
2nd International Symposium on Optimal algorithms, 1989
作者: Osiakwan, Constantine N. K. Akl, Selim G. Department of Computing and Information Science Queen’s University KingstonONK7L 3N6 Canada
We present adaptive parallel algorithms for b — matchings in trees. The algorithms are designed using the exclusive-read exclusive-write parallel random-access machine (EREW PRAM) model of parallel computation. For a... 详细信息
来源: 评论