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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

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

主题

15,745 篇 partitioning alg...
4,684 篇 clustering algor...
3,088 篇 algorithm design...
1,673 篇 computer science
1,281 篇 heuristic algori...
1,133 篇 data mining
889 篇 computational mo...
749 篇 hardware
735 篇 costs
724 篇 optimization
720 篇 image segmentati...
658 篇 iterative algori...
593 篇 parallel process...
576 篇 approximation al...
576 篇 testing
561 篇 routing
505 篇 computer archite...
477 篇 concurrent compu...
461 篇 very large scale...
444 篇 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...
18 篇 at and t bell la...
17 篇 department of co...
17 篇 school of electr...
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,591 篇 英文
122 篇 其他
32 篇 中文

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

共 15745 条记录，以下是191-200 订阅

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

详细简洁

排序：

algorithms for partitioning path construction of handwritten numeral strings

Algorithms for partitioning path construction of handwritten...

引用

International Conference on Pattern Recognition

作者： Jianming Hu Donggang Yu Hong Yan Department of Electrical Engineering University of Sydney NSW Australia

For connected handwritten characters, strokes are merged together in the touching area. Artifacts are often present in the separated characters and therefore the recognition performance will deteriorate. The paper des... 详细信息

ISBN: (纸本)0818685123

关键词： partitioning algorithms Character recognition Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

Task Scheduling in Multi-Cloud Environments: A Graph partitioning Approach Enhanced by Nested Genetic algorithms

Task Scheduling in Multi-Cloud Environments: A Graph Partiti...

引用

International Conference on Internet of Things: Systems, Management and Security

作者： Josepaul Paulachan Daniel Onwuchekwa Roman Obermaisser Chair for Embedded Systems University of Siegen Siegen Germany

ISBN: (数字)9798350366501

ISBN: (纸本)9798350366518

In today’s rapidly evolving cloud computing and IoT landscape, efficiently managing tasks across multiple cloud environments or IoT layers is essential for optimising resource utilisation, monitoring performance requirements, and meeting deadlines. To address this challenge, we present a methodology that merges graph partitioning with nested genetic algorithms (GAs) to optimise task allocation while prioritising to meet the deadlines. Our approach focuses on optimising partitions to ensure efficient and secure task execution across multi-cloud environments. Using the inherent structure of task dependencies and resource constraints depicted as a directed graph, we employ graph partitioning techniques to distribute tasks across available cloud or IoT resources while ensuring the task dependencies, thereby minimising makespan, optimising partitions and meeting the timing. To fortify our optimisation framework, various experiments were conducted. The results showcase our approach’s efficacy in achieving superior task scheduling efficiency, reductions in execution times, and optimisation of partitions, all while ensuring the strict timing requirements of critical systems.

关键词： Cloud computing Schedules Scheduling Timing partitioning algorithms Resource management Security Optimization Monitoring Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

On query-adaptive online partitioning: A study of evolutionary algorithms

On query-adaptive online partitioning: A study of evolutiona...

引用

IEEE International Conference on Performance, Computing and Communications (IPCCC)

作者： Ting Zhang Duc A. Tran Computer Science Department University of Massachusetts Boston

ISBN: (纸本)9781509052530

This paper initiates a new study on online partitioning algorithms that are sequentially optimized for a query sequence. As queries arrive one at a time, given the option to reconfigure the partition after each query so that it can best serve the next query, the objective is to minimize the query read cost and data migration cost. This is an online problem without an optimal solution; online heuristics are the only resort. We investigate this problem by formulating it as a multi-objective optimization and proposing an Evolutionary algorithms (EA) framework incorporating several online heuristics to explore Pareto-optimal solutions. This study is driven by our conjecture that if an online heuristic helps EA converge faster to better partitioning solutions then practically this heuristic should be preferred for adapting the partition to the query sequence.

关键词： Servers Sociology Statistics Evolutionary computation Optimization partitioning algorithms Adaptation models

来源：评论

学校读者我要写书评

暂无评论

Heterogeneous matrix-matrix multiplication or partitioning a square into rectangles: NP-completeness and approximation algorithms

Heterogeneous matrix-matrix multiplication or partitioning a...

引用

Euromicro Workshop on Parallel and Distributed Processing

作者： O. Beaumont V. Boudet A. Legrand F. Rastello Y. Robert LIP UMR CNRS-ENS Lyon-INRIA Lyon France

ISBN: (纸本)0769509878

