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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

363 篇 会议
18 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

259 篇 工学
- 255 篇 计算机科学与技术...
- 173 篇 软件工程
- 25 篇 电气工程
- 23 篇 信息与通信工程
- 18 篇 控制科学与工程
- 5 篇 电子科学与技术（可...
- 4 篇 农业工程
- 3 篇 生物工程
- 2 篇 机械工程
- 2 篇 生物医学工程（可授...
- 1 篇 材料科学与工程（可...
- 1 篇 建筑学
- 1 篇 化学工程与技术
156 篇 理学
- 153 篇 数学
- 25 篇 统计学（可授理学、...
- 3 篇 生物学
- 3 篇 系统科学
- 1 篇 化学
13 篇 管理学
- 10 篇 管理科学与工程(可...
- 9 篇 工商管理
- 3 篇 图书情报与档案管...
6 篇 农学
- 6 篇 作物学
- 2 篇 农业资源与环境
1 篇 经济学
- 1 篇 应用经济学

主题

83 篇 parallel algorit...
69 篇 parallel process...
12 篇 parallel program...
11 篇 computer program...
9 篇 scheduling
8 篇 algorithms
7 篇 computer archite...
7 篇 pram
6 篇 computer systems...
5 篇 graph algorithms
4 篇 performance
4 篇 parallel archite...
4 篇 multithreading
4 篇 transactional me...
4 篇 work stealing
3 篇 parallel process...
3 篇 parallelism
3 篇 approximation al...
3 篇 cilk
3 篇 sorting

机构

10 篇 carnegie mellon ...
4 篇 carnegie mellon ...
4 篇 univ of paderbor...
3 篇 department of co...
3 篇 university of ma...
3 篇 mit 77 massachus...
2 篇 duke univ durham...
2 篇 univ calif river...
2 篇 carnegie mellon ...
2 篇 univ of toronto ...
2 篇 ibm research div...
2 篇 dept. of compute...
2 篇 at and t bell la...
2 篇 sandia national ...
2 篇 computer science...
2 篇 univ of californ...
2 篇 department of ma...
2 篇 digital systems ...
2 篇 t.j. watson rese...
2 篇 max planck inst ...

作者

13 篇 gibbons phillip ...
11 篇 blelloch guy e.
7 篇 matias yossi
6 篇 uzi vishkin
6 篇 ramachandran vij...
6 篇 reif john h.
6 篇 leiserson charle...
5 篇 goodrich michael...
5 篇 phillip b. gibbo...
4 篇 vijaya ramachand...
4 篇 vitter jeffrey s...
4 篇 muthukrishnan s.
4 篇 yossi matias
4 篇 vishkin uzi
3 篇 snir marc
3 篇 cormen thomas h.
3 篇 deng xiaotie
3 篇 tangwongsan kana...
3 篇 sohn andrew
3 篇 leighton tom

语言

368 篇 英文
13 篇 其他

检索条件"任意字段=Proceedings of the fifth annual ACM symposium on Parallel Algorithms and Architectures"

共 381 条记录，以下是331-340 订阅

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

详细简洁

排序：

parallel construction of trees with optimal weighted path length 91

Parallel construction of trees with optimal weighted path le...

引用

3rd annual acm symposium on parallel algorithms and architectures, SPAA 1991

作者： Larmore, Lawrence L. Przytycka, Teresa M. Department of Computer Science University of California RiversideCA92521 United States Instytut Informatyki Uniwersytet Warszawski United States

ISBN: (纸本)0897914384

This paper deals with the problem of parallel construction of trees with optimal weighted path length. We study both the unordered case, known as the Huffman coding problem and the ordered case known as the optimal alphabetic binary tree problem. The methods used in both cases are different. We reduce the Huffman coding problem to the Concave Least Weight Subsequence and give a parallel algorithm that solves the latter problem in O(√n log n) time with n processors on a CREW PRAM. This leads to the first sublinear time o(n2)-total work parallel algorithm for the Huffman coding problem. The alphabetic binary tree problem is a special case of the Optimum Binary Search Tree problem and can be solved in O(log2 n) time with n4 processors using the dynamic programming technique. We show that an optimal height restricted alphabetic tree can be constructed in O(L log n) time on a CREW PRAM using only linearly many processors, where L is an upper bound on the height of the tree. © 1991 acm.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

Fast and reliable parallel hashing 91

Fast and reliable parallel hashing

引用

3rd annual acm symposium on parallel algorithms and architectures - SPAA'91

作者： Bast, H. Saarlands, U. Hagerup, T. Fachbereich Informatik Universität des Saarlandes W-6600 Saarbrücken Germany Max-Planck-Institut für Informatik W-6600 Saarbrücken Germany

ISBN: (纸本)0897914384

A perfect hash function for a (multi)set X of n integers is an infective function h : X → {1,., s}, where s = O(n), that can be stored in O(n) space and evaluated in constant time by a single processor. We show that a perfect hash function for a given multiset of n integers can be constructed optimally in O(log∗n) time using O(n/log∗n) processors. Our algorithm is faster than all previously published methods. More significantly, it is highly reliable: Whereas analyses of previous fast parallel hashing schemes provided bounds on the expected resource requirements only, our algorithm is guaranteed to stay within the bounds given with overwhelming probability. © 1991 acm.

关键词： Hash functions

来源：评论

学校读者我要写书评

暂无评论

More time-work tradeoffs for parallel graph algorithms 91

More time-work tradeoffs for parallel graph algorithms

引用

3rd annual acm symposium on parallel algorithms and architectures, SPAA 1991

作者： Spencer, Thomas H. Computer Science Department Rensselaer Polytechnic Institute United States

ISBN: (纸本)0897914384

Some parallel algorithms have the property that, as they are allowed to take more time, the total work that they do is reduced. This paper describes three such algorithms that find the strongly connected components of a directed graph. Two of these algorithms are Las Vegas algorithms that run in Õ(t) time and do Õ(n3/t2 + m) and Õ(mn/t + n3/t3) work, respectively. The third is a Monte Carlo algorithm that also runs in O(t) time, but does O (mn + n3/t5) work. The Õ notation means to ignore logarithmic factors. It is also possible to solve the single source shortest path problem with edge lengths between 1 and L in O((n/ρ) log n log(ρL)) time while doing O(nρ 2 log ρ log(ρL)) + Õ(m + n log L) work. Finally, the problem of finding an ear decomposition of a strongly connected directed graph can be reduced to the problem of finding a spanning tree with a. specified root. © 1991 acm.

关键词： Directed graphs

来源：评论

学校读者我要写书评

暂无评论

Processor efficient parallel solution of linear systems over an abstract field 91

Processor efficient parallel solution of linear systems over...

引用

3rd annual acm symposium on parallel algorithms and architectures - SPAA'91

作者： Kaltofen, E. Pan, V. Department of Computer Science Rensselaer Polytechnic Institute Troy New York and Department of Computer Science University of Toronto Toronto Canada M5S 1A4 Department of Mathematics and Computer Science Lehman College City University of New York Bronx New York

parallel randomized algorithms are presented that solve n-dimensional systems of linear equations and compute inverses of n × n non-singular matrices over a field in O((log n)2) time, where each time unit represe... 详细信息

ISBN: (纸本)0897914384

parallel randomized algorithms are presented that solve n-dimensional systems of linear equations and compute inverses of n × n non-singular matrices over a field in O((log n)²) time, where each time unit represents an arithmetic operation in the field generated by the matrix entries. The algorithms utilize within a O(log n) factor as many processors as are needed to multiply two n × n matrices. The algorithms avoid zero divisions with controllably high probability provided the O(n) random elements used are selected uniformly from a sufficiently large set. For fields of small positive characteristic, the processor count measures of our solutions are somewhat higher. © 1991 acm.

关键词： Matrix algebra

来源：评论

学校读者我要写书评

暂无评论

parallel algorithms for routing in non-blocking networks 91

Parallel algorithms for routing in non-blocking networks

引用

3rd annual acm symposium on parallel algorithms and architectures, SPAA 1991

作者： Lin, Geng Pippenger, Nicholas Department of Computer Science University of British Columbia VancouverBCV6T 1W5 Canada

ISBN: (纸本)0897914384

Non-blocking networks have many applications in communications. Typical examples are telephone switching networks and communication networks among processors or between processors and memory devices. We construct non-blocking networks that are efficient not only as regards their cost and delay, but also as regards the time and space required to control them. In this paper, we present the first simultaneous "weakly optimal" solutions for the explicit construction of non-blocking networks, the design of algorithms and the design of data-structures. "Weakly optimal" is in the sense that all measures of complexity (size and depth of the network, time for the algorithm, and space for the data-structure) are within one or more factors of logn of their smallest possible values. In fact, we explicitly construct a scheme in which networks with n inputs and n outputs have size O(n(logn)2) and depth O(logn). And we present deterministic and randomized on-line parallel algorithms to establish and abolish routes dynamically in these networks. The deterministic algorithm uses O((logn) 5) steps to process any number of transactions in parallel (with one processor per transaction), maintaining a data structure that use O(n(logn) 2) words and the randomized algorithm uses O((logn) 2) expected steps to process any number of transactions in parallel (with one processor per transaction), maintaining a data structure that use O(n(logn) 2) words. © 1991 acm.

关键词： Data structures

来源：评论

学校读者我要写书评

暂无评论

A simple load balancing scheme for task allocation in parallel machines 91

A simple load balancing scheme for task allocation in parall...

引用

3rd annual acm symposium on parallel algorithms and architectures, SPAA 1991

作者： Rudolph, Larry Slivkin-Allalouf, Miriam Upfal, Eli Department of Computer Science Hebrew University Jerusalem Israel IBM TJ Watson Research Center Yorktown HeightsNY United States John Bryce Ltd. Science Based Industries PO BOX 23838 Jerusalem Israel Department of Applied Mathematics Weizman Institute Rehovot Israel IBM Almaden Research Center San JoseCA United States

ISBN: (纸本)0897914384

A collection of local workpiles (task queues) and a simple load balancing scheme is well suited for scheduling tasks in shared memory parallel machines. Task scheduling on such machines has usually been done through a single, globally accessible, workpile. The scheme introduced in this paper achieves a balancing comparable to that of a global workpile, while minimizing the overheads. In many parallel computer architectures, each processor has some memory that it can access more efficiently, and so it is desirable that tasks do not mirgrate frequently. The load balancing is simple and distributed: Whenever a processor accesses its local workpile, it performs a balancing operation with probability inversely proportional to the size of its workpile. The balancing operation consists of examining the workpile of a random processor and exchanging tasks so as to equalize the size of the two workpiles. The probabilistic analysis of the performance of the load balancing scheme proves that each tasks in the system receives its fair share of computation time. Specifically, the expected size of each local task queue is within a small constant factor of the average, i.e. total number of tasks in the system divided by the number of processors. © 1991 acm.

关键词： Memory architecture

来源：评论

学校读者我要写书评

暂无评论

In-place techniques for parallel convex hull algorithms 3

In-place techniques for parallel convex hull algorithms

引用

3rd annual acm symposium on parallel algorithms and architectures, SPAA 1991

作者： Ghouse, Mujtaba R. Goodrich, Michael T. Dept. of Computer Science Johns Hopkins University BaltimoreMD21218-2686 United States

ISBN: (纸本)0897914384

We present a number of efficient parallel algorithms for constructing 2- and 3-dimensional convex hulls on a randomized CRCW PRAM. Specifically, we show how to build the convex hull of n pre-sorted points in the plane almost surely in O(1) time using O(n log n) processors, or, alternately, almost surely in O (log∗ n) time using an optimal number of processors. We also show how to find the convex hull of n unsorted points in R2 (resp., R3) in O(log2 n) time using O(n log h) work (resp., O(log2n) time using O(min{nlog2 h, n log n}) work), with very high probability, where h is the number of edges in the convex hull (h is O(n), but can be as small as O(l)). Our algorithms for unsorted input depend on the use of new in-place procedures, that is, procedures that are defined on a subset of elements in the input and that work without re-ordering the input. For the pre-sorted case we also exploit a technique that allows one to modify an algorithm that assumes it is given points so that it can be used on hulls;we call such algorithms point-hull invariant. © 1991 acm.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

Balanced routing. Towards the distance bound on grids 91

Balanced routing. Towards the distance bound on grids

引用

3rd annual acm symposium on parallel algorithms and architectures - SPAA'91

作者： Kunde, M. Institut f. Informatik TU Munich Arcisstr. 21 D-8000 Munich 2 Germany

The problem of packet routing on an r-dimensional mesh-connected array or grid of processors with side-length n is studied. Each processor is able to store rf(n) packets, f(n) 1-1/r. The new class of balanced routing ... 详细信息

ISBN: (纸本)0897914384

The problem of packet routing on an r-dimensional mesh-connected array or grid of processors with side-length n is studied. Each processor is able to store rf(n) packets, f(n) < n^1-1/r. The new class of balanced routing problems is introduced which includes such fundamental problems as partial h - h routing. On 3-dimensional n × n × n grids (without wrap-arounds) partial permutation problems and so-called (1, f(n))-balanced problems can be solved by a deterministic routing algorithm needing only 3.333n + O(n/f(n)^1/2) steps which is asymptotically only 11.11 percent larger than the distance bound of 3n - 3 steps. The result is better than those of so far known randomized algorithms, routing data only with high probability. The new algorithm also beats previous deterministic routing algorithms. For arbitrary r, r > 3, permutation routing on r-dimensional cubes can be performed in asymptotically (2r - 3+l/r)n steps which again is faster than the running times of so far known algorithms, both randomized and deterministic ones. A further improvement leads to an algorithm with approximately (r + (r - 2)(I/r)^1/(r-2))n + O(n/f(n) ^1/(r-1)) transport steps. For a constant buffer size of O((r²/ϵ) ^r-1) packets, ϵ > 0, a number of (r+(r - 2)(l/r) ^1/(r-2)/ + ϵ)n steps can be achieved. The number of steps is reduced to the half if the algorithms are adapted to tori of processors, i.e. grids with wrap-around connections. Furthermore, algorithms for the general h - h routing problem are presented which also needs a smaller number of steps than previous algorithms. It is shown that these problems can be solved in O((h + r)n) instead of O(hrn) needed before. © 1991 acm.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

SPAA '90 proceedings of the 2nd annual acm symposium on parallel algorithms and architectures

SPAA '90 Proceedings of the 2nd Annual ACM Symposium on Para...

引用

SPAA '90 - proceedings of the 2nd annual acm symposium on parallel algorithms and architectures

This conference proceeding contains 45 papers. The topics covered include: routing algorithms;array processing;message passing;fault tolerance;hypercubes;scheduling;parallel algorithms;memory sharing;computational com... 详细信息

ISBN: (纸本)0897913701

关键词： Computer Programming

来源：评论

学校读者我要写书评

暂无评论

New preconditioner for the parallel solution of positive definite Toeplitz systems

New preconditioner for the parallel solution of positive def...

引用

SPAA '90 - proceedings of the 2nd annual acm symposium on parallel algorithms and architectures

作者： Bini, Dario Di Benedetto, Fabio Univ di Pisa Pisa Italy

ISBN: (纸本)0897913701

We introduce a new preconditioner for solving a symmetric Toeplitz system of equations by the conjugate gradient method. This choice leads to an algorithm which is particularly suitable for parallel computations and, compared to the circulant preconditioner of [C3], has a better asymptotic convergence rate and a lower arithmetic cost per iteration.

关键词： Computer Programming

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共39页 << < 30 31 32 33 34 35 36 37 38 39 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：