咨询与建议

限定检索结果

文献类型

  • 1,547 篇 期刊文献
  • 736 篇 会议
  • 13 篇 学位论文
  • 3 册 图书

馆藏范围

  • 2,299 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 1,934 篇 工学
    • 1,499 篇 计算机科学与技术...
    • 536 篇 电气工程
    • 304 篇 软件工程
    • 146 篇 信息与通信工程
    • 111 篇 控制科学与工程
    • 61 篇 机械工程
    • 57 篇 电子科学与技术(可...
    • 53 篇 力学(可授工学、理...
    • 37 篇 航空宇航科学与技...
    • 30 篇 材料科学与工程(可...
    • 28 篇 仪器科学与技术
    • 25 篇 动力工程及工程热...
    • 18 篇 土木工程
    • 15 篇 测绘科学与技术
    • 14 篇 化学工程与技术
    • 14 篇 石油与天然气工程
    • 10 篇 生物医学工程(可授...
    • 10 篇 网络空间安全
  • 707 篇 理学
    • 511 篇 数学
    • 121 篇 物理学
    • 44 篇 化学
    • 29 篇 地球物理学
    • 26 篇 生物学
    • 19 篇 系统科学
    • 18 篇 统计学(可授理学、...
  • 169 篇 管理学
    • 156 篇 管理科学与工程(可...
    • 10 篇 工商管理
    • 10 篇 图书情报与档案管...
  • 32 篇 医学
    • 24 篇 临床医学
  • 9 篇 经济学
    • 8 篇 应用经济学
  • 9 篇 农学
  • 6 篇 法学
  • 4 篇 教育学
  • 2 篇 艺术学

主题

  • 2,299 篇 parallel algorit...
  • 97 篇 gpu
  • 53 篇 cuda
  • 50 篇 domain decomposi...
  • 45 篇 image processing
  • 42 篇 finite element
  • 38 篇 mapreduce
  • 35 篇 mpi
  • 34 篇 parallel algorit...
  • 30 篇 hypercube
  • 27 篇 time complexity
  • 26 篇 optimization
  • 26 篇 navier-stokes eq...
  • 25 篇 sorting
  • 24 篇 data mining
  • 23 篇 openmp
  • 21 篇 graphics process...
  • 20 篇 load balancing
  • 20 篇 parallel computi...
  • 20 篇 selection

机构

  • 21 篇 southwest univ s...
  • 13 篇 natl taiwan univ...
  • 12 篇 guizhou normal u...
  • 10 篇 georgia state un...
  • 8 篇 hunan univ coll ...
  • 7 篇 griffith univ sc...
  • 7 篇 beihang univ sch...
  • 6 篇 virginia tech de...
  • 6 篇 beihang univ sta...
  • 6 篇 suny coll new pa...
  • 6 篇 china univ geosc...
  • 5 篇 nanyang technol ...
  • 5 篇 soochow univ sch...
  • 5 篇 univ chinese aca...
  • 5 篇 iowa state univ ...
  • 5 篇 natl univ def te...
  • 5 篇 guangxi teachers...
  • 5 篇 univ texas dept ...
  • 5 篇 natl taiwan univ...
  • 5 篇 univ naples fede...

作者

  • 32 篇 shang yueqiang
  • 22 篇 horng sj
  • 16 篇 zheng bo
  • 13 篇 li kenli
  • 13 篇 shen h
  • 12 篇 akl sg
  • 12 篇 chung kl
  • 11 篇 bahig hazem m.
  • 10 篇 ito yasuaki
  • 10 篇 pan y
  • 10 篇 liu jie
  • 10 篇 nakano koji
  • 9 篇 mei gang
  • 9 篇 tsai hr
  • 8 篇 shi hc
  • 7 篇 bozejko wojciech
  • 7 篇 kao tw
  • 7 篇 wang wei
  • 7 篇 li keqin
  • 7 篇 zapata el

语言

  • 2,097 篇 英文
  • 169 篇 其他
  • 31 篇 中文
  • 1 篇 法文
  • 1 篇 俄文
检索条件"主题词=parallel Algorithm"
2299 条 记 录,以下是2191-2200 订阅
排序:
A parallel Conjugate Direction Method for Unconstrained Optimization11 This work was supported in part by the National Science Foundation under Gmnt ECS-8717167.
收藏 引用
International Journal of Modelling and Simulation 1990年 第1期10卷 6-12页
作者: Xiyi Miao Peter Luh Shi-Chung Chang Electrical and Systems Engineering Department University of Connecticut Storrs CT 06269-3157 Electrical Engineering Department National Taiwan University TaipeiTaiwan Republic of China
This paper presents a new parallel conjugate direction method for unconstrained, n-dimensional minimization problems. Starting from one point, the method performs n line searches concurrently along n conjugate directi... 详细信息
来源: 评论
parallelIZATION OF A 3-DIMENSIONAL COMPRESSIBLE TRANSITION CODE
收藏 引用
AIAA JOURNAL 1990年 第1期28卷 83-90页
作者: ERLEBACHER, G BOKHARI, SH HUSSAINI, MY UNIV ENGN & TECHNOL LAHOREPAKISTAN
The compressible, three-dimensional, time-dependent Navier-Stokes equations are solved on a 20 processor Flex/32 computer. The code is a parallel implementation of an existing code operational on the Cray-2 at NASA Am... 详细信息
来源: 评论
A SIMPLE parallel algorithm FOR FINDING A SATISFYING TRUTH ASSIGNMENT TO A 2-CNF FORMULA
收藏 引用
INFORMATION PROCESSING LETTERS 1988年 第3期27卷 141-145页
作者: COOK, SA LUBY, M Department of Computer Science University of Toronto Toronto Canada M5S 1A4
A fast parallel algorithm that can be used to find a satisfying truth assignment for a 2-CNF formula is proposed. The input to the algorithm is a formula that is the conjunction of a given number of clauses, each of ... 详细信息
来源: 评论
AN IMPROVED parallel algorithm THAT COMPUTES THE BFS NUMBERING OF A DIRECTED GRAPH
收藏 引用
INFORMATION PROCESSING LETTERS 1988年 第2期28卷 61-65页
作者: GAZIT, H MILLER, GL Dep. Comp. Sci. Univ. Southern California University Park Los Angeles CA 90089-0782 USA
This paper presents a parallel algorithm that computes the breadth-first search (BFS) numbering of a directed graph in O(log super(2)n) time using M(n) processors on the exclusive-read exclusive-write (EREW) parallel ... 详细信息
来源: 评论
A MODIFIED FAST parallel algorithm FOR THINNING DIGITAL PATTERNS
收藏 引用
PATTERN RECOGNITION LETTERS 1988年 第2期7卷 99-106页
作者: CHEN, YS HSU, WH CHINESE ACAD SCI INST INFORMAT SCIBEIJINGPEOPLES R CHINA
A modified version of the fast parallel thinning algorithm proposed by Zhang and Suen is presented in this paper. It preserves the original merits such as the contour noise immunity and good effect in thinning crossin... 详细信息
来源: 评论
A parallel algorithm FOR A CLASS OF CONVEX-PROGRAMS
收藏 引用
SIAM JOURNAL ON CONTROL AND OPTIMIZATION 1988年 第2期26卷 345-355页
作者: HAN, SP LOU, G
A parallel algorithm is proposed in this paper for solving the problem $\min \{ q(x)|x \in C_1 \cap \cdots \cap C_m \} $ where q is an uniformly convex function and $C_i$ are closed convex sets in $R^n$. In each it... 详细信息
来源: 评论
THE AVERAGE PERFORMANCE OF A parallel STABLE MARRIAGE algorithm
收藏 引用
BIT 1989年 第3期29卷 448-456页
作者: TSENG, SS NATL CHIAO TUNG UNIV INST INFORMAT SCIHSINCHU 30050TAIWAN
In this paper, Tseng and Lee's parallel algorithm to solve the stable marriage prolem is analyzed. It is shown that the average number of parallel proposals of the algorithm is of ordern by usingn processors on a ... 详细信息
来源: 评论
parallel FUZZY CLUSTERING ON FIXED SIZE HYPERCUBE SIMD COMPUTERS
收藏 引用
parallel COMPUTING 1989年 第3期11卷 291-303页
作者: ZAPATA, EL RIVERA, FF PLATA, OG ISMAIL, MA UNIV WINDSOR SCH COMP SCIWINDSOR N9B 3P4ONTARIOCANADA
This article presents PFCM, a parallel algorithm for fuzzy clustering of large data sets. Being a generalization of FCM, the algorithm enables arbitrary numbers of data points, features and clusters to be handled cost... 详细信息
来源: 评论
parallel EVALUATION OF THE DETERMINANT AND OF THE INVERSE OF A MATRIX
收藏 引用
INFORMATION PROCESSING LETTERS 1989年 第1期30卷 41-45页
作者: GALIL, Z PAN, V TEL AVIV UNIV IL-69978 TEL AVIVISRAEL CUNY HERBERT H LEHMAN COLL DEPT MATHBRONXNY 10468 SUNY ALBANY DEPT COMP SCIALBANYNY 12203
We decrease (from (n super(2.876)) to o(n super(2.851)) the current record bound on the number of processors required in O(log super(2)n) step parallel arithmetic algorithms over rationals for the exact evaluation of ... 详细信息
来源: 评论
THE parallel COMPLEXITY OF FINDING A BLOCKING FLOW IN A 3-LAYER NETWORK
收藏 引用
INFORMATION PROCESSING LETTERS 1989年 第3期31卷 157-161页
作者: CHERIYAN, J MAHESHWARI, SN INDIAN INST TECHNOL DEPT COMP SCI & ENGNNEW DELHI 16INDIA
The parallel complexity of the blocking flow problem is examined. Shiloach and Vishkin (1982) gave a time parallel algorithm for finding a blocking flow in an acyclic network, thereby giving an algorithm for max-flow... 详细信息
来源: 评论