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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

262 篇 期刊文献
168 篇 会议
6 篇 学位论文

馆藏范围

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

日期分布

学科分类号

395 篇 工学
- 313 篇 计算机科学与技术...
- 100 篇 电气工程
- 54 篇 控制科学与工程
- 37 篇 软件工程
- 29 篇 信息与通信工程
- 27 篇 机械工程
- 7 篇 电子科学与技术（可...
- 4 篇 石油与天然气工程
- 4 篇 交通运输工程
- 3 篇 仪器科学与技术
- 3 篇 材料科学与工程（可...
- 3 篇 土木工程
- 2 篇 力学（可授工学、理...
- 2 篇 光学工程
- 2 篇 化学工程与技术
- 2 篇 安全科学与工程
114 篇 管理学
- 114 篇 管理科学与工程(可...
- 8 篇 工商管理
- 2 篇 公共管理
62 篇 理学
- 37 篇 数学
- 17 篇 生物学
- 5 篇 物理学
- 3 篇 化学
10 篇 经济学
- 9 篇 应用经济学
- 1 篇 理论经济学
6 篇 医学
- 3 篇 基础医学(可授医学...
- 3 篇 临床医学
3 篇 农学
- 2 篇 作物学
2 篇 法学
- 1 篇 法学
- 1 篇 社会学

主题

436 篇 estimation of di...
25 篇 probability mode...
25 篇 optimization
25 篇 evolutionary alg...
23 篇 genetic algorith...
21 篇 multi-objective ...
17 篇 differential evo...
15 篇 evolutionary com...
13 篇 multiobjective o...
12 篇 eda
11 篇 local search
11 篇 bayesian network
9 篇 genetic algorith...
9 篇 scheduling
8 篇 probabilistic mo...
8 篇 makespan
8 篇 global optimizat...
7 篇 hybrid algorithm
7 篇 restricted boltz...
6 篇 genetic programm...

机构

15 篇 tsinghua univ de...
9 篇 tsinghua univ de...
8 篇 kunming univ sci...
7 篇 natl univ singap...
6 篇 kunming univ sci...
4 篇 kunming univ sci...
4 篇 tsinghua univ de...
4 篇 lanzhou univ tec...
3 篇 univ sci & techn...
3 篇 beijing inst tec...
3 篇 univ essex dept ...
3 篇 univ birmingham ...
3 篇 wuhan univ state...
3 篇 china univ min &...
3 篇 univ hyderabad s...
3 篇 liaocheng univ s...
3 篇 univ politecn ma...
3 篇 shandong normal ...
3 篇 natl chiao tung ...
3 篇 lanzhou univ tec...

作者

36 篇 wang ling
15 篇 santana roberto
12 篇 xu ye
11 篇 larranaga pedro
10 篇 bielza concha
9 篇 hu rong
9 篇 liu min
9 篇 qian bin
9 篇 wang shengyao
8 篇 lozano jose a.
7 篇 zhao fuqing
7 篇 zhang zi-qi
7 篇 mendiburu alexan...
7 篇 hernandez-aguirr...
7 篇 zhou aimin
6 篇 perez-rodriguez ...
5 篇 dozier gerry
5 篇 chaurasia sachch...
5 篇 pan quan-ke
5 篇 wang sheng-yao

语言

412 篇 英文
19 篇 其他
3 篇 中文
2 篇 西班牙文
1 篇 德文
1 篇 法文

检索条件"主题词=Estimation of distribution algorithm"

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

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

详细简洁

排序：

Evolutionary Approaches to Optimization Problems in Chimera Topologies 16

Evolutionary Approaches to Optimization Problems in Chimera ...

引用

Genetic and Evolutionary Computation Conference (GECCO)

作者： Santana, Roberto Zhu, Zheng Katzgraber, Helmut Univ Basque Country UPV EHU San Sebastian Spain Texas A&M Univ College Stn TX USA

ISBN: (纸本)9781450342063

Chimera graphs define the topology of one of the first commercially available quantum computers. A variety of optimization problems have been mapped to this topology to evaluate the behavior of quantum enhanced optimization heuristics in relation to other optimizers, being able to efficiently solve problems classically to use them as benchmarks for quantum machines. In this paper we investigate for the first time the use of Evolutionary algorithms (EAs) on Ising spin glass instances defined on the Chimera topology. Three genetic algorithms (GAs) and three estimation of distribution algorithms (EDAs) are evaluated over 1000 hard instances of the Ising spin glass constructed from Sidon sets. We focus on determining whether the information about the topology of the graph can be used to improve the results of EAs and on identifying the characteristics of the Ising instances that influence the success rate of GAs and EDAs.

关键词： quantum computing Ising model estimation of distribution algorithm genetic algorithms instance analysis

来源：评论

学校读者我要写书评

暂无评论

Analysing a Hybrid Model-Based Evolutionary algorithm for a Hard Grouping Problem 16th

引用

16th International Conference on Computer Aided Systems Theory (EUROCAST)

作者： Raggl, Sebastian Beham, Andreas Wagner, Stefan Affenzeller, Michael Univ Appl Sci Upper Austria Heurist & Evolutionary Algorithms Lab Softwarepk 11 A-4232 Hagenberg Austria

ISBN: (纸本)9783319747187;9783319747170

We present a new hybrid model-based algorithm called Memetic Path Relinking (MemPR). MemPR incorporates ideas of memetic, evolutionary, model-based algorithms and path relinking. It uses different operators that compete to fill a small population of high quality solutions. We present a new hard grouping problem derived from a real world transport lot building problem. In order to better understand the algorithm as well as the problem we analyse the impact of the different operators on solution quality and which operators perform best at which stage of optimisation. Finally we compare MemPR to other state-of-the-art algorithms and find that MemPR outperforms them on real-world problem instances.

关键词： Hybrid algorithm Memetic algorithm estimation of distribution algorithm Grouping problem

来源：评论

学校读者我要写书评

暂无评论

Optimizing Permutation-Based Problems With a Discrete Vine-Copula as a Model for EDA 19

Optimizing Permutation-Based Problems With a Discrete Vine-C...

引用

Genetic and Evolutionary Computation Conference (GECCO)

作者： Cheriet, Abdelhakim Santana, Roberto Kasdi Merbah Univ Ouargla Algeria Univ Basque Country UPV EHU San Sebastian Spain

ISBN: (纸本)9781450367486

In this paper, we introduce a copula-based EDA that uses a Discrete Vine-Copula (DVC) model. This model is particularly suited to represent distributions in the permutation representation. To demonstrate the effectiveness of the proposed Discrete-Vine-Copula based EDAs (DVCEDA), we perform a set of experiments on instances of the known TSP problems. The results obtained are promising to extend the work on other class of problems.

关键词： Optimization permutation-based problem estimation of distribution algorithm copula vine-copula evolutionary algorithm

来源：评论

学校读者我要写书评

暂无评论

A Mathematical Analysis of EDAs with Distance-based Exponential Models 19

A Mathematical Analysis of EDAs with Distance-based Exponent...

引用

Genetic and Evolutionary Computation Conference (GECCO)

作者： Unanue, Imanol Merino, Maria Lozano, Jose A. Univ Basque Country UPV EHU Donostia San Sebastian Spain Univ Basque Country UPV EHU Leioa Spain Univ Basque Country Basque Ctr Appl Math BCAM UPV EHU Leioa Spain

ISBN: (纸本)9781450367486

estimation of distribution algorithms have been successfully used for solving many combinatorial optimization problems. One type of problems in which estimation of distribution algorithms have presented strong competitive results are permutation-based combinatorial optimization problems. In this case, the algorithms use probabilistic models specifically designed for codifying probability distributions over permutation spaces. One class of these probability models is distance-based exponential models, and one example of this class is the Mallows model. In spite of the practical success, the theoretical analysis of estimation of distribution algorithms for permutation-based combinatorial optimization problems has not been extensively developed. With this motivation, this paper presents a first mathematical analysis of the convergence behavior of estimation of distribution algorithms based on the Mallows model by using an infinite population to associate a dynamical system to the algorithm. Several scenarios, with different fitness functions and initial probability distributions of increasing complexity, are analyzed obtaining unexpected results in some cases.

关键词： estimation of distribution algorithm Permutation-based Combinatorial Optimization Problems Mathematical Modeling Theoretical Analysis Mallows model

来源：评论

学校读者我要写书评

暂无评论

A hybrid imperialist competitive algorithm for the outpatient scheduling problem with switching and preparation times 40

A hybrid imperialist competitive algorithm for the outpatien...

引用

40th Chinese Control Conference (CCC)

作者： Yu, Hui Li, Jun-qing Han, Yu-yan Sang, Hong-yan Shandong Normal Univ Sch Informat Sci & Engn Jinan 250014 Peoples R China Liaocheng Univ Sch Comp Liaocheng 252059 Shandong Peoples R China

ISBN: (纸本)9789881563804

In recent years, outpatient scheduling problem has attracted much attention. This paper considers the outpatient scheduling problem as an extension of the flexible job shop scheduling problem (FJSP), where the patient is considered as a job. Then, to solve the outpatient scheduling problem, a hybrid imperialist competitive algorithm (HICA) is proposed. In the proposed algorithm, the simulated annealing (SA) algorithm and estimation of distribution algorithm (EDA) are embedded to improve the quality of the solution. Furthermore, the two realistic constraints, i.e., switching time and preparation time of patients are also considered to make the problem closer to the reality. Finally, to verify the performance of the proposed HICA, different outpatient scheduling problem instances are randomly generated and used for simulation tests. Four efficient algorithms, including imperialist competitive algorithm (ICA), improved genetic algorithm (IGA), EDA, and modified artificial immune algorithm (MAIA), are selected for detailed comparisons. The simulation results confirm that the proposed algorithm can solve the outpatient scheduling problem with high efficiency.

关键词： Flexible job shop scheduling Outpatient scheduling Imperialist competition algorithm Simulated annealing algorithm estimation of distribution algorithm

来源：评论

学校读者我要写书评

暂无评论

Distance-Based Exponential Probability Models for Constrained Combinatorial Problems 18th

Distance-Based Exponential Probability Models for Constraine...

引用

18th Conference of the Spanish-Association-for-Artificial-Intelligence (CAEPIA)

作者： Ceberio, Josu Mendiburu, Alexander Lozano, Jose A. Univ Basque Country UPV EHU Paseo Manuel Lardizabal 1 Donostia San Sebastian 20018 Spain BCAM Alameda Mazarredo 14 Bilbao 48009 Spain

ISBN: (纸本)9783030003746;9783030003739

estimation of distribution algorithms (EDAs) have already demonstrated their utility when solving a broad range of combinatorial problems. However, there is still room for methodological improvement when approaching problems with constraints. The great majority of works in the literature implement repairing or penalty schemes, or use ad-hoc sampling methods in order to guarantee the feasibility of solutions. In any of the previous cases, the behavior of the EDA is somehow denaturalized, since the sampled set does not follow the probability distribution estimated at that step. In this work, we present a general method to approach constrained combinatorial optimization problems by means of EDAs. This consists of developing distance-based exponential probability models defined exclusively on the set of feasible solutions. In order to illustrate this procedure, we take the 2-partition balanced Graph Partitioning Problem as a case of study, and design efficient learning and sampling methods to use distance-based exponential probability models in EDAs.

关键词： Constraint estimation of distribution algorithm Distance-based exponential model Graph Partitioning Problem

来源：评论

学校读者我要写书评

暂无评论

Global Optimization with the Gaussian Polytree EDA

Global Optimization with the Gaussian Polytree EDA

引用

10th Mexican International Conference on Artificial Intelligence (MICAI 2011)

作者： Segovia Dominguez, Ignacio Hernandez Aguirre, Arturo Villa Diharce, Enrique Ctr Res Math Guanajuato Mexico

ISBN: (纸本)9783642253294;9783642253300

This paper introduces the Gaussian polytree estimation of distribution algorithm, a new construction method, and its application to estimation of distribution algorithms in continuous variables. The variables are assumed to be Gaussian. The construction of the tree and the edges orientation algorithm are based on information theoretic concepts such as mutual information and conditional mutual information. The proposed Gaussian polytree estimation of distribution algorithm is applied to a set of benchmark functions. The experimental results show that the approach is robust, comparisons are provided.

关键词： Polytrees estimation of distribution algorithm Optimization

来源：评论

学校读者我要写书评

暂无评论

Power Aware Data Center Placement in WDM Optical Networks 18

Power Aware Data Center Placement in WDM Optical Networks

引用

IEEE 18th Annual Consumer Communications and Networking Conference (CCNC)

作者： Zeb, Sanwal Ahmad, Arsalan Ahmed, Ashfaq Bianco, Andrea NUST Sch Elect Engn & Comp Sci SEECS Islamabad Pakistan Khalifa Univ Dept Elect Engn & Comp Sci Abu Dhabi U Arab Emirates Politecn Torino Dept Elect & Telecommun Turin Italy

ISBN: (纸本)9781728197944

Due to the increasing trend in IP traffic, the placement of Data Centers (DCs) at network nodes has become a hot research topic. A proper DCs placement translates in reduced power consumption of overall network. The paper scope is to find the best placement of "k" DCs nodes out of "N" total nodes to reduce power consumption. To solve the problem, we propose two heuristics: EoDCP, based on estimation of distribution algorithm (EDA), and MaxN-MinL. An exhaustive search based ESDCP algorithm is used as a lower bound to compare the performance of EoDCP and MaxN-MinL. Moreover, electronic traffic grooming technique is employed to further reduce the total network power consumption. A 20-Node Random network and a 17-Node German network are used to perform comparison of proposed heuristics. Performance of EoDCP algorithm is far better than those of MaxN-MinL, and is similar to the optimal solution obtained via ESDCP. Finally, using electronic traffic grooming improves power savings up-to 15% in the two considered topologies.

关键词： Data Center placement estimation of distribution algorithm Traffic Grooming

来源：评论

学校读者我要写书评

暂无评论

Probabilistic model-building genetic algorithms 08

Probabilistic model-building genetic algorithms

引用

10th Annual Genetic and Evolutionary Computation Conference, GECCO 2008

作者： Pelikan, Martin Dept. of Math and Computer Science University of Missouri St. Louis United States

ISBN: (纸本)9781605581309

Probabilistic model-building algorithms (PMBGAs) replace traditional variation of genetic and evolutionary algorithms by (1) building a probabilistic model of promising solutions and (2) sampling the built model to generate new candidate solutions. PMBGAs are also known as estimation of distribution algorithms (EDAs) and iterated density-estimation algorithms (IDEAs).Replacing traditional crossover and mutation operators by building and sampling a probabilistic model of promising solutions enables the use of machine learning techniques for automatic discovery of problem regularities and exploitation of these regularities for effective exploration of the search space. Using machine learning in optimization enables the design of optimization techniques that can automatically adapt to the given problem. There are many successful applications of PMBGAs, for example, Ising spin glasses in 2D and 3D, graph partitioning, MAXSAT, feature subset selection, forest management, groundwater remediation design, telecommunication network design, antenna design, and *** tutorial Probabilistic Model-Building GAs will provide a gentle introduction to PMBGAs with an overview of major research directions in this area. Strengths and weaknesses of different PMBGAs will be discussed and suggestions will be provided to help practitioners to choose the best PMBGA for their problem.

关键词： optimization probabilistic model estimation of distribution algorithm machine learning genetic algorithm pmbga eda probabilistic model-building genetic algorithm evolutionary computation

来源：评论

学校读者我要写书评

暂无评论

Evolution Strategies with an RBM-Based Meta-Model

Evolution Strategies with an RBM-Based Meta-Model

引用

13th Pacific Rim Knowledge Acquisition Workshop (PKAW)

作者： Makukhin, Kirill Univ Queensland Brisbane Qld Australia

ISBN: (纸本)9783319133324;9783319133317

Evolution strategies have been demonstrated to offer a state-of-theart performance on different optimisation problems. The efficiency of the algorithm largely depends on its ability to build an adequate meta-model of the function being optimised. This paper proposes a novel algorithm RBM-ES that utilises a computationally efficient restricted Boltzmann machine for maintaining the meta-model. We demonstrate that our algorithm is able to adapt its model to complex multidimensional landscapes. Furthermore, we compare the proposed algorithm to state-of the art algorithms such as CMA-ES on different tasks and demonstrate that the RBM-ES can achieve good performance.

关键词： evolution strategies restricted Boltzmann machine meta-model surrogate model estimation of distribution algorithm

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：