咨询与建议

限定检索结果

文献类型

  • 1,554 篇 期刊文献
  • 737 篇 会议
  • 10 篇 学位论文
  • 3 册 图书

馆藏范围

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

日期分布

学科分类号

  • 1,949 篇 工学
    • 1,516 篇 计算机科学与技术...
    • 535 篇 电气工程
    • 305 篇 软件工程
    • 148 篇 信息与通信工程
    • 113 篇 控制科学与工程
    • 60 篇 机械工程
    • 55 篇 电子科学与技术(可...
    • 53 篇 力学(可授工学、理...
    • 37 篇 航空宇航科学与技...
    • 32 篇 材料科学与工程(可...
    • 28 篇 仪器科学与技术
    • 25 篇 动力工程及工程热...
    • 19 篇 土木工程
    • 15 篇 测绘科学与技术
    • 14 篇 化学工程与技术
    • 14 篇 石油与天然气工程
    • 12 篇 网络空间安全
    • 10 篇 生物医学工程(可授...
    • 8 篇 交通运输工程
  • 715 篇 理学
    • 514 篇 数学
    • 126 篇 物理学
    • 44 篇 化学
    • 29 篇 地球物理学
    • 26 篇 生物学
    • 22 篇 统计学(可授理学、...
    • 19 篇 系统科学
  • 168 篇 管理学
    • 159 篇 管理科学与工程(可...
    • 9 篇 图书情报与档案管...
  • 32 篇 医学
    • 24 篇 临床医学
  • 9 篇 经济学
    • 8 篇 应用经济学
  • 9 篇 农学
  • 6 篇 法学
  • 4 篇 教育学
  • 2 篇 艺术学

主题

  • 2,304 篇 parallel algorit...
  • 97 篇 gpu
  • 52 篇 cuda
  • 50 篇 domain decomposi...
  • 45 篇 image processing
  • 42 篇 finite element
  • 38 篇 mapreduce
  • 35 篇 parallel algorit...
  • 35 篇 mpi
  • 30 篇 hypercube
  • 27 篇 time complexity
  • 26 篇 optimization
  • 26 篇 navier-stokes eq...
  • 25 篇 sorting
  • 23 篇 openmp
  • 22 篇 data mining
  • 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 篇 univ chinese aca...
  • 6 篇 beihang univ sta...
  • 6 篇 suny coll new pa...
  • 6 篇 china univ geosc...
  • 5 篇 nanyang technol ...
  • 5 篇 soochow univ sch...
  • 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,151 篇 英文
  • 117 篇 其他
  • 28 篇 中文
  • 3 篇 德文
  • 1 篇 俄文
检索条件"主题词=Parallel algorithm"
2304 条 记 录,以下是1871-1880 订阅
An optimal parallel algorithm to color an interval graph
收藏 引用
parallel Processing Letters 1996年 第4期6卷 439-449页
作者: Pal, Madhumangal Department of Mathematics Indian Institute of Technology Kharagpur - 721 302 India
An optimal parallel algorithm is presented for coloring an interval graph using minimum number of colors. The proposed parallel algorithm takes O(Jp + log n) time with P processors on an EREW PRAM. © World Scient... 详细信息
来源: 评论
Optimal algorithms for interval graphs
收藏 引用
JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 1998年 第2期14卷 449-459页
作者: Wang, YL Chiang, KC Yu, MS Natl Taiwan Univ Sci & Technol Dept Informat Management Taipei 107 Taiwan Natl Chung Hsing Univ Dept Appl Math Taichung 402 Taiwan
In this paper, simple optimal algorithms are presented for solving some problems related to interval graphs. These problems are the connected component problem, the spanning tree problem, the eccentricity problem, and... 详细信息
来源: 评论
FAST NEAREST NEIGHBOR algorithmS ON A LINEAR ARRAY WITH A RECONFIGURABLE PIPELINED BUS SYSTEM
收藏 引用
parallel algorithms and Applications. 1998年 第1期13卷 1-25页
作者: YI PAN KEQIN LI SI-QING ZHENG [a] Department of Computer Science University of Dayton Dayton OH USA [b] Department of Mathematics and Computer Science State University of New York New Paltz NY USA [c] Department of Computer Science Louisiana State University Baton Rouge LA USA
We present efficient algorithms for the nearest neighbor problem defined in an n × n binary image. We show that using a linear array with a reconfigurable pipelined bus system (LARPBS) of n2processors, the ne... 详细信息
来源: 评论
PROCESSOR LOWER BOUND FORMULAS FOR ARRAY COMPUTATIONS AND PARAMETRIC DIOPHANTINE SYSTEMS
收藏 引用
International Journal of Foundations of Computer Science 1998年 第4期09卷 351-375页
作者: PETER CAPPELLO ÖMER EĞECIOĞLU Department of Computer Science University of California at Santa Barbara Santa Barbara CA 93106 USA
Using a directed acyclic graph (dag) model of algorithms, we solve a problem related to precedence-constrained multiprocessor schedules for array computations: Given a sequence of dags and linear schedules parametrize... 详细信息
来源: 评论
Advanced Methods for Evolutionary Optimisation
收藏 引用
IFAC Proceedings Volumes 1998年 第20期31卷 1121-1128页
作者: P. Adamidis S. Kazarlis V. Petridis Automation and Robotics Lab. Dept. of Electrical & Computer Eng. Aristotle University of Thessaloniki Greece
In this paper we present two advanced methods for evolutionary optimisation. One method is based on parallel Genetic algorithms. It is called Cooperating Populations with Different Evolution Behaviours (CoPDEB), and a... 详细信息
来源: 评论
OPTIMAL MESH algorithmS FOR PROXIMITY AND VISIBILITY PROBLEMS IN SIMPLE POLYGONS*
收藏 引用
parallel algorithms and Applications. 1998年 第2期13卷 167-185页
作者: SUMANTA GUHA [a] Department of Electrical Engineering and Computer Science University of Wisconsin-Milwaukee Milwaukee Wl USA
We present optimal parallel algorithms that run in time on mesh-connected computer for a number of fundamental problems concerning proximity and visibility in a simple polygon. These include computing shortest paths, ... 详细信息
来源: 评论
Mapping Complete Binary Tree Structures into a Faulty Supercube with Unbounded Expansion
收藏 引用
Informatica (Ljubljana) 1998年 第4期22卷 491-498页
作者: Keh, Haun-Chao Lin, Jen-Chih Dept. of Comp. Sci. and Info. Eng. Tamkang University Tamsui Taipei 251 Taiwan
We consider a new supercube architecture, a new interconnection network derived from the hypercube. The supcrcube retains the connectivity and diameter properties of the corresponding hypercube. The embedding of one i... 详细信息
来源: 评论
Efficient selection algorithms on distributed memory computers  98
Efficient selection algorithms on distributed memory compute...
收藏 引用
Proceedings of the 1998 ACM/IEEE conference on Supercomputing
作者: E. L. G. Saukas S. W. Song University of São Paulo São Paulo SP 05508-900 Brazil
Consider the selection problem of determining the k th smallest element of a sequence of n elements. Under the CGM (Coarse Grained Multicomputer) model with p processors and O(n/p) local memory, we present a determini... 详细信息
来源: 评论
parallel algorithms for the domination problems in trapezoid graphs
收藏 引用
DISCRETE APPLIED MATHEMATICS 1997年 第3期74卷 241-249页
作者: Liang, YD Department of Computer Science Indiana Purdue University at Fort Wayne Fort Wayne IN 46805 USA
Trapezoid graphs are a superclass of permutation graphs and interval graphs. This paper presents first parallel algorithms for the independent domination, total domination, connected domination and domination problems... 详细信息
来源: 评论
Lock Bypassing: An Efficient algorithm For Concurrently Accessing Priority Heaps
收藏 引用
ACM Journal of Experimental algorithmics 1998年 3卷 3-3页
作者: Yan, Yong Zhang, Xiaodong HAL Computer Systems Inc. Campbell California 95008 United States Department of Computer Science College of William & Mary Williamsburg Virginia 23187-8795 P. O. Box 8795 United States
The heap representation of priority queues is one of the most widely used data structures in the design of parallel algorithms. Efficiently exploiting the parallelism of a priority heap has significant influence on th... 详细信息
来源: 评论