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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

108 篇 会议
13 篇 期刊文献
1 册 图书

馆藏范围

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

日期分布

学科分类号

85 篇 工学
- 83 篇 计算机科学与技术...
- 53 篇 软件工程
- 8 篇 电子科学与技术（可...
- 6 篇 信息与通信工程
- 4 篇 力学（可授工学、理...
- 4 篇 电气工程
- 4 篇 农业工程
- 1 篇 动力工程及工程热...
- 1 篇 控制科学与工程
- 1 篇 建筑学
- 1 篇 土木工程
- 1 篇 石油与天然气工程
- 1 篇 核科学与技术
51 篇 理学
- 51 篇 数学
- 8 篇 统计学（可授理学、...
- 3 篇 物理学
- 2 篇 系统科学
11 篇 管理学
- 7 篇 管理科学与工程(可...
- 6 篇 工商管理
- 4 篇 图书情报与档案管...
4 篇 农学
- 4 篇 作物学
1 篇 经济学
- 1 篇 应用经济学

主题

20 篇 parallel archite...
17 篇 parallel algorit...
15 篇 programming
15 篇 parallel process...
8 篇 computer archite...
8 篇 parallel program...
7 篇 parallel process...
5 篇 approximation al...
5 篇 hardware
4 篇 computational mo...
4 篇 graphics process...
3 篇 performance
3 篇 routing
3 篇 computer systems...
3 篇 memory managemen...
3 篇 algorithm design...
3 篇 parallel computi...
3 篇 field programmab...
3 篇 scheduling
3 篇 data models

机构

4 篇 carnegie mellon ...
2 篇 harvard univ div...
2 篇 bar ilan univ de...
2 篇 paderborn univ p...
2 篇 school of comput...
2 篇 mit comp sci & a...
2 篇 school of comput...
2 篇 suny stony brook...
1 篇 instutut d'elect...
1 篇 univ wroclaw ins...
1 篇 faculty of compu...
1 篇 inesc-id isel ip...
1 篇 dipartimento di ...
1 篇 ens rennes renne...
1 篇 ecole cent paris
1 篇 soochow univ sch...
1 篇 department of co...
1 篇 state key lab of...
1 篇 cinvestav tamaul...
1 篇 dept. of electro...

作者

4 篇 blelloch guy e.
4 篇 tangwongsan kana...
2 篇 ballard grey
2 篇 holtz olga
2 篇 varman peter j.
2 篇 jianxi fan
2 篇 anon
2 篇 jigang wu
2 篇 hasenplaugh will...
2 篇 bender ma
2 篇 schardl tao b.
2 篇 schwartz oded
2 篇 simhadri harsha ...
2 篇 kaler tim
2 篇 lipshitz benjami...
2 篇 klein st
2 篇 leiserson charle...
2 篇 rabin mo
2 篇 vishkin uzi
2 篇 demmel james

语言

120 篇 英文
2 篇 其他

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

共 122 条记录，以下是101-110 订阅

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

详细简洁

排序：

A parallel evolutionary algorithm for the vehicle routing problem with heterogeneous fleet 12th

引用

10 Workshops held in conjunction with 12th International parallel symposium and 9th symposium on parallel and Distributed Processing, IPPS/SPDP 1998

作者： Ochi, Luiz S. Vianna, Dalessandro S. Drummond, Lúcia M. A. Victor, André O. PGCC-UFF NiteróiRJ Brazil

ISBN: (纸本)3540643591

Nowadays genetic algorithms stand as a trend to solve NPcomplete and NP-hard problems. In this paper, we present a new hybrid metaheuristic which uses parallel Genetic algorithms and Scatter Search coupled with a decomposition-into-petals procedure for solving a class of Vehicle Routing and Scheduling Problems. the parallel genetic algorithm presented is based on the island model and was run on a cluster of workstations. Its performance is evaluated for a heterogeneous fleet problem, which is considered a problem much harder to solve than the homogeneous vehicle routing problem. © Springer-Verlag Berlin Heidelberg 1998.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

An integrated partitioning and synthesis system for dynamically reconfigurable multi-FPGA architectures 12th

引用

10 IPPS/SPDP 98 Workshops Held in Conjunction with the 12th International parallel Processing symposium / 9th symposium on parallel Distributed Processing

作者： Ouaiss, I Govindarajan, S Srinivasan, V Kaul, M Vemuri, R Univ Cincinnati DDEL Dept ECECS Cincinnati OH 45221 USA

ISBN: (纸本)3540643591

this paper presents an integrated design system called SPARCS (Synthesis and Partitioning for Adaptive Reconfigurable Computing Systems) for automatically partitioning and synthesizing designs for reconfigurable boards with multiple field-programmable devices (FPGAs). the SPARCS system accepts design specifications at the behavior level, in the form of task graphs. the system contains a temporal partitioning tool to temporally divide and schedule the tasks on the reconfigurable architecture, a spatial partitioning tool to map the tasks to individual FPGAs, and a high-level synthesis tool to synthesize efficient register-transfer level designs for each set of tasks destined to be downloaded on each FPGA. Commercial logic and layout synthesis tools are used to complete logic synthesis, placement, and routing for each FPGA design segment. A distinguishing feature of the SPARCS system is the tight integration of the partitioning and synthesis tools to accurately predict and control design performance and resource utilizations. this paper presents an overview of SPARCS and the various algorithms used in the system, along with a brief description of how a JPEG-like image compression algorithm is mapped to a multi-FPGA board using SPARCS.

关键词： Field programmable gate arrays (FPGA)

来源：评论

学校读者我要写书评

暂无评论

Efficient runtime thread management for the nano-threads programming model 12th

引用

10 Workshops held in conjunction with 12th International parallel symposium and 9th symposium on parallel and Distributed Processing, IPPS/SPDP 1998

作者： Nikolopoulos, Dimitrios S. Polychronopoulos, Eleftherios D. Papatheodorou, theodore S. High Performance Computing Architectures Laboratory Department of Computer Engineering and Informatics University of Patras Rio Patras26500 Greece

ISBN: (纸本)3540643591

the nano-threads programming model was proposed to effectively integrate multiprogramming on shared-memory multiprocessors, with the exploitation of fine-grain parallelism from standard applications. A prerequisite for the applicability of the nano-threads programming model is the ability of the runtime environment to manage parallelism at any level of granularity with minimal overheads. In this paper, we introduce runtime techniques for efficient memory management and user-level scheduling in an experimental runtime system designed to support the nano-threads programming model. We evaluate the exploitation of processor affinity for the management of nano-thread contexts, and the use of hierarchical queues to implement user-level scheduling strategies for applications with inherent multilevel parallelism. the proposed mechanisms attempt to obtain maximum benefits from data locality on cache-coherent NUMA multip'rocessors. through the use of synthetic benchmarks, we find that our mechanism for memory management in the runtime system reduces overheads by 52% on average, compared to other known mechanisms. the use of hierarchical queues gives significant performance improvements between 17% and 40%, compared to scheduling strategies that use local queues. © Springer-Verlag Berlin Heidelberg 1998.

关键词： Multiprogramming

来源：评论

学校读者我要写书评

暂无评论

Developing a practical projection-based parallel Delaunay algorithm 96

Developing a practical projection-based parallel Delaunay al...

引用

Proceedings of the 1996 12th Annual symposium on Computational Geometry

作者： Blelloch, Guy E. Miller, Gary L. Talmor, Dafna Carnegie Mellon Univ United States

ISBN: (纸本)9780897918046

In this paper we are concerned with developing a practical parallel algorithm for Delaunay triangulation that works well on general distributions, particularly those that arise in Scientific Computation. Although there have been many theoretical algorithms for the problem, and some implementations based on bucketing that work well for uniform distributions, there has been little work on implementations for general distributions. We use the well known reduction of 2D Delaunay triangulation to 3D convex hull of points on a sphere or paraboloid. A variant of the Edelsbrunner and Shi 3D convex hull is used, but for the special case when the point set lies on either a sphere or a paraboloid. Our variant greatly reduces the constant costs from the 3D convex hull algorithm and seems to be a more promising for a practical implementation than other parallel approaches. We have run experiments on the algorithm using a variety of distributions that are motivated by various problems that use Delaunay triangulations. Our experiments show that for these distributions we are within a factor of approximately two in work from the best sequential algorithm.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

parallel robust algorithms for constructing strongly convex hulls 96

Parallel robust algorithms for constructing strongly convex ...

引用

Proceedings of the 1996 12th Annual symposium on Computational Geometry

作者： Chen, Wei Wada, Koichi Kawaguchi, Kimio Nagoya Inst of Technology Nagoya Japan

ISBN: (纸本)9780897918046

Given a set S of n points in the plane, an Ε-strongly convex δ-hull of S is defined as a convex polygon P with the vertices taken from S such that no point of S lies farther than δ outside P and such that even if the vertices of P are perturbed by as much as Ε, P remains convex (e.g., the convex hull of S is a 0-strongly convex 0-hull of S). this paper presents the first parallel robust method for the generalized convex hull problem. We show that an Ε-strongly convex O(Ε + β)-hull of S can be constructed in O(log3 n) time using n processors with imprecise computations, where β is the error unit of the primitive operations. the result implies an improved sequential algorithm for the problem. Our method consists of three algorithms: finding an approximate common tangent of two sets of n points each in O(log2 n) time using n processors, computing a convex O(Ε + β)-hull of n points in O(log3 n) time using n processors, and constructing an Ε-strongly convex O(Ε + β)-hull of a convex n-gon in O(log n) time with n processors using imprecise computations. We use the CREW PRAM computational model in the paper.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

Faster output-sensitive parallel convex hulls for d &le 3: optimal sublogarithmic algorithms for small outputs

Faster output-sensitive parallel convex hulls for d &le 3: o...

引用

Proceedings of the 1996 12th Annual symposium on Computational Geometry

作者： Gupta, Neelima Sen, Sandeep Indian Inst of Technology New Delhi India

In this paper we focus on the problem of designing very fast parallel algorithms for the convex hull problem in two and three dimensions in the arbitrary CRCW model whose running times are output-size sensitive. We present a fast randomized algorithm for planar hulls that runs in expected time O(log H · log log n) and does optimal O(n log H) work where n and H are the input and output sizes respectively. For log H = Ω(log log n), we can achieve the optimal running time of O(log H) for planar hulls while simultaneously keeping the work optimal. In three dimensions, our algorithm runs in expected time O(log log2 n·log H) with optimal O(n log H) work for all H. Hence, for O(logO(1) n) size outputs, our algorithms in two and three dimensions achieve poly(log log n) running time and optimal O(n log log n) work. the previously known output-sensitive work-optimal algorithms for convex hulls have running times Ω(log n) (expected) and Ω(log3 n) in two and three dimensions respectively. Our algorithms assume no input distribution and the running times hold with high probability. We also describe a very simple O(log n log H) time optimal deterministic algorithm for planar hulls which is an improvement for small outputs. For larger output-sizes, a running time of O(log n log log n)) can be achieved.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

