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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

162 篇 期刊文献
144 篇 会议
1 篇 学位论文

馆藏范围

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

日期分布

学科分类号

276 篇 工学
- 158 篇 计算机科学与技术...
- 70 篇 电气工程
- 58 篇 控制科学与工程
- 37 篇 信息与通信工程
- 35 篇 软件工程
- 34 篇 机械工程
- 20 篇 材料科学与工程（可...
- 16 篇 仪器科学与技术
- 13 篇 土木工程
- 12 篇 电子科学与技术（可...
- 10 篇 交通运输工程
- 7 篇 力学（可授工学、理...
- 5 篇 建筑学
- 5 篇 石油与天然气工程
- 4 篇 环境科学与工程（可...
- 4 篇 网络空间安全
- 3 篇 测绘科学与技术
- 3 篇 船舶与海洋工程
- 3 篇 核科学与技术
57 篇 管理学
- 55 篇 管理科学与工程(可...
- 3 篇 图书情报与档案管...
42 篇 理学
- 19 篇 数学
- 10 篇 生物学
- 9 篇 物理学
- 6 篇 化学
- 2 篇 地球物理学
7 篇 教育学
- 5 篇 教育学
- 2 篇 心理学(可授教育学...
4 篇 经济学
- 2 篇 理论经济学
3 篇 农学
3 篇 医学
- 3 篇 临床医学
2 篇 法学
1 篇 文学

主题

307 篇 ant colony optim...
27 篇 path planning
24 篇 genetic algorith...
8 篇 ant colony optim...
7 篇 particle swarm o...
6 篇 traveling salesm...
6 篇 optimization
6 篇 mobile robot
6 篇 artificial intel...
6 篇 feature selectio...
6 篇 cloud computing
5 篇 multi-objective ...
5 篇 load balancing
5 篇 artificial bee c...
5 篇 data mining
5 篇 combinatorial op...
5 篇 scheduling
4 篇 primary-backup a...
4 篇 pid controller
4 篇 heuristic based ...

机构

4 篇 hefei univ techn...
3 篇 chongqing techno...
3 篇 nanyang technol ...
3 篇 northeastern uni...
3 篇 new jersey inst ...
3 篇 anhui univ sch c...
3 篇 univ hong kong f...
2 篇 natl cheng kung ...
2 篇 shanghai jiao to...
2 篇 changshu inst te...
2 篇 southwest jiaoto...
2 篇 dalian jiaotong ...
2 篇 univ hyderabad s...
2 篇 minist educ key ...
2 篇 tamkang univ dep...
2 篇 yonsei univ dept...
2 篇 shandong xiehe c...
2 篇 northwestern pol...
2 篇 silesian tech un...
2 篇 natl tsing hua u...

作者

5 篇 xiao wensheng
5 篇 wu lei
4 篇 jia zhao-hong
4 篇 yang jia
4 篇 xu qiang
4 篇 liu chao
4 篇 li kai
3 篇 afshar m. h.
3 篇 li lin-lin
3 篇 xu yaping
3 篇 wang deliang
3 篇 slota damian
3 篇 zheng yaqian
3 篇 li yanyan
3 篇 huang xiaodong
2 篇 leite walter l.
2 篇 shaofei zang
2 篇 cui junguo
2 篇 xu benlian
2 篇 moon byungin

语言

286 篇 英文
14 篇 其他
6 篇 中文

检索条件"主题词=Ant colony optimization Algorithm"

共 307 条记录，以下是161-170 订阅

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

详细简洁

排序：

An Improved ant colony optimization for VRP with Time Windows

An Improved Ant Colony Optimization for VRP with Time Window...

引用

International Conference on Information Technology and Management Innovation (ICITMI2012)

作者： Yu, Su-Ping Li, Ya-Ping Luoyang Inst Sci & Technol Comp & Informat Engn Dept Luoyang Peoples R China

ISBN: (纸本)9783037855744

The Vehicle Routing Problem (VRP) is an important problem occurring in many distribution systems, which is also defined as a family of different versions such as the Capacitated Vehicle Routing Problem (CVRP) and the Vehicle Routing Problem with Time Windows (VRPTW). The ant colony optimization (ACO) is a metaheuristic for combinatorial optimization problems. Given the ACO inadequacy, the vehicle routing optimization model is improved and the transfer of the algorithm in corresponding rules and the trajectory updated regulations is reset in this paper, which is called the Improved ant colony optimization (I-ACO). Compared to the calculated results with genetic algorithm (GA) and particle swarm optimization (PSO), the correctness of the model and algorithm is verified. Experimental results show that the I-ACO can quickly and effectively obtain the optimal solution of VRFTW.

关键词： Vehicle Routing Problem With Time Windows ant colony optimization algorithm Evenness of Solution ant Attracion

来源：评论

学校读者我要写书评

暂无评论

Web Spam Detection using Link-based ant colony optimization

Web Spam Detection using Link-based Ant Colony Optimization

引用

26th IEEE International Conference on Advanced Information Networking and Applications (AINA)

作者： Taweesiriwate, Apichat Manaskasemsak, Bundit Rungsawang, Arnon Kasetsart Univ Fac Engn Dept Comp Engn Mass Informat & Knowledge Engn Lab Bangkok 10900 Thailand

ISBN: (纸本)9780769546513

Web spam is one of the most important problems which degrade quality and efficiency of web search engines. In this paper, we present a novel link-based ant colony optimization learning algorithm for spam host detection. The host graph is first constructed by aggregating pages' hyperlink structure. Following the TrustRank assumption, ants start walking from a normal host and randomly follow host links with a probability distribution. Then, the classification rules are appropriately generated according to common features of normal hosts sequentially discovered by ants. From the experiments with the WEBSPAM-UK2006 dataset, the proposed learning model provides much accuracy in classifying both normal and spam hosts than several baselines, including a state of the art C4.5. Moreover, we also provide an analysis in parameter tuning for better results.

关键词： link spam content spam web spam spam detection ant colony optimization algorithm web link structure

来源：评论

学校读者我要写书评

暂无评论

Comparison of ant colony optimization and Artificial Bee colony algorithms for Solving Electronic Support Search Dwell Scheduling Problem 15

Comparison of Ant Colony Optimization and Artificial Bee Col...

引用

15th Turkish National Software Engineering Symposium (UYMS)

作者： Erkut, Okan Hardalac, Firat ASELSAN AS Facil Radar & Elect Warfare Syst Ankara Turkey Gazi Univ Dept Elect Elect Engn Ankara Turkey

ISBN: (纸本)9781665410700

Electronic support search dwell scheduling is a combinatorial optimization problem which appears when the dwells overlapping on frequency domain are assigned to different receivers and required to be executed simultaneously by the receivers that are on a single electronic support platform. Overlapping the dwells on time domain provides sensor fusion ability and improves the detection performance of the system against target radar systems. In this paper, dwell sets of the receivers are scheduled to solve electronic support search dwell scheduling problem with two meta-heuristic swarm intelligence algorithms: ant colony algorithm and Artificial Bee colony algorithm. Simulation results show that while both algorithms are capable of solving the problem, ant colony algorithm provides a solution roughly 43% faster with a limit on number of iterations and Artificial Bee colony algorithm provides roughly 30% quicker and 26% more consistent solution with a limit on maximum acceptable cost.

关键词： ant colony optimization algorithm Artificial Bee colony algorithm Combinatorial optimization Electronic Support Scheduling

来源：评论

学校读者我要写书评

暂无评论

Traffic Flow Prediction Using SVR-ant colony optimization: A Practical Case of Tehran Highway

Traffic Flow Prediction Using SVR-Ant Colony Optimization: A...

引用

IEEE International Conference in Power Engineering Application (ICPEA)

作者： Zeynal, Hossein Zakaria, Zuhaina Kor, Ahmad Tehran Farayand Dena Engn Co Elect Engn Dept Tehran Iran Univ Teknol MARA UiTM Fac Elect Engn Shah Alam Selangor Malaysia Kharazm Power Engineers Co Engn Design Dept Tehran Iran

ISBN: (纸本)9781728185460

Traffic estimation is one of the most important issues in traffic control parlances. In this work, an integrated approach is proposed, which is a combination of three algorithms including K-means clustering, Support Vector Regression (SVR) and ant colony optimization (ACO) approach. Using the K-means clustering algorithm allows obtaining optimal values for SVR via ACO algorithm and then employ it to predict traffic flow. To carry out simulations, two realistic cases of traffic flow prediction for Tehran-Karaj and Tehran-Damavand highways is investigated at two checkpoints in the morning and afternoon periods. Further, to evaluate the quality of solutions obtained from the proposed method, a time series model was used to end comparisons. Based on the results, the NRMSE forecast error for the proposed method presents less as opposed to well-known SARIMA method for morning and evening periods. Therefore, the proposed method outperforms SARIMA in terms of prediction error;that is by 0.26 versus 0.31 and 0.11 versus 0.18 for Tehran-Karaj highway during the morning and evening intervals. According to the results for two main highways, the proposed method exhibits its suitability for practical application in traffic prediction with accurate solution and simplicity of application in real cases.

关键词： Traffic estimation Support Vector Regression ant colony optimization algorithm K-means algorithm SARIMA method

来源：评论

学校读者我要写书评

暂无评论

SAR Image Ship Detection Based on ant colony optimization

SAR Image Ship Detection Based on Ant Colony Optimization

引用

5th International Congress on Image and Signal Processing (CISP)

作者： Li, Lin-lin Wang, Ji-kui Shandong Xiehe Coll Sch Mech & Elect Engn Jinan Peoples R China

ISBN: (纸本)9781467309646

Edge detection is an important method of extracting image edge, which occupies an important position in ship detection. In this article, ant colony optimization algorithm is adopted, which adjusts threshold on edge detection dynamically. By the contrast analysis with traditional edge detection operators and WT method, ant colony optimization algorithm can reduce the detection computing time and cost greatly, extracts the ship targets in SAR images effectively, keeps the ship structure completely, and ensures accuracy of the test results. ant colony optimization algorithm has a lot of advantages in dealing with image edge detection and so on discrete optimization problems, which has very broad prospects in image processing.

关键词： ant colony algorithm ant colony optimization algorithm edge detection ship detection

来源：评论

学校读者我要写书评

暂无评论

Hybrid Quantum Approximate optimization Using Enhanced ant colony optimization to Solve Large-Scale Combinatorial optimization Problems 8

Hybrid Quantum Approximate Optimization Using Enhanced Ant C...

引用

8th International Conference on Soft Computing & Machine Intelligence (ISCMI)

作者： Ghimire, Bishad Mahmood, Ausif Elleithy, Khaled Univ Bridgeport Comp Sci & Engn Bridgeport CT 06604 USA

ISBN: (纸本)9781728186832

Quantum computing is a promising technology that may provide breakthrough solutions to today's difficult problems such as breaking encryption and solving large-scale combinatorial optimization problems. A class of algorithms referred to as Quantum Approximate optimization algorithm (QAOA) have been recently proposed. QAOA attempts to approximately solve hard problems using a protocol know as bang-bang. The technique is based on the unitary evolution using a Hamiltonian encoding of the objective function of the combinatorial optimization problem. QAOA has been explored in the context of several optimization problems such as Max-Cut problem, variational Eigenvalue problem etc. Recently, attempts have been made to create QAOA for the Traveling Salesman Problem (TSP). Due to small node size and limited solution capability of the currently available Quantum computers and/or simulators, we develop a hybrid approach where subgraphs of a TSP tour are executed on a Quantum computer and the results from the quantum optimization are combined in further optimization of the whole tour. Since the local optimization of a subgraph is prone to getting stuck in a local minima, we overcome this problem by using a parallel ant colony optimization algorithm with periodic pheromone exchange between colonies. Our results are encouraging and yield optimum results for benchmarks with less than 50 nodes, and usually within 1% of the optimal solution for benchmarks with around 200 nodes.

关键词： quantum algorithm quantum approximate optimization algorithm combinatorial optimization problem ant colony optimization algorithm

来源：评论

学校读者我要写书评

暂无评论

An Adaptive ant colony optimization in Knowledge Graphs 11

An Adaptive Ant Colony Optimization in Knowledge Graphs

引用

11th IEEE International Conference on Knowledge Graph (IEEE ICKG)

作者： Li, Wei Xia, Le Huang, Ying Jiangxi Univ Sci & Technol Sch Informat Engn Ganzhou Peoples R China Gannan Normal Univ Inst Math & Comp Sci Ganzhou Peoples R China

ISBN: (纸本)9781728181561

Knowledge graphs have been widely used in various fields such as question answering systems and recommendation systems. However, there are few researchers on combinatorial optimization problems based on knowledge graphs, which greatly delays the development of knowledge graphs. Also, when solving combinatorial optimization problems only by using knowledge graphs, it is impossible to obtain better results. In order to solve these problems, an ant colony optimization algorithm based on an adaptive strategy (AACO) is proposed, and the algorithm is applied to solve the path optimization model established by the knowledge graph. In the vector space based on knowledge graph embedding, the ant colony optimization algorithm has a good positive feedback mechanism and robustness to find effective paths between entity nodes. Experimental results show that this proposed AACO algorithm can accelerate the convergence speed and obtain better accuracy. At the same time, a global optimal solution can be achieved, which is suitable for solving combinatorial optimization problems.

关键词： knowledge graph ant colony optimization algorithm adaptive strategy combinatorial optimization problems

来源：评论

学校读者我要写书评

暂无评论

An Approach to Feature Selection Based on ant colony optimization and Rough Set

An Approach to Feature Selection Based on Ant Colony Optimiz...

引用

International Conference on Intelligent Computing and Information Science

作者： Wu, Junyun Qiu, Taorong Wang, Lu Huang, Haiquan Nanchang Univ Dept Comp Nanchang 330031 Jiangxi Peoples R China

ISBN: (纸本)9783642181283

Feature selection plays an important role in many fields. This paper proposes a method for feature selection which combined the rough set method and ant colony optimization algorithm. The algorithm used the attribute dependence and the attribute importance as the inspiration factor which applied to the transfer rules. For further, the quality of classification based on rough set method and the length of the feature subset were used to build the pheromone update strategy. Through the test of data set, results show that the proposed method is feasible.

关键词： Feature selection ant colony optimization algorithm Rough set

来源：评论

学校读者我要写书评

暂无评论

VS-TACO: A Tuned Version of ant colony optimization for Generating Variable Strength Interaction in T-Way Testing Strategy 2022

VS-TACO: A Tuned Version of Ant Colony Optimization for Gene...

引用

11th International Conference on Software and Computer Applications, ICSCA 2022

作者： Zahir Ahmad, Mohd Zamri Othman, Rozmie Razif Ramli, Nuraminah Rashid Ali, Mohd Shaiful Aziz Faculty of Electronic Engineering Technology Universiti Malaysia Perlis Arau Perlis02600 Malaysia

ISBN: (纸本)9781450385770

Ever since, software technologies have been through a rapid evolution. In a real application, the interaction between input variables may vary, thus the exhaustive testing is no longer practical since it is time-consuming and lead to combinatorial explosion. One of the strategies that able to cater fault due to the interaction is ant colony optimization (ACO) algorithm. Typically, amount of ants in the ACO algorithm is fixed at certain number while the search space technique (i.e. to explore or exploit new possible solutions) is randomized for each iteration in the entire algorithm, are potentially affect the optimization's efficiency. Thus this paper proposes a new variant of ACO algorithm called as a tuned version of ACO for generating variable strength interaction in t-way testing strategy (VS-TACO). VS-TACO applied a Mamdani fuzzy logic in order to dynamically choose the number of ant and decide which search space technique to be used. Experiments that have been conducted on VS-TACO and benchmarked with other strategies, shows VS-TACO produce a competitive result in term of test suite size. © 2022 ACM.

关键词： t-way testing ant colony optimization algorithm variable strength interaction testing

来源：评论

学校读者我要写书评

暂无评论

ant colony Based on Cat Swarm optimization and Application in Picking Robot Path Planning 7

Ant Colony Based on Cat Swarm Optimization and Application i...

引用

7th IEEE International Conference on Software Engineering and Service Science (ICSESS)

作者： Xun, Yanqin Liu, Mingshan Zhou, Yuan Wang, Rui Zhang, Wenbo Jilin Univ Coll Commun Engn Changchun Jilin Province Peoples R China

ISBN: (纸本)9781467399043

In view of solving multi-objective path planning in the static environment, there are some faults for ant colony optimization(ACO), such as the long computation and easy to fall into local optimum. To solve these problems, the ACO based on cat swarm optimization (CSO) algorithm searching model (CSOACO) is presented. In this algorithm, the introduction of CSO algorithm search pattern realizes the local search in the current solution for ant colony individuals, which not only enrich the diversity of solution, but improve the accuracy of the algorithm. Finally, the new algorithm is simulated in MATLAB for picking robot multi-objective path planning problem. Through the simulation analysis, not only set the parameters, but compare CSOACO with other algorithms. Simulation results show that the algorithm can accelerate the convergence speed, search to the global optimal solution and realize the multi-objective path planning of picking robot.

关键词： ant colony optimization algorithm cat swarm optimization algorithm picking robot path planning

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共31页 << < 13 14 15 16 17 18 19 20 21 22 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：