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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,470 篇 会议
1,250 篇 期刊文献
2 篇 资讯
1 篇 学位论文

馆藏范围

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

日期分布

学科分类号

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

主题

15,723 篇 partitioning alg...
4,681 篇 clustering algor...
3,075 篇 algorithm design...
1,672 篇 computer science
1,281 篇 heuristic algori...
1,133 篇 data mining
889 篇 computational mo...
744 篇 hardware
735 篇 costs
734 篇 optimization
722 篇 image segmentati...
657 篇 iterative algori...
591 篇 parallel process...
575 篇 approximation al...
573 篇 testing
559 篇 routing
504 篇 computer archite...
474 篇 concurrent compu...
459 篇 very large scale...
440 篇 application soft...

机构

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,585 篇 英文
106 篇 其他
32 篇 中文

检索条件"主题词=partitioning algorithms"

共 15723 条记录，以下是381-390 订阅

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

详细简洁

排序：

GraphA: Adaptive partitioning for Natural Graphs 37

GraphA: Adaptive Partitioning for Natural Graphs

引用

37th IEEE International Conference on Distributed Computing Systems (ICDCS)

作者： Li, Dongsheng Zhang, Chengfei Wang, Jinyan Zhang, Zhaoning Zhang, Yiming Natl Univ Def Technol Natl Lab Parallel & Distributed Proc Changsha Hunan Peoples R China

ISBN: (纸本)9781538617915

Large-scale graph computation is central to applications ranging from language processing to social networks. However, natural graphs tend to have skewed power-law distributions where a small subset of the vertices have a large number of neighbors. Existing graph-parallel systems suffer from load imbalance, high communication cost, or suboptimal and complex processing. In this paper we present GraphA, an Adaptive approach to efficient partitioning and computation of large-scale natural graphs. GraphA provides an adaptive and uniform graph partitioning algorithm, which partitions the datasets in a load-balanced manner by using an incremental number of hash functions. We have implemented GraphA both on Spark and on GraphLab. Extensive evaluation shows that GraphA remarkably outperforms state-of-the-art graph-parallel systems (GraphX and PowerLyra) in ingress time, execution time and storage overhead, for both real-world and synthetic graphs.

关键词： partitioning algorithms Mirrors Social network services Sparks Loading Complexity theory Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

3D-Stacked Integrated Circuits: How Fine Should System partitioning Be?

3D-Stacked Integrated Circuits: How Fine Should System Parti...

引用

IEEE International Symposium on Circuits and Systems (IEEE ISCAS)

作者： Delhaye, Quentin Milojevic, Dragomir Goossens, Joel ULB Ecole Polytech Bruxelles BEAMS CP165-56Av F Roosevelt B-1050 Brussels Belgium ULB Fac Sci PARTS CP21250 Av F Roosevelt B-1050 Brussels Belgium

ISBN: (纸本)9781728103976

3D stacked ICs package multiple, independently manufactured dies to reduce total system wire-length, improve timing, and reduce area and power. When designing stacked 3D-ICs, arises the question of the grain at which one should consider system partitioning to optimize the gains. This work uses known MAX-CUT graph partitioning algorithms to split designs from 42k up to 800k gates, with gates clustered from 8 and up to 32768 partitions. It has been found that with 2048 clusters, i.e. 20 to 400 gates per cluster depending on the design, a partitioning of the system allows on average to cut 35 % of the nets that account for 73 % of the total wire-length in 3D.

关键词： Three-dimensional displays Logic gates Two dimensional displays Integrated circuit interconnections partitioning algorithms Transistors Optimization

来源：评论

学校读者我要写书评

暂无评论

Spectral partitioning for Node Criticality 20

Spectral Partitioning for Node Criticality

引用

IEEE Symposium on Computers and Communication (ISCC)

作者： Asif, Waqar Lestas, Marios Qureshi, Hassaan Khaliq Rajarajan, Muttukrishnan City Univ London Sch Engn & Math Sci London England NUST Islamabad Pakistan Frederick Univ Dept Elect Engn Nicosia Cyprus

ISBN: (纸本)9781467371940

Finding critical nodes in a network is a significant task, highly relevant to network vulnerability and security. We consider the node criticality problem as an algebraic connectivity minimization problem where the objective is to choose nodes which minimize the algebraic connectivity of the resulting network. Previous suboptimal solutions of the problem suffer from the computational complexity associated with the implementation of a maximization consensus algorithm. In this work, we use spectral partitioning concepts introduced by Fiedler, to propose a new suboptimal solution which significantly reduces the implementation complexity. Our approach, combined with recently proposed distributed Fiedler vector calculation algorithms enable each node to decide by itself whether it is a critical node. If a single node is required then the maximization algorithm is applied on a restricted set of nodes within the network. We derive a lower bound for the achievable algebraic connectivity when nodes are removed from the network and we show through simulations that our approach leads to algebraic connectivity values close to this lower bound. Similar behaviour is exhibited by other approaches at the expense, however, of a higher implementation complexity.

