检索结果-内蒙古大学图书馆

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

496 篇 会议
38 篇 期刊文献

馆藏范围

534 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

400 篇 工学
- 384 篇 计算机科学与技术...
- 262 篇 软件工程
- 44 篇 信息与通信工程
- 33 篇 电气工程
- 25 篇 控制科学与工程
- 11 篇 电子科学与技术（可...
- 9 篇 农业工程
- 4 篇 材料科学与工程（可...
- 4 篇 生物工程
- 3 篇 机械工程
- 3 篇 光学工程
- 2 篇 动力工程及工程热...
- 2 篇 化学工程与技术
- 2 篇 生物医学工程（可授...
- 2 篇 安全科学与工程
- 1 篇 建筑学
- 1 篇 土木工程
267 篇 理学
- 261 篇 数学
- 39 篇 统计学（可授理学、...
- 4 篇 生物学
- 3 篇 物理学
- 3 篇 系统科学
- 2 篇 化学
34 篇 管理学
- 30 篇 管理科学与工程(可...
- 25 篇 工商管理
- 4 篇 图书情报与档案管...
11 篇 农学
- 11 篇 作物学
- 2 篇 农业资源与环境
4 篇 经济学
- 4 篇 应用经济学
1 篇 法学
- 1 篇 社会学

主题

118 篇 parallel process...
103 篇 parallel algorit...
20 篇 parallel program...
15 篇 computer program...
13 篇 scheduling
11 篇 computer archite...
8 篇 approximation al...
7 篇 computer systems...
7 篇 pram
6 篇 parallel process...
6 篇 parallel archite...
6 篇 sorting
5 篇 graph algorithms
5 篇 algorithms
4 篇 performance
4 篇 computational ge...
4 篇 multithreading
4 篇 heterogeneity
4 篇 data structures
4 篇 transactional me...

机构

10 篇 carnegie mellon ...
8 篇 carnegie mellon ...
5 篇 carnegie mellon ...
4 篇 university of ma...
4 篇 univ calif berke...
4 篇 univ of paderbor...
4 篇 carnegie mellon ...
3 篇 uc berkeley unit...
3 篇 paderborn univ p...
3 篇 department of co...
3 篇 university of ma...
3 篇 mit 77 massachus...
3 篇 georgetown unive...
2 篇 duke univ durham...
2 篇 univ calif river...
2 篇 carnegie mellon ...
2 篇 univ of toronto ...
2 篇 univ calif davis...
2 篇 int comp sci ins...
2 篇 heinz nixdorf in...

作者

21 篇 blelloch guy e.
14 篇 gibbons phillip ...
9 篇 goodrich michael...
8 篇 leiserson charle...
8 篇 vishkin uzi
7 篇 tangwongsan kana...
7 篇 fineman jeremy t...
7 篇 reif john h.
6 篇 vitter jeffrey s...
6 篇 gu yan
6 篇 demmel james
5 篇 ballard grey
5 篇 sun yihan
5 篇 bender michael a...
5 篇 schwartz oded
5 篇 muthukrishnan s.
5 篇 simhadri harsha ...
5 篇 miller gary l.
5 篇 matias yossi
4 篇 karp richard m.

语言

519 篇 英文
15 篇 其他

检索条件"任意字段=Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures"

共 534 条记录，以下是521-530 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

The power of parallel pointer manipulation 89

The power of parallel pointer manipulation

引用

1st annual acm symposium on parallel algorithms and architectures, SPAA 1989

作者： Lam, Tak Wah Ruzzo, Walter L. Department of Computer Science University of Hong Kong Pokfulam Road Hong Kong Computer Science Department University of Washington SeattleWA98195 United States

ISBN: (纸本)089791323X

An HMM is a very simple parallel machine consisting of finite state devices that can manipulate pointers to each other. The more commonly studied PRAM is a much richer parallel machine with a shared global memory and arithmetic capabilities. We define a natural restriction of the PRAM that is shown to be equivalent to the HMM to within a constant factor in both time and hardware simultaneously. Basically, the restricted PRAM is a Concurrent Read, Owner Write (CROW) PRAM, stripped of arithmetic capabilities, except for successor (+1) a doubling ( x 2) operations. © 1989 acm.

关键词：

来源：评论

学校读者我要写书评

暂无评论

An efficient parallel algorithm for computing a large independent set in planar graph 89

An efficient parallel algorithm for computing a large indepe...

引用

1st annual acm symposium on parallel algorithms and architectures, SPAA 1989

作者： Chrobek, Maxek Naor, Joseph Department of Mathematics and Computer Science University of California RiversideCA92521 United States Department of Computer Science Stanford University StanfordCA94305-2140 United States

ISBN: (纸本)089791323X

Let (G) denote the independence number of a graph G, that is the maximum number of pairwise independent vertices in G. We present a parallel algorithm that computes in a planar graph G = (V, E), an independent set I ⊂ V such that III > α(G)/2. The algorithm runs in time O(log 2 n) and requires a linear number of processors. This is achieved by defining a set. of reductions that can be executed "locally" and simultaneously;further more, it is shown that a constant fraction of the vertices in the graph are reducible. This is the best known approximation scheme when the number of processors available is linear;parallel implementation of known sequential algorithms requires many more processors. © 1989 acm.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

parallel RAMs with bounded memory wordsize 89

Parallel RAMs with bounded memory wordsize

引用

1st annual acm symposium on parallel algorithms and architectures, SPAA 1989

作者： Bellantoni, Stephen J. Department of Computer Science University of Toronto Canada

ISBN: (纸本)089791323X

The PRAM model of parallel computation is examined with respect to wordsize, the number of bits which can be held in each global memory cell. First, adversary arguments are used to show the incomparability of certain machines which store the same amount of global information but which differ in wordsize. Next, for machines with infinitely many memory cells, a counting argument is used to show a large lower bound and to separate a hierarchy of machine classes based on wordsize. Finally, an efficient simulation by boolean circuits is used to give a simple new proof of the tight ω(log n / log log n ) time bound for PARITY on small-word size machines. Overall the results suggest that, in some circumstances, the memory word size is a more significant resource than the write resolution rule, number of memory cells, or number of processors. © 1989 acm.

关键词： Random access storage

来源：评论

学校读者我要写书评

暂无评论

Conflict-free access of arrays in a parallel processor 89

Conflict-free access of arrays in a parallel processor

引用

1st annual acm symposium on parallel algorithms and architectures, SPAA 1989

作者： Lee, D.-L. Wang, Y.H. Department of Computer Science York University North YorkONM3J1P3 Canada

ISBN: (纸本)089791323X

Let T be a collection of data templates of an N × N matrix, T = {row, column, forward diagonal, backward diagonal}. In the context of parallel processing, the question of whether it is possible or not for a parallel processor with N processing elements, N memory modules, and an interconnection network to allow parallel, conflict-free access to any instance of any data templates in T for N = 2n and any n > 1 has been open for a long time. The problem essentially concerns whether there exists any valid skewing scheme that can be realized in terms of interconnection networks. In this paper we will answer this open question by presenting a valid skewing scheme and a simple interconnection network that efficiently implements the skewing scheme in question. © 1989 acm.

关键词： Interconnection networks (circuit switching)

来源：评论

学校读者我要写书评

暂无评论

On the parallel complexity of integer programming 89

On the parallel complexity of integer programming

引用

1st annual acm symposium on parallel algorithms and architectures, SPAA 1989

作者： Deng, Xiaotie Dept. of Operations Research Stanford University United States Dept. of Computer Science and Engineering UC at San Diego United States

ISBN: (纸本)089791323X

We show that the several problems, whose complexity with respect P and NC was open, are equivalent under NC-reductions. These include: (1) Finding the optimal solution of a two-variable integer program;(2) Determining whether a set of linear inequalities in two dimensions has all integer solution;(3) Finding all intermediate results in the Euclidean algorithm for the greatest common divisor of two integers;(4) Finding integers x and y that minimize mx+ny > 0 (as is well known, the result mx+ny is the greatest common divisor of m and n). We also show that integer programming can be NC-reduced to the basis reduction problem (and tiffs holds in any fixed dimension). Thus, basis reduction is the only step in Lenstra's algorithm that is not easily parallelizable. © 1989 acm.

关键词： Integer programming

来源：评论

学校读者我要写书评

暂无评论

On parallel evaluation of game trees 89

On parallel evaluation of game trees

引用

1st annual acm symposium on parallel algorithms and architectures, SPAA 1989

作者： Karp, Richard M. Zhang, Yanjun Computer Science Division University of California BerkeleyCA94720 United States

ISBN: (纸本)089791323X

We present parallel algorithms for evaluating game trees. These algorithms parallelize the "left-To-right" sequential algorithm for evaluating AND]OR trees and the α-β pruning procedure for evaluating MIN/MAX trees. We show that, on every instance of a uniform tree, these parallel algorithms achieve a linear speed-up over their corresponding sequential algorithms, if the number of processors used is close to the height of the input tree. These are the first non-Trivial deterministic speed-up bounds known for the "left-To-right" algorithm and the α-β pruning procedure. © 1989 acm.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

Optimal VLSI architectures for multidimensional DFT 89

Optimal VLSI architectures for multidimensional DFT

引用

1st annual acm symposium on parallel algorithms and architectures, SPAA 1989

作者： Bilardi, Gianfranco Hornick, Scot W. Sarrafzadeh, Majid Department of Computer Science Cornell University Upson Hall IthacaNY14853 United States Andersen Consulting Center for Strategic Tech. Res. 100 S. Wacker ChicagoIL60606 United States Dept. of Elec. Eng. and Comp. Sci. Technological Institute Northwestern University EvanstonIL60208 United States

ISBN: (纸本)089791323X

A family of VLSI architectures for computing an (n 1 × n 2 × • • " × nd)-point multidimensional D1VF (MDDFT) over Zm, the ring of integers modulo M, is presented. These architectures achieve VLSI area A = 0 ((NZlog2M)/T 2) for any comptitation time T ϵ [ω(logN),O (ωNlogM)], where N = I'Int and it is k=l assumed that logM = O(logN). A lower bound argument is developed to show that the proposed architectures are area-Time optimal. The appficability of these architectures to computation of the MDDFT over the complex field is also discussed. Using fixed-point arithmetic with b bits of precision, their area-Time performance is AT2= O(N2b 2) for any computation time T ϵ [ω(logN),O(√Nb)]. © 1989 acm.

关键词： Fixed point arithmetic

来源：评论

学校读者我要写书评

暂无评论

Locating faults in a constant number of parallel testing rounds 89

Locating faults in a constant number of parallel testing rou...

引用

1st annual acm symposium on parallel algorithms and architectures, SPAA 1989

作者： Beigel, Richard Kosaraju, S. Rao Sullivan, Gregory F. Dept. of Computer Science Johns Hopkins University BaltimoreMD21218 United States

ISBN: (纸本)089791323X

Consider a system of processing elements in which elements may administer tests to other elements. We show, surprisingly, that a constant, number of rounds of parallel testing are sufficient to identify all faults (in all cases where fault identification is possible). We also present an O(loglogn/t t) algorithm with a small constant of proportionality, where n denotes the total number of processors and t denotes the number of faulty processors. Both of these results improve upon the previous best, which was O(log n/t t) rounds. For the problems of identifying a single faulty processor (diagnosis-with-repair) and identifying a single good processor, we present an oblivious constant-Time algorithm using a fixed 3-regular interconnect that tolerates a linear number of faults. This contrasts with the well-known result that every oblivious algorithm for complete diagnosis must use a number of rounds that is linear in t. © 1989 acm.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

Constructing trees in parallel 89

Constructing trees in parallel

引用

1st annual acm symposium on parallel algorithms and architectures, SPAA 1989

作者： Atallah, M.J. Kosaraju, S.R. Larmore, L.L. Miller, G.L. Teng, S.-H. Department of Computer Science Purdue University United States Department of Computer Science Johns Hopkins University United States ICS UC Irvine United States School of Computer Science CMU United States Department of Computer Science USC United States

ISBN: (纸本)089791323X

An O(log 2 n) time, n2/logn processor as well as an O(log n) time, n3/log n processor CREW deterministic parallel algorithms are presented for constructing Huffman codes from a given list of frequences. The time can be reduced to O(log n(loglog n) 2) on an CRCW model, using only n2/(log log n) 2 processors. Also presented is an optimal O(log n) time, O(n/log n) processor EREW parallel algorithm for constructing a tree given a list of leaf depths when the depths are monotonic. An O(log 2 n) time, n processor parallel algorithm is given for the general tree construction problem. We also give an O(log 2 n) time n2/log2n processor algorithm which finds a nearly optimal binary search tree. An O(log 2 n) time n 2 36 processor algorithm for recognizing linear context free languages is given. A crucial ingredient in achieving those bounds is a formulation of these problems as multiplications of special matrices which we call concave matrices. The structure of these matrices makes their parallel multiplication dramatically more efficient than that of arbitrary matrices. © 1989 acm.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

Optimal parallel suffix-prefix matching algorithm and applications 89

Optimal parallel suffix-prefix matching algorithm and applic...

引用

1st annual acm symposium on parallel algorithms and architectures, SPAA 1989

作者： Kedera, Zvi M. Landau, Gad M. Palem, Krishna V. Department of Computer Science Courant Institute of Mathematical Sciences New York University 251 Mercer St. New YorkNY United States Computer Science Division Polytechnic Univ. 333 Jay St. Brooklyn New YorkNY11201 United States IBM Research Division P. O. Box 704 Yorktown HeightsNY10598 United States

ISBN: (纸本)089791323X

Our main result in this paper is a parallel algorithm for suffiz-prefix matching that has optimal speedup on a CRCW PRAM. It runs in time O(logn) using n/log n processors. This algorithm is important because we utihze suffix-prefix matching as a fundamental building block to solve several pattern and string matching problems such as: 1. String Matching, 2. Multi-pattern string matching, 3. Multidimensional Pattern Matching, 4. Pattern Occurrence Detection, 5. Incremental String Matching. © 1989 acm.

关键词： Pattern matching

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共54页 << < 45 46 47 48 49 50 51 52 53 54 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：