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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

14,492 篇 会议
1,260 篇 期刊文献
2 篇 资讯
1 篇 学位论文

馆藏范围

15,755 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

3,647 篇 工学
- 1,935 篇 计算机科学与技术...
- 1,710 篇 电气工程
- 706 篇 信息与通信工程
- 556 篇 控制科学与工程
- 540 篇 软件工程
- 286 篇 机械工程
- 233 篇 仪器科学与技术
- 232 篇 电子科学与技术（可...
- 46 篇 测绘科学与技术
- 38 篇 交通运输工程
- 30 篇 网络空间安全
- 19 篇 航空宇航科学与技...
- 16 篇 材料科学与工程（可...
- 16 篇 生物医学工程（可授...
- 15 篇 矿业工程
- 13 篇 土木工程
- 12 篇 石油与天然气工程
- 9 篇 动力工程及工程热...
371 篇 管理学
- 368 篇 管理科学与工程(可...
308 篇 理学
- 131 篇 系统科学
- 72 篇 数学
- 54 篇 物理学
- 28 篇 生物学
- 25 篇 地球物理学
- 12 篇 统计学（可授理学、...
82 篇 医学
- 75 篇 临床医学
59 篇 文学
- 59 篇 新闻传播学
21 篇 艺术学
- 21 篇 设计学（可授艺术学...
16 篇 农学
14 篇 军事学
- 14 篇 军队指挥学
10 篇 教育学
- 9 篇 教育学
2 篇 经济学
2 篇 法学

主题

15,755 篇 partitioning alg...
4,692 篇 clustering algor...
3,074 篇 algorithm design...
1,672 篇 computer science
1,286 篇 heuristic algori...
1,133 篇 data mining
892 篇 computational mo...
746 篇 hardware
743 篇 optimization
740 篇 costs
722 篇 image segmentati...
657 篇 iterative algori...
591 篇 parallel process...
578 篇 approximation al...
575 篇 testing
559 篇 routing
505 篇 computer archite...
473 篇 concurrent compu...
459 篇 very large scale...
440 篇 shape

机构

40 篇 ibm thomas j. wa...
38 篇 department of co...
31 篇 school of comput...
25 篇 department of co...
22 篇 department of co...
20 篇 department of el...
18 篇 school of comput...
18 篇 department of co...
18 篇 department of el...
17 篇 department of co...
17 篇 school of electr...
17 篇 at and t bell la...
16 篇 school of comput...
16 篇 department of el...
16 篇 institute of com...
16 篇 department of el...
15 篇 department of co...
15 篇 department of co...
15 篇 department of el...
15 篇 school of electr...

作者

25 篇 xianlong hong
19 篇 hichem frigui
15 篇 yici cai
14 篇 sanghamitra band...
13 篇 jun wang
13 篇 g. karypis
13 篇 li li
13 篇 jing wang
12 篇 sriparna saha
12 篇 tzung-pei hong
12 篇 a.k. jain
12 篇 thambipillai sri...
11 篇 suleyman s. koza...
11 篇 hau-san wong
11 篇 yu wang
11 篇 hui wang
11 篇 jian-jia chen
11 篇 p. banerjee
11 篇 sanjoy baruah
11 篇 francisco de a.t...

语言

15,617 篇 英文
105 篇 其他
32 篇 中文

检索条件"主题词=Partitioning Algorithms"

共 15755 条记录，以下是241-250 订阅

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

详细简洁

排序：

Effective algorithms for partitioning distributed programs

Effective algorithms for partitioning distributed programs

引用

International Phoenix Conference on Computers and Communications (IPCCC)

作者： J.G. Donnett M. Starkey D.B. Skillicorn Department of Computing and Information Science Queen's University Kingston Canada

Results are presented on the effectiveness of several algorithms for partitioning graphs with weighted nodes and edges. Such graphs can represent a number of interesting program structures, such as processes using message passing or dataflow graphs and other distributed software. The graph partitions can be used in software tools to control the allocation of program units to distributed processes in ways which minimize communication cost, completion time or utilization. It is shown that, in situations in which a good partition is crucial, simulated annealing is the most effective algorithm. It is, however, an expensive algorithm to run, and when this is important good results can still be obtained by using a variant of a greedy algorithm. A number of other algorithms that can be useful in particular situations are described. Those can be of practical use to distributed system designers.< >

关键词： partitioning algorithms Object oriented modeling Costs Message passing Humans Programming environments Information science Communication system control Simulated annealing Greedy algorithms

来源：评论

学校读者我要写书评

暂无评论

Two novel encoding strategies based genetic algorithms for circuit partitioning

Two novel encoding strategies based genetic algorithms for c...

引用

International Conference on Machine Learning and Cybernetics (ICMLC)

作者： Guo-Fang Nan Min-Qiang Li Ji-Song Kou Institute of Systems Engineering Tianjin University TJU Tianjin China

ISBN: (纸本)0780384032

Circuit partitioning is a key phase in the VLSI design and partitioning algorithm is of great importance. Two styles of genetic algorithms based on different encoding strategies for circuit partitioning are presented. The first adopts the form of 0-1 encoding, and the second uses integer encoding based on modules number. Meanwhile, the corresponding fitness function and genetic operators are designed for each method. Then these two algorithms are implemented to test standard benchmark circuits. Compared with the traditional F-M algorithm, partition results by the two genetic algorithms are markedly improved.

关键词： Encoding Genetic algorithms partitioning algorithms Iterative algorithms Clustering algorithms Very large scale integration Circuit testing Algorithm design and analysis Biological cells Systems engineering and theory

来源：评论

学校读者我要写书评

暂无评论

algorithms for the partitioning of applications containing variable duration tasks on reconfigurable architectures

Algorithms for the partitioning of applications containing v...

引用

ACS/IEEE International Conference on Computer Systems and Applications

作者： F. Ghaffari M. Benjemaa M. Auguin CNRS Les Algorithmes I3S University of Nice Sophia Antipolis Sophia-Antipolis France Research Unit GMS Ecole Nationale dIngénieurs de Sfax Tunisia

Summary form only given. Many applications, especially in image processing, have variable execution times according to the nature of data to process. The implementation of low level processing in image processing (for example the detection of contours, labeling) in embedded architectures often uses specialized systems. We consider an architecture composed of a RISC processor linked to a dynamically reconfigurable circuit through a memory interface. To help to distribute processing with variable execution time on this architecture we present a partitioning approach based on a genetic algorithm.

关键词： partitioning algorithms Reconfigurable architectures Image processing Genetic algorithms Labeling Circuits Motion detection

来源：评论

学校读者我要写书评

暂无评论

Stratified Sampling for Even Workload partitioning Applied to IDA* and Delaunay algorithms

Stratified Sampling for Even Workload Partitioning Applied t...

引用

International Symposium on Parallel and Distributed Processing (IPDPS)

作者： Jeeva Paudel Levi H. S. Lelis José Nelson Amaral Department of Computing Science University of Alberta Departamento de Informatica Universidade Federal de Vicosa

This work presents Workload partitioning and Scheduling (WPS), a novel algorithm for evenly partitioning the computational workload of large implicitly-defined work-list-based applications on distributed/shared-memory systems. In WPS, a stratified sampling technique estimates the number of work items that will be processed in each step of the target application. Then WPS uses this estimation to evenly partition and distribute the computational workload. An empirical evaluation on large applications -- Iterative-Deepening A* (IDA*) applied to (4 × 4)- and (5 × 5)-Sliding-Tile Puzzles, Delaunay Mesh Generation, and Delaunay Mesh Refinement -- shows that WPS is applicable to a range of applications. A coordination between WPS and existing work-stealing schedulers for intra-node load balancing yields additional speedups in the range of 18% to 40% compared to that achieved with the existing work-stealing schedulers alone. Such a coordination also outperforms an existing workload-partitioning scheme intended specifically for IDA* algorithms by 17% to 36%.

关键词： partitioning algorithms Probes Clustering algorithms Heuristic algorithms Scheduling Estimation Computers

来源：评论

学校读者我要写书评

暂无评论

Multilevel algorithms for partitioning power-law graphs 06

Multilevel algorithms for partitioning power-law graphs

引用

International Symposium on Parallel and Distributed Processing (IPDPS)

作者： A. Abou-Rjeili G. Karypis Department of Computer Science & Engineering Army HPC Research Center & Digital Technology Center University of Minnesota Minneapolis MN USA

ISBN: (纸本)9781424400546

Graph partitioning is an enabling technology for parallel processing as it allows for the effective decomposition of unstructured computations whose data dependencies correspond to a large sparse and irregular graph. Even though the problem of computing high-quality partitionings of graphs arising in scientific computations is to a large extent well-understood, this is far from being true for emerging HPC applications whose underlying computation involves graphs whose degree distribution follows a power-law curve. This paper presents new multilevel graph partitioning algorithms that are specifically designed for partitioning such graphs. It presents new clustering-based coarsening schemes that identify and collapse together groups of vertices that are highly connected. An experimental evaluation of these schemes on 10 different graphs show that the proposed algorithms consistently and significantly outperform existing state-of-the-art approaches.

关键词： partitioning algorithms Parallel processing Algorithm design and analysis Concurrent computing Distributed computing Clustering algorithms Computer science Data engineering Power engineering and energy Military computing

来源：评论

学校读者我要写书评

暂无评论

partitioning and placement for multi-FPGA systems using genetic algorithms

Partitioning and placement for multi-FPGA systems using gene...

引用

EUROMICRO Conference

作者： J.I. Hidalgo J. Lanchares R. Hermida Dpto. Arquitectura de Computadores y Automática Universidad Complutense de Madrid Madrid Spain Universidad Complutense de Madrid Madrid Comunidad de Madrid ES

One of the most important and difficult tasks in multi-FPGA systems design is partitioning. The main problems are related to the I/O pins and logic capacity of FPGAs. The number of pins available is a critical problem, because FPGA devices have such a reduced number of them compared with their logic capacity. In addition we must reserve some of the pins to interconnect parts of the circuit placed on non-adjacent FPGAs. Most of the previous works have been adapted from other VLSI areas, and hence, they disregard the specific features of these kind of circuit. A new method for solving the partitioning and placement problem in multi-FPGA systems is presented. We use graph theory to describe the circuit, then a classical genetic algorithm (GA) is applied with a problem-specific encoding. The algorithm preserves the original structure of the circuit and by means of a fuzzy technique it evaluates the I/O-pins consumption due to direct and indirect connections between FPGAs. We have used the partitioning93 benchmarks described with the Xilinx Netlist Format (XNF). The results obtained show how genetic algorithms are capable of accomplishing successfully the partitioning and placement tasks while respecting the board constraints.

关键词： Genetic algorithms Field programmable gate arrays Pins Circuit topology Routing partitioning algorithms Logic devices Integrated circuit interconnections Very large scale integration Graph theory

来源：评论

学校读者我要写书评

暂无评论

A comparative analysis of fragmentation selection algorithms for data warehouse partitioning

A comparative analysis of fragmentation selection algorithms...

引用

International Conference on Advances in Engineering and Technology Research (ICAETR)

作者： M. Thenmozhi K. Vivekanandan Department of Computer Science and Engineering Pondicherry Engineering College Pondicherry India

Enterprise data warehouse system maintains large amounts of data for enabling business analysis. The queries imposed on such system involves complex joins, aggregation and filter operations. Hence in order to enhance query performance the data warehouse needs to be tuned by optimization techniques such as partitioning. Referential horizontal partitioning performs better for data warehouse where the fact table is partitioned based on the dimension table. The number of fragments or partitions that is generated by horizontal partitioning might be very large to be managed in the underlying database. In literature few fragmentation selection algorithms have been proposed in order to choose optimal set of fragments. In this paper we provide a summary of different fragmentation selection algorithms and provide comparative analysis between them.

关键词： Data warehouses Genetic algorithms partitioning algorithms Sociology Statistics Genetics Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

Fast encoding algorithms for geometry-adaptive block partitioning

Fast encoding algorithms for geometry-adaptive block partiti...

引用

IEEE International Conference on Image Processing

作者： Philippe Bordes Edouard Francois Dominique Thoreau Technicolor Research and Innovation Laboratories Cesson-Sevigne France

State-of-the-art video compression technologies, such as MPEG-4 AVC/H.264 or the new HEVC standard being developed by ISO MPEG and ITU-T VCEG, make use of tree-structured block partitioning for motion compensation. Such motion partitioning only captures horizontal and vertical motion boundaries. To better match actual motion frontiers, Geometry adaptive block partitioning (GEO) has been explored for several years. GEO enables splitting a block using non-horizontal or non-vertical line. Although noticeable coding efficiency gains can be obtained, GEO involves a significant increase of the number of modes to be tested with therefore a high impact on encoding complexity. This paper presents fast algorithms aiming at controlling the complexity while saving the coding efficiency gains of GEO. Experimental results are provided on top of the HEVC standard, demonstrating first the efficiency of the GEO tool. Simplified versions, offering noticeable complexity reduction with limited rate-distortion performance loss, are also demonstrated and compared.

关键词： Image edge detection Image coding Complexity theory partitioning algorithms Algorithm design and analysis Video coding Geometry

来源：评论

学校读者我要写书评

暂无评论

An Efficient Approach to VLSI Circuit partitioning Using Evolutionary algorithms

An Efficient Approach to VLSI Circuit Partitioning Using Evo...

引用

International Conference on Computational Intelligence and Communication Networks (CICN)

作者： Dhiraj Sangwan Seema Verma Rajesh Kumar CSIR-CEERI Pilani Rajasthan India ECE Deptt Banasthali Vidyapeeth Rajasthan India EEE Deptt MNIT Jaipur Rajasthan India

Circuit partitioning generally formulated as graph partitioning problem is an important step in physical design of circuits. The use of Evolutionary techniques is increasingly used to solve NP complete problems i.e. Applications for logic minimization and simulation heuristics. This paper explores the evolutionary approach of genetic algorithm and propose a hybrid technique involving the strengths of the existing techniques resulting in a better partitioning and placement of circuits. It can further be extended to the Hardware/Software boundary of algorithms and can be applied to real world physical design problems.

关键词： partitioning algorithms Genetic algorithms Sociology Statistics Very large scale integration Algorithm design and analysis Optimization

来源：评论

学校读者我要写书评

暂无评论

Sequential and Parallel algorithms for partitioning Tree Task Graphs on Shared Memory Architecture

Sequential and Parallel Algorithms for Partitioning Tree Tas...

引用

International Conference on Parallel Processing (ICPP)

作者： S. Ray Ilong Jiang Ilong Jiang Department of Computer Science and Engineering University of Nebraska Lincoln Lincolnshire NE USA

The problem of partitioning task graphs in its general form is known to be NP-complete and it is extremely difficult to come up with simple but effective and fast heuristics too. In this paper, the tree task graphs are considered which arise from many important programming paradigms such as divide and conquer branch and bound, etc. The target architecture considered is shared memory architecture as it typifies a wide range of research prototypes and commercial products of multiprocessors. Optimal sequential and parallel algorithms for partitioning tree task graphs such that the bottleneck is minimized "with minimum number of processors are developed. The bandwidth minimization problem is NP-complete even for trees. Three effective, simple 2-pass heuristics and their parallel versions are given. The effectiveness and efficiency of those heuristics are validated through extensive simulations.

关键词： Task analysis Minimization partitioning algorithms Bandwidth Parallel algorithms Time complexity Memory architecture

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 21 22 23 24 25 26 27 28 29 30 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：