Optimal average case sorting on arrays 12th

引用

12th Annual symposium on theoretical Aspects of Computer Science, STACS 1995

作者： Kunde, Manfred Niedermeier, Rolf Reinhardt, Klaus Rossmanith, Peter Wilhelm-Schickard-Institut für Informatik Universität Tübingen Sand 13 TübingenD-72076 Germany Technische Universität München Arcisstr. 21 MünchenD-80290 Germany

ISBN: (纸本)3540590420

We present algorithms for sorting and routing on two-dimensional mesh-connected parallel architectures that are optimal on average. If one processor has many packets then we asymptotically halve the up to now best running times. For a load of one optimal algorithms are known for the mesh. We improve this to a load of eight without increasing the running time. For tori no optimal algorithms were known even for a load of one. Our algorithm is optimal for every load. Other architectures we consider include meshes with diagonals and reconfigurable meshes. Furthermore, the method applies to meshes of arbitrary higher dimensions and also enables optimal solutions for the routing problem. © Springer-Verlag Berlin Heidelberg 1995.

关键词： parallel architectures

来源：评论

学校读者我要写书评

暂无评论

Issues and directions in scalable parallel computing 93

Issues and directions in scalable parallel computing

引用

Proceedings of the 12th Annual acm symposium on Principles of Distributed Computing