In this paper, we deal with two geometric problems arising from heterogeneous parallel computing: how to partition the unit square into p rectangles of given area s/sub 1/, s/sub 2/, ..., s/sub p/ (such that /spl Sigma//sub i=1//sup p/ s/sub i/=1), so as to minimize (i) either the sum of the p perimeters of the rectangles (ii) or the largest perimeter of the p rectangles. For both problems, we prove NP-completeness and we introduce approximation algorithms.

关键词： Approximation algorithms partitioning algorithms Algorithm design and analysis Clustering algorithms Parallel processing Tiles Workstations Concurrent computing Libraries

来源：评论

学校读者我要写书评

暂无评论

Circuit partitioning using parallel mean field annealing algorithms

Circuit partitioning using parallel mean field annealing alg...

引用

International Symposium on Parallel and Distributed Processing (IPDPS)

作者： T. Bultan C. Aykanat Department of Computer Engineering and Information Science Bilkent University Ankara Turkey

Mean field annealing (MFA) algorithm, recently proposed for solving combinatorial optimization problems, combines the characteristics of neural networks and simulated annealing. Previous works on MFA resulted with successful mapping of the algorithm to some classic optimization problems such as travelling salesman problem and graph partitioning problem. In this paper, MFA is formulated for circuit partitioning problem (CPP) by using both graph and network models. Initial results of the implementations show that MFA can be used as an efficient alternative heuristic for CPP. MFA algorithms proposed for solving CPP are parallelized and implemented on an iPSC/2 hypercube multicomputer. Experimental results show that the proposed heuristics can be efficiently parallelized on hypercube multicomputers, which is crucial for algorithms solving such computationally hard problems.< >

关键词： partitioning algorithms Simulated annealing Hypercubes Hopfield neural networks Circuit simulation Computer networks Information science Neural networks Computational modeling Computer simulation

来源：评论

学校读者我要写书评

暂无评论

Efficient Parallel algorithms for Geometric partitioning Problems through Parallel Range Searching

Efficient Parallel Algorithms for Geometric Partitioning Pro...

引用

International Conference on Parallel Processing (ICPP)

作者： A. Datta Institut für Informatik Universität Freiburg Freiburg Germany

We present efficient parallel algorithms for some geometric bipartitioning problems. Our algorithms are designed to run in the CREW PRAM model of parallel computation. These bipartition problems are the following. Given a planar point set S (left| S right| = n), a measure mu acting on S and a pair of values fmu_1 and mu_2, does there exist a bipartition S = S_1 cup S_2 such that mu(S_{1}) leqslant mu_i for i = 1,2? We present efficient parallel algorithms for several measures like diameter under L_infty and L_1 metric; area, perimeter or length of diagonal of the smallest enclosing axes-parallel rectangle and the side length of the smallest enclosing axes-parallel square. All our parallel algorithms run in O(logn) time using O{n) processors in the CREW PRAM. The work done (processor-time product) by our algorithms matches the time complexity of the best known sequential algorithms for most of these problems. As a by product of our algorithms, we can perform report mode orthogonal range queries in optimal O(logn) time using 0(1 + k/logn) processors, where k is the number of points inside the query range. The processor-time product for this range reporting algorithm is optimal.

关键词： Program processors Parallel algorithms Phase change random access memory partitioning algorithms Vegetation Clustering algorithms Silicon

来源：评论

学校读者我要写书评

暂无评论

Comparison of heuristic algorithms for variable partitioning in circuit implementation

Comparison of heuristic algorithms for variable partitioning...

引用

International Conference on VLSI Design

作者： V. Muthukumar H. Selvaraj Department of Electrical and Computer Engineering University of Nevada Las Vegas NV USA

Functional decomposition is a process of splitting a complex circuit into smaller sub-circuits. This paper deals with the problem of determining the set of best free and bound variables (variable partitioning problem) for disjoint (disjoint serial) decomposition, such that the decomposed circuits are smaller in size and its truth table representation have maximal don't cares. A novel pruned breadth first search (PBFS/IPBFS) approach is proposed to determine the set of good variable partitions with minimal time and computational complexity. The heuristics proposed minimize the size of the sub functions. The proposed approach has been successfully implemented and test with MCNC and Espresso benchmarks.

关键词： Heuristic algorithms partitioning algorithms Input variables Field programmable gate arrays Cost function Circuit testing Circuit synthesis Search methods Computational complexity Benchmark testing

来源：评论

学校读者我要写书评

暂无评论

Area partitioning by Intelligent UAVs for effective path planning using Evolutionary algorithms

Area Partitioning by Intelligent UAVs for effective path pla...

引用

International Conference on Computer Communication and Informatics (ICCCI)

作者： Akshya. J P.L.K. Priyadarsini School of Computing SASTRA Deemed to be University Thanjavur India

ISBN: (纸本)9781728158754;9781728192994

Unmanned Aerial Vehicles (UAVs) have emerged as one of the most researched topics in recent times. They are being deployed in ample applications without any human intervention. The use of autonomous UAVs has given rise to many new challenges. Path planning has always been one of the most critical problems when it comes to the deployment of UAVs in real-time applications. The current work focuses on the area partitioning algorithm considering a few significant parameters such as static obstacles and altitude of UAVs. For any given geographic area, the proposed area partitioning algorithm finds a division of the entire area of interest by effectively partitioning into rectangles. The algorithm merges two or more equal-sized rectangles based on the obstacle position, resulting in a rectilinear partitioning of the area. Two mid-points are computed for each partition and are further used for the computation of an optimal path. An optimal path for the UAV is found by constructing a graph from the mid-points, posing the problem as Travelling Salesperson Problem(TSP), and finding a solution using Firefly Algorithm(FA) and Particle Swarm Optimization(PSO). Effective comparison is done to find the optimal path using both techniques. The obtained results show that FA outperforms PSO.

关键词： Heuristic algorithms Path planning Unmanned aerial vehicles Real-time systems partitioning algorithms Particle swarm optimization Informatics

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 16 17 18 19 20 21 22 23 24 25 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：