咨询与建议

限定检索结果

文献类型

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

馆藏范围

  • 2,297 篇 电子文献
  • 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,297 篇 parallel algorit...
  • 97 篇 gpu
  • 52 篇 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,095 篇 英文
  • 169 篇 其他
  • 31 篇 中文
  • 1 篇 法文
  • 1 篇 俄文
检索条件"主题词=Parallel algorithm"
2297 条 记 录,以下是2101-2110 订阅
排序:
Optimal parallel preprocessing algorithms for testing weak visibility of polygons from segments
收藏 引用
parallel algorithms and Applications 1993年 第2期1卷 83-98页
作者: Hsu, F.R. Chang, R.C. Lee, R.C.T. Institute of Computer Science and Information Engineering National Chiao Tung University Hsinchu 300 Taiwan Department of Computer Science National Tsing Hua University Hsinchu 300 Taiwan
For an n-gon P, we say P is weakly visible from segment s if any point on P is visible from at least one point of the segment. In this paper, we present an optimal preprocessing algorithm which runs in O(log n) time u... 详细信息
来源: 评论
A CONSTANT TIME algorithm FOR REDUNDANCY ELIMINATION IN TASK GRAPHS ON PROCESSOR ARRAYS WITH RECONFIGURABLE BUS SYSTEMS
收藏 引用
parallel Processing Letters 1993年 第2期3卷 171-177页
作者: B. PRADEEP C. SIVA RAM MURTHY Department of Computer Science and Engineering Indian Institute of Technology Madras 600 036 India
The task or precedence graph formalism is a practical tool to study algorithm parallelization. Redundancy in such task graphs gives rise to numerous avoidable inter-task dependencies which invariably complicates the p... 详细信息
来源: 评论
NOVEL PIPELINING AND PROCESSOR ALLOCATION STRATEGY FOR MONOID COMPUTATIONS ON UNSHUFFLE-EXCHANGE NETWORKS
收藏 引用
parallel Processing Letters 1993年 第2期3卷 189-193页
作者: KUO-LIANG CHUNG HSUN-WEN CHANG Department of Information Management National Taiwan Institute of Technology Taipei Taiwan 10672 R.O.C. Department of Computer Seience and Information Engineering National Chiao Tung University Hsinchu Taiwan 30050 R.O.C.
This short paper presents a novel pipelining and processor allocation strategy for monoid computations on an unshuffle-exchange network. In the strategy, the processor utilization is near 1 and the communication is co... 详细信息
来源: 评论
BLOCK SYSTOLIC COMPUTATIONS IN DIGITAL FILTERS
BLOCK SYSTOLIC COMPUTATIONS IN DIGITAL FILTERS
收藏 引用
计算机,通信,控制与电力工程国际会议
作者: C.J.Hwang Depart of CESYuan-Ze Institute of Technology
Many efficient systolic algorithms in block computation of digital filters have been *** highly concurrent structures can be implemented from these block systolic computation *** the performances of these highly concu... 详细信息
来源: 评论
ANO(n)parallel algorithm FOR SOLVING THE TRAFFIC CONTROL PROBLEM ON CROSSBAR SWITCH NETWORKS
收藏 引用
parallel Processing Letters 1991年 第1期1卷 51-58页
作者: K. T. SUN H. C. FU Department of Computer Science and Information Engineering National Chiao-Tung University Hsin Chu Taiwan 300 R.O.C.
In this paper, we propose a parallel algorithm for the traffic control problem (an NP-complete problem) on crossbar switch networks. This problem is to find a set of conflict-free paths such that the maximum number of... 详细信息
来源: 评论
parallel TRANSIENT algorithm WITH MULTISTEP SUBSTRUCTURE COMPUTATION
收藏 引用
AIAA JOURNAL 1991年 第6期29卷 984-991页
作者: BENNIGHOF, JK WU, JY University of Texas at Austin Austin Texas 78712
A parallel algorithm for computing the transient response of structures is presented. The computation is parallelized on the basis of a division of the structure into substructures, with each processor computing the r... 详细信息
来源: 评论
parallel algorithmS FOR TERMINAL-PAIR RELIABILITY
收藏 引用
IEEE TRANSACTIONS ON RELIABILITY 1992年 第2期41卷 201-209页
作者: DEO, N MEDIDI, M University of Central Florida Orlando USA
This paper reports: 1) parallelization of the two best known sequential algorithms (Dotson & Gobein, and Page & Perry PP-F2TDN) for computing the terminal-pair reliability in a network;2) Reduce&Partition ... 详细信息
来源: 评论
OPTIMAL RANDOMIZED parallel algorithmS FOR COMPUTATIONAL GEOMETRY
收藏 引用
algorithmICA 1992年 第1期7卷 91-117页
作者: REIF, JH SEN, S 1. Computer Science Department Duke University 27706 Durham NC USA
We present parallel algorithms for some fundamental problems in computational geometry which have a running time of O(log n) using n processors, with very high probability (approaching 1 as n --> infinity). These i... 详细信息
来源: 评论
A parallel COST-OPTIMAL algorithm TO COMPUTE THE SUPREMUM OF MAX-MIN POWERS
收藏 引用
parallel COMPUTING 1992年 第5期18卷 551-556页
作者: SURAWEERA, F BHATTACHARYA, P UNIV NEBRASKA DEPT COMP SCI & ENGNLINCOLNNE 68588
A parallel cost-optimal algorithm to compute the supremum of max-min powers of any map (graph) is obtained using the EREW SM SIMD computer as the model of computation. The run-time of the algorithm is O(n) using n pro... 详细信息
来源: 评论
A parallel VARIANT OF A HEURISTIC algorithm FOR GRAPH-COLORING
收藏 引用
parallel COMPUTING 1992年 第8期18卷 897-900页
作者: ZEROVNIK, J KAUFMAN, M INST MATEMAT YU-61111 LJUBLJANAYUGOSLAVIA
In the paper [2] a randomized algorithm of Petford and Welsh [1] was parallelized and optimal speedup as well as linear time complexity was reported. Later, an error was found in the simulation program when the experi... 详细信息
来源: 评论