关键词： Complexity theory Computers Eigenvalues and eigenfunctions Electronic mail Laplace equations Measurement partitioning algorithms

来源：评论

学校读者我要写书评

暂无评论

Accelerating space traversal methods for explicit model predictive control via space partitioning trees 13

Accelerating space traversal methods for explicit model pred...

引用

13th European Control Conference (ECC)

作者： Jafargholi, Mahmoud Peyrl, Helfried Zanarini, Alessandro Herceg, Martin Mariethoz, Sebastien ABB Corp Res Baden Daettwil Switzerland ETHZ Automat Control Lab Zurich Switzerland

ISBN: (纸本)9783952426913

The paper elaborates an approach for acceleration of space traversal methods for solving a point location problem involved in the evaluation of explicit model predictive control laws. The idea is to improve the initialisation of the space traversal algorithms by providing initial estimates that restrict the search over a fraction of the original space. The reduction of the search space ensures that the space traversal algorithms can find the solution significantly faster as if sought over the full space. The proposed approach comprises two algorithms. The first algorithm generates an orthogonal partition of the search space off-line which is represented by a quadtree. In the second algorithm, the quadtree is traversed on-line and a particular space traversal method is initialised. The paper provides complexity analysis of both algorithms in the runtime and storage requirements. The approach is tested numerically on multiple examples and achieves significant reduction of iterations in the space traversal methods.

关键词： Acceleration Aerospace electronics Complexity theory Indexes Legged locomotion Memory management partitioning algorithms avionics partitioning algorithms acceleration Biped locomotion Store management Complexity theory quaternary tree Model predictive control Predictive control distributed model predictive control nonlinear model predictive control

来源：评论

学校读者我要写书评

暂无评论

Applying scheduling by edge reversal to constraint partitioning 15

Applying scheduling by edge reversal to constraint partition...

引用

15th Symposium on Computer Architecture and High Performance Computing

作者： Pereira, MR Vargas, PK França, FMG de Castro, MCS Dutra, ID Univ Fed Rio de Janeiro COPPE BR-21945 Rio De Janeiro Brazil

ISBN: (纸本)0769520464

Scheduling by Edge Reversal (SER) is a fully distributed scheduling mechanism based on the manipulation of acyclic orientations of a graph. This work uses SER to perform constraint partitioning of Constraint Satisfaction Problems (CSP). In order to apply the SER mechanism, the graph representing the constraints must receive an acyclic orientation. Since obtaining an optimal acyclic orientation is an NP-hard problem, this work studies three non-deterministic strategies known in the literature: Alg-Neigh, Alg-Edges, and Alg-Colour. We implemented the three algorithms and the SER scheduling mechanism, applying them to the CSP constraint networks generated from 3 applications. Our results show that SER has a great potential to perform a good partitioning of the constraint graphs.

关键词： Concurrent computing Distributed algorithms Distributed computing NP-hard problem partitioning algorithms Processor scheduling Programming environments Scheduling algorithm System recovery Time factors

来源：评论

学校读者我要写书评

暂无评论

Energy-Aware partitioning for On-Chip Bus Architecture using a Multi-Objective Genetic Algorithm

Energy-Aware Partitioning for On-Chip Bus Architecture using...

引用

International Symposium on VLSI Design, Automation and Test (VLSI-DAT)

作者： Chiou, Lih-Yih Chen, Yi-Siou Jian, Ya-Lun Natl Cheng Kung Univ Dept Elect Engn Tainan 70101 Taiwan

ISBN: (纸本)9781424484997

Incorporating power management during partitioning at the system level contributes considerably to energy efficient architecture. Designers commonly implement systems as a mix of partitioning blocks of various sizes, connected using bus interconnection architecture. Therefore, the use of a partitioning approach that partitions a system with the greatest possible idle time on a dedicated interconnection architecture has become unpractical for power management development. This work presents a novel energy-aware hardware clustering algorithm with a performance estimator for on-chip bus based architectures during high level synthesis, to enhance the quality of solutions for implementing power management systems. Experimental results obtained in four cases reveal that the proposed strategy generates a wide range of cost-effective solutions and is highly effective for today's hardware systems.

关键词： Algorithm design and analysis Clustering algorithms Computer architecture Energy consumption Genetic algorithms partitioning algorithms Power demand energy efficient architecture energy-aware hardware clustering energy-aware partitioning genetic algorithms high level synthesis high level synthesis integrated circuit interconnections interconnection architecture multiobjective genetic algorithm on-chip bus architecture on-chip bus based architecture power management systems

来源：评论

学校读者我要写书评

暂无评论

A stochastic automaton-based algorithm for flexible and distributed network partitioning

A stochastic automaton-based algorithm for flexible and dist...

引用

IEEE Swarm Intelligence Symposium

作者： Wan, Y Roy, S Saberi, A Lesieutre, B Washington State Univ Pullman WA 99164 USA

ISBN: (纸本)0780389166

