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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

3 篇 会议

馆藏范围

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

日期分布

学科分类号

3 篇 工学
- 2 篇 力学（可授工学、理...
- 2 篇 机械工程
- 2 篇 材料科学与工程（可...
- 1 篇 计算机科学与技术...
- 1 篇 化学工程与技术
- 1 篇 交通运输工程
- 1 篇 航空宇航科学与技...

主题

3 篇 selective breedi...
1 篇 precedence-const...
1 篇 np-hard
1 篇 computational co...
1 篇 al6061
1 篇 grid scheduling
1 篇 directed acyclic...
1 篇 electrical disch...
1 篇 metal matrix com...

机构

1 篇 saveetha sch eng...
1 篇 vels univ madras...
1 篇 rajalakashmi ins...
1 篇 saveetha inst me...
1 篇 st josephs coll ...
1 篇 mgr univ associa...
1 篇 vels inst sci te...

作者

2 篇 sriramya p.
1 篇 lingaraj n.
1 篇 rajesh kanna s.k...
1 篇 sriharish j.
1 篇 karthika r. a.
1 篇 chandrasekaran m...
1 篇 saravanamanikand...
1 篇 sethuramalingam ...
1 篇 parvathavarthini...
1 篇 sivasankar p.

语言

3 篇 英文

检索条件"主题词=Selective Breeding algorithm"

共 3 条记录，以下是1-10 订阅

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

详细简洁

排序：

Computational complexity analysis of selective breeding algorithm

Computational complexity analysis of selective breeding algo...

引用

International Conference on Computational Intelligence and Advanced Manufacturing Research (ICCIAMR)

作者： Chandrasekaran, M. Sriramya, P. Parvathavarthini, B. Saravanamanikandan, M. Vels Univ Madras Tamil Nadu India Saveetha Sch Engn Comp Sci & Engn Chennai Tamil Nadu India St Josephs Coll Engn Comp Applicat Chennai Tamil Nadu India MGR Univ Associate Prof Mech Engn Chennai Tamil Nadu India

ISBN: (纸本)9783038351788

In modern years, there has been growing importance in the design, analysis and to resolve extremely complex problems. Because of the complexity of problem variants and the difficult nature of the problems they deal with, it is arguably impracticable in the majority time to build appropriate guarantees about the number of fitness evaluations needed for an algorithm to and an optimal solution. In such situations, heuristic algorithms can solve approximate solutions;however suitable time and space complication take part an important role. In present, all recognized algorithms for NP-complete problems are requiring time that's exponential within the problem size. The acknowledged NP-hardness results imply that for several combinatorial optimization problems there are no efficient algorithms that realize a best resolution, or maybe a close to best resolution, on each instance. The study Computational Complexity Analysis of selective breeding algorithm involves both an algorithmic issue and a theoretical challenge and the excellence of a heuristic.

关键词： Computational Complexity NP-hard selective breeding algorithm

来源：评论

学校读者我要写书评

暂无评论

Solving Grid Scheduling Problems Using selective breeding algorithm 1st

Solving Grid Scheduling Problems Using Selective Breeding Al...

引用

1st International Conference on Sustainable Technologies for Computational Intelligence (ICTSCI)

作者： Sriramya, P. Karthika, R. A. Saveetha Inst Med & Tech Sci Saveetha Sch Engn Chennai Tamil Nadu India Vels Inst Sci Technol & Adv Studies Chennai Tamil Nadu India

ISBN: (纸本)9789811500299;9789811500282

Grid scheduling is characterized as the way toward settling on planning choices including resources over multiple administrative domains. This procedure can search through different administrative areas to utilize a particular machine or scheduling one job for exhausting various resources at a particular node or multiple nodes. From a grid point of view, a job is anything that needs a resource. The primary objective of grid is to give service with high dependability and minimal effort for substantial volumes of clients and support teamwork. In this paper, we consider a directed acyclic graph (DAG) with nodes and edges where the nodes are considered the task and the edges specify the order of execution of the tasks as a grid. This kind of problem is called the precedence-constrained problem. The selective breeding algorithm is an efficient algorithm to solve NP-hard problems. One such example of NP-hard problem is the precedence-constrained problem. So we consider SBA algorithm to solve precedence-constrained problems and found optimal solution of 13 units when compared with the traditional methods of 23 units. And it is also proved that the amount of waiting time is reduced greatly when compared to the traditional methods. So by implementing SBA for the grid scheduling problem more time is saved and is proved to be efficient.

关键词： selective breeding algorithm Precedence-constrained problem Grid scheduling Directed acyclic graph

来源：评论

学校读者我要写书评

暂无评论

Experimental Investigation and Optimization of Process Parameters in EDM of Aluminum Metal Matrix Composites Using selective breeding algorithm 1

引用

International Virtual Conference on Emerging Trends in Design, Manufacturing, Materials and Thermal Sciences, ETDMMT 2020

作者： Rajesh Kanna, S.K. Sethuramalingam, P. Lingaraj, N. Sivasankar, P. Sriharish, J. Rajalakashmi Institute of Technology Chennai India

ISBN: (数字)9789813364288

ISBN: (纸本)9789813364271

In the digital manufacturing era, to forbid the challenges and complexity in manufacturing of the geometrically complicated shapes or machining the harder materials or precise cutting of materials, electrical discharge machining has been used by the manufacturing sectors. The output performance of the electric discharge machining depends on its input process parameter values. So in this current research, these input parameters such as supply current, pulse on time and pulse off time have been considered and optimized its value for achieving higher material removal rate, enhanced surface roughness and lesser tool wear rate for Al6061 SiC stir casted metal matrix composites using selective breeding algorithm. selective breeding algorithm is applied to optimize the said multiple performance characteristics. This experimental research revealed that current value is having major influence over the output performance parameter. © 2021, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

关键词： Al6061 Electrical discharge machining Metal matrix composite selective breeding algorithm

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共1页 << < 1 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：