作者： Snir, Marc T.J. Watson Research Cent Yorktown Heights NY United States

ISBN: (纸本)0897916131

the design and use of scalable parallel computers is discussed. Much of the knowledge gained in the study of distributd systems is relevant, although it needs to be used in new manners. the author argues that the challenge is to achieve maximum reuse of existing technologies, microprocessor architectures, I/O systems, programming languages, operating systems, application codes, without compromising too much parallel performance and scalability. Such skillful compromises are essential to the success of the parallel processing industry, and pose even more intellectual challenges than the 'start from scratch' approach.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Proceedings of the 12th Annual acm symposium on Principles of Distributed Computing

Proceedings of the 12th Annual ACM Symposium on Principles o...

引用

Proceedings of the 12th Annual acm symposium on Principles of Distributed Computing

ISBN: (纸本)0897916131

the symposium materials contain 24 papers. the topics covered include local area networks as distributed systems;operating systems research;scalable parallel computing;atomic snapshots;radio networks;fast deflection routing for packets and worms;parallel computing models;wait-free clock synchronization;optimal clock synchronization;partially synchronized clocks;resource bounds and combinations of consensus objects;scalable synchronization with minimal hardware support;adaptive solutions to the mutual exclusion problem;distributed fingerprints and secure information dispersal;replicated files;space complexity of randomized synchronization;lower bound on wait-free counting;and knowledge-oriented programming.

关键词： Distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Experiences with a model for parallel computation 93

Experiences with a model for parallel computation

引用

Proceedings of the 12th Annual acm symposium on Principles of Distributed Computing

作者： Juurlink, B.H.H. Wijshoff, H.A.G. Leiden Univ Leiden Netherlands

ISBN: (纸本)0897916131

In this paper we study the practical viability of the BSP model of parallel computation as proposed by Valiant. this model is intended for simulating the often considered PRAM model on more realistic parallel computers with a fixed interconnection network. One of the main attributes of the BSP model is randomized routing. From experimentation on an existing parallel architecture, analytic models are derived which characterize the efficiency of this routing scheme. this characterization leads to the identification of the bottlenecks involved in building a parallel architecture in which the BSP model can efficiently be embedded.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共13页 << < 4 5 6 7 8 9 10 11 12 13 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：