This paper proposes a exible stochastic automaton-based network partitioning algorithm that is capable of find-ing the optimal k-way partition with respect to a broad range of cost functions, and given various constraints, in directed and weighted graphs. Further, this iterative algorithm requires only local computation, with respect to the graph. Hence, by incorporating a distributed stopping criterion, we have been able to solve certain partitioning problems in a totally distributed manner. In this article, this inuence model-based partitioning algorithm is motivated and introduced, and is shown to find the optimal partition for a large class of problems. Also, a conceptual discussion of why the algorithm might be expected to find good partitions quickly is included, and the performance of the algorithm is illustrated through examples. Applications in partitioning distributed communicatin-agent networks, sensor systems, and power grids are discussed.

关键词： directed graphs distributed algorithms stochastic automata distributed communicating-agent network distributed network partitioning distributed stopping criterion iterative algorithm optimal k-way partition power grid sensor system stochastic automaton-b Power grids stochastic automata Sensor systems Iterative algorithms directed graphs distributed algorithms FLEXIBLE partitions algorithms DISTRIBUTED NETWORKS partitioning algorithms Cost functions

来源：评论

学校读者我要写书评

暂无评论

partitioning of distributed virtual environments based on objects' attributes 07

Partitioning of distributed virtual environments based on ob...

引用

11th IEEE International Symposium on Distributed Simulation and Real-Time Applications

作者： Bouras, C. Giannakal, E. Tsiatsos, Th. Univ Patras Comp Engn & Informat Dept GR-26110 Patras Greece Res Acad Comp Technol Inst GR-26110 Patras Greece Univ Thessaloniki Informat Dept Aristotelian Thessaloniki Greece

ISBN: (纸本)9780769530116

The partitioning constitutes one of the basic problems that need to be handled in Distributed Virtual Environments for maintaining consistency among users' view of the virtual scene and for optimzing the performance of the system: This paper presents an approach for handling the partitioning problem, which is based on objects' attributes. In particular, the approach proposes a technique, which takes into account the degree of interaction that the objects of the virtual environment carry for predicting future avatar behavior. This prediction of avatars' behavior based on objects' attributes defines the initial partitioning of the virtual space.

关键词： Virtual environment Avatars partitioning algorithms Distributed computing Informatics Network servers Computational modeling Computer simulation Real time systems Application software

来源：评论

学校读者我要写书评

暂无评论

Distributed Fault Tolerant and Balanced Multi-Robot Area partitioning for Coverage Applications

Distributed Fault Tolerant and Balanced Multi-Robot Area Par...

引用

INTERNATIONAL CONFERENCE ON UNMANNED AIRCRAFT SYSTEMS (ICUAS)

作者： Jain, Rishav Tiwari, Rohan Jain, Puneet Sujit, P. B.

ISBN: (纸本)9781538613542

Persistent multi-robot coverage is an essential requirement in many applications, which can be achieved by decomposing a region into cells or polygons and assigning robots to cover these cells. During the operation, agents can fail, resulting in partial coverage. The faulty agent must be discovered quickly and its area must be redistributed between the rest of the working agents. However, in real world applications agents have limited communication range and hence detecting the presence of a faulty agent and redistributing the area is difficult. In this paper, we develop a distributed fault detection and area balancing algorithm using periodic communication under limited communication constraints. The approach takes agent motion uncertainty into account and develops a conflict free schedule for communication. Analysis and simulation results are presented to validate the fault tolerant capabilities of our approach.

关键词： Nickel Schedules Robot kinematics partitioning algorithms Monitoring Fault tolerance"

来源：评论

学校读者我要写书评

暂无评论

K-Ways partitioning of Polyhedral Process Networks: a Multi-Level Approach 29

K-Ways Partitioning of Polyhedral Process Networks: a Multi-...

引用

29th IEEE International Parallel and Distributed Processing Symposium (IPDPS)

作者： Cattaneo, Riccardo Moradmand, Mahdi Sciuto, Donatella Santambrogio, Marco D. Politecn Milan Milan Italy

ISBN: (纸本)9781467376846

Process Networks(PNs)-based models of computation have proven as a successful framework for describing multiple kinds of applications in the Reconfigurable Hardware (RH) domain. Due to their intrinsically parallel and reactive behavior, and well-known techniques to automatically manipulate some of their instances, they are very amenable to Field Programmable Gate Arrays (FPGAs). One problem associated with PNs is that the number of nodes is usually proportional with the parallel portions of computation, and a tool to automatically map tasks to FPGAs is required when multiple FPGAs are employed to improve performance (via increased parallelism). While it is possible to solve this problem in an exact manner via dynamic programming approaches, this is not the case when practical graphs are under examination, i.e. graphs with potentially thousands nodes. In this work we extend a well-known graph partitioning technique, namely Multi-Level K-ways partitioning algorithm, in order to cope with such scenario.

关键词： Approximation algorithms Bandwidth Clustering algorithms Field programmable gate arrays Heuristic algorithms partitioning algorithms Resource management

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 35 36 37 38 39 40 41 42 43 44 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：