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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

172 篇 期刊文献
84 篇 会议
10 篇 学位论文
1 册 图书
1 件 标准

馆藏范围

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

日期分布

学科分类号

215 篇 工学
- 148 篇 计算机科学与技术...
- 62 篇 电气工程
- 40 篇 软件工程
- 20 篇 控制科学与工程
- 18 篇 信息与通信工程
- 8 篇 机械工程
- 6 篇 仪器科学与技术
- 6 篇 化学工程与技术
- 5 篇 电子科学与技术（可...
- 4 篇 材料科学与工程（可...
- 4 篇 测绘科学与技术
- 3 篇 土木工程
- 3 篇 网络空间安全
- 2 篇 力学（可授工学、理...
- 2 篇 光学工程
- 2 篇 生物医学工程（可授...
74 篇 理学
- 35 篇 数学
- 17 篇 生物学
- 12 篇 物理学
- 9 篇 化学
- 6 篇 统计学（可授理学、...
- 2 篇 地球物理学
35 篇 管理学
- 30 篇 管理科学与工程(可...
- 5 篇 工商管理
8 篇 医学
- 4 篇 临床医学
- 3 篇 基础医学(可授医学...
- 3 篇 公共卫生与预防医...
5 篇 文学
4 篇 经济学
- 4 篇 应用经济学
4 篇 教育学
- 3 篇 教育学
3 篇 农学
2 篇 法学
- 2 篇 社会学
1 篇 哲学

主题

268 篇 search algorithm...
14 篇 optimization
11 篇 genetic algorith...
9 篇 search problems
8 篇 path planning
8 篇 artificial intel...
8 篇 information retr...
5 篇 mass spectrometr...
4 篇 multi-objective ...
4 篇 simulation
4 篇 algorithms
4 篇 combinatorial op...
4 篇 genetic algorith...
4 篇 satisfiability
3 篇 random search
3 篇 complex networks
3 篇 markov chains
3 篇 performance
3 篇 parallelism
3 篇 hyper-heuristics

机构

5 篇 simula res lab o...
3 篇 univ oslo dept i...
3 篇 univ oslo oslo
3 篇 brno university ...
3 篇 simula res lab c...
2 篇 pacific nw natl ...
2 篇 univ trent dept ...
2 篇 usaf inst techno...
2 篇 cent michigan un...
2 篇 univ patras dept...
2 篇 singapore manage...
2 篇 cisco syst oslo
2 篇 mondragon uniber...
2 篇 univ st andrews ...
2 篇 georgetown univ ...
2 篇 carleton univ de...
2 篇 mit 77 massachus...
2 篇 univ paderborn d...
2 篇 beihang univ sch...
2 篇 weizmann inst sc...

作者

9 篇 ali shaukat
7 篇 wang shuai
6 篇 yue tao
4 篇 grivokostopoulou...
4 篇 hatzilygeroudis ...
3 篇 liaaen marius
3 篇 korman amos
3 篇 perikos isidoros
3 篇 wurll c
3 篇 henrich d
2 篇 kharoufeh jeffre...
2 篇 peleg david
2 篇 wilson wilf a.
2 篇 weatherred dylan
2 篇 sheppard daniel
2 篇 koskelo nicholas
2 篇 qu rong
2 篇 brown ca
2 篇 gotlieb arnaud
2 篇 sagardui goiuria

语言

250 篇 英文
15 篇 其他
2 篇 中文
1 篇 德文
1 篇 法文
1 篇 荷兰文
1 篇 土耳其文

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

共 268 条记录，以下是11-20 订阅

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

详细简洁

排序：

An Educational Game for Teaching search algorithms 8

An Educational Game for Teaching Search Algorithms

引用

8th International Conference on Computer Supported Education (CSEDU)

作者： Grivokostopoulou, Foteini Perikos, Isidoros Hatzilygeroudis, Ioannis Univ Patras Dept Comp Engn & Informat Patras Greece

ISBN: (纸本)9789897581793

search algorithms constitute an important topic in the Artificial Intelligence curriculum and are acknowledged by most tutors to be a hard and complex domain for teachers to teach and students to deeply understand. In this paper, we present an educational computer game, designed to teach search algorithms, based on the popular Pacman game. The purpose of the educational Pacman game is to assist students to understand the artificial intelligence topic of search algorithms in an entertaining, interactive and motivating way. During their experience with the game, students can examine the behaviour of various search algorithms and a graphical annotated depiction of them through suitable visualizations. Visualizations can demonstrate the operational functionality of algorithms and are designed in line with the principles of student's active learning. Various learning activities were designed and request students to apply specific search algorithms in various example cases with or without the assistance and feedback of the game. An evaluation study was conducted in real classroom conditions and revealed quite satisfactory results. The results indicate that the educational Pacman game is an effective way to enhance students' engagement and help them to deeper understand the AI search algorithms.

关键词： Educational Game Gabe-based Learning search algorithms Algorithm Visualization Pacman Game Learning Efficiency

来源：评论

学校读者我要写书评

暂无评论

Semi-Automatic Generation of Interactive Exercises Related to search algorithms 10

Semi-Automatic Generation of Interactive Exercises Related t...

引用

10th International Conference on Computer Science and Education (ICCSE)

作者： Grivokostopoulou, Foteini Hatzilygeroudis, Ioannis Univ Patras Sch Engn Dept Comp Engn & Informat Patras Hellas Greece

ISBN: (纸本)9781479966004

We have developed and use in our Department the Artificial Intelligence Teaching System (AITS). AITS is an adaptive and intelligent tutoring system that teaches AI aspects and uses AI techniques for personalized learning and assessment of the students. In this paper, we present the way that AITS can help students in learning search algorithms and the learning approaches and activities it offers. Also, we present a tool developed to assist tutors to create exercises in a semi- automatic way. It is an assistant tool to be embedded into the AITS system that produces different types of interactive exercises related to AI search algorithms. The tool takes as input a number of parameters regarding the desired exercise and it creates semiautomatically the interactive exercise based on the corresponding parameters. The tool aims at helping tutors in creating and updating the teaching material. Results gathered from an evaluation study are quite promising.

关键词： Artificial Intelligence Teaching search algorithms Heuristic algorithms Automatic Exercise Generation

来源：评论

学校读者我要写书评

暂无评论

Mobile Robot Platform for Real-Time search algorithms

Mobile Robot Platform for Real-Time Search Algorithms

引用

20th International Conference on Mixed Design of Integrated Circuits and Systems (MIXDES 2013)

作者： Pochmara, Janusz Grygiel, Wojciech Koppa, Radoslaw Kaminski, Krzysztof Poznan Univ Tech Chair Comp Engn Poznan Poznan Poland Poznan Univ Tech Poznan Poland

ISBN: (纸本)9788363578015

In our investigation we focus on the A* Algorithm, for solving path-finding problems, because it is fairly flexible and can be used in a wide range of contexts. The main problem of A* Algorithm is the finite computer memory. Using this method, the robot can decide how to move from end to end point in an efficient manner without colliding with previously mapped obstacles. When in need of finding a path on considerably large map, computer has to remember a complex list of examined and open nodes, which can occupy most of free space in computer memory. Nonetheless, this solution shows the best results and it is worth analyzing as the algorithm for the intelligent robot movements.

关键词： search algorithms astar path finding

来源：评论

学校读者我要写书评

暂无评论

Examining the Efficiency of Feedback Types in a Virtual Reality Educational Environment for Learning search algorithms 1

引用

1st International Conference on Brain Function Assessment in Learning (BFAL)

作者： Grivokostopoulou, Foteini Perikos, Isidoros Hatzilygeroudis, Ioannis Univ Patras Dept Comp Engn & Informat Patras Greece Technol Educ Inst Western Greece Patras Greece

ISBN: (数字)9783319676159

ISBN: (纸本)9783319676159;9783319676142

Feedback constitutes a fundamental aspect of educational systems that has a substantial impact on students learning and can shape their mental models. The delivery of appropriate feedback in terms of time and content is crucial for facilitating students' knowledge construction and comprehension. In this paper, we examine the complex nature and the efficiency of feedback in the context of a virtual reality educational environment. More specifically, we study the effect that different types of feedback such as feedback with visualized animations of procedures, can have on students learning and knowledge construction in a virtual reality educational environment for learning blind and heuristic search algorithms. An experimental study was designed where participating students were engaged with learning activities and solved exercises in different feedback conditions. Results from the study indicate that visual types of feedback can have a substantial impact on students' learning, assisting them in better understanding the functionality of the process studied with respect to performance and mistakes.

关键词： Feedback Efficiency 3D Virtual World Learning Analytics search algorithms

来源：评论

学校读者我要写书评

暂无评论

Quantum Computer search algorithms: Can We Outperform the Classical search algorithms? 4th

Quantum Computer Search Algorithms: Can We Outperform the Cl...

引用

Future Technologies Conference (FTC)

作者： Leider, Avery Siddiqui, Sadida Sabol, Daniel A. Tappert, Charles C. Pace Univ Seidenberg Sch Comp Sci & Informat Syst Pleasantville NY 10570 USA

ISBN: (纸本)9783030325206;9783030325190

Quantum Computers are not limited to just two states. Qubits, the basic unit of quantum computing have the power to exist in more than one state at a time. While the classical computers only perform operations by manipulation of classical bits having two values 0 and 1, quantum bits can represent data in multiple states. This property of inheriting multiple states at a time is called superposition which gives quantum computers tremendous power over classical computers. With this power, the algorithms designed on quantum computers to solve search queries can yield result significantly faster than the classical algorithms. There are four types of problems that exist: Polynomial (P), Non-Deterministic Polynomial (NP), Non-Deterministic Polynomial Complete (NP-complete) and Non-Deterministic Polynomial hard (NP-hard). P problems can be solved in the polynomial amount of time like searching a database for an item. However, when the size of the search space grows, it becomes difficult to compute solutions even for P problems. Quantum algorithms like Grover's algorithm has reduced the tvime complexity of some of the classical algorithm problems from N to root N. Variants of Grover's algorithm like Quantum Partial search propose changes that yield not exact but closer results in time even lesser than Grover's algorithm. NP problems are the problems whose solution if known can be verified in polynomial amount time. Factorization of prime numbers which is considered to be an NP problem took an exponential amount of time when solved using the classical computer while the Shor's quantum computing algorithm computes it in polynomial time. Factorization is also a class of bounded-error quantum polynomial time (BQP) problems which are decision problems solved by quantum computers in polynomial time. There are problems to which if a solution is found can solve every problem Of NP class, these are NP-complete problems. The power of Qubits could be exploited in the future to come up

关键词： Qubit Superposition search algorithms Grover's algorithms Quantum computing Shor's algorithm

来源：评论

学校读者我要写书评

暂无评论

The Impact of search algorithms in Automated Program Repair

The Impact of Search Algorithms in Automated Program Repair

引用

International Conference on Soft Computing and Software Engineering (SCSE)

作者： Assiri, Fatmah Yousef Bieman, James M. Colorado State Univ Dept Comp Sci Ft Collins CO 80523 USA

Automated program repair (APR) techniques locate and fix faults automatically. In order to fix faults, APR applies a set of program modification operators (PMOs) to modify faulty programs. A potential repair is found when APR applies a PMO that fixes a fault. A brute-force search algorithm applies all PMOs in a predefined order until a potential repair is found. Brute-force can guarantee a fix but lowers APR performance, especially when it uses many PMOs. Stochastic search algorithms, such as a genetic algorithm, efficiently search the modifications space for a PMO that fixes a fault. In this paper, we conduct a comprehensive evaluation of the impact on APR effectiveness, APR performance, and the quality of potential repairs of three stochastic search algorithms:(1) a genetic algorithm (GA), (2) a genetic algorithm without a crossover operator (GAWoCross), and (3) a random search (RS). Our evaluation using 41 faulty versions of six different C programs shows that RS improves APR effectiveness and performance, but GA and GAWoCross improve the quality of potential repairs by generating more validated repairs, and potential repairs that failed fewer regression tests compared to RS. (C) 2015 Published by Elsevier B.V.

关键词： automated program repair search algorithms genetic algorithm random search effectiveness performance repair quality

来源：评论

学校读者我要写书评

暂无评论

Efficient search algorithms implementation for SAR image analysis 11

Efficient search algorithms implementation for SAR image ana...

引用

11th Conference on Grid, Cloud and High Performance Computing in Science (ROLCG)

作者： Belean, Bogdan Carata, Serban Vasile Ghenescu, Marian INCDTIM Ctr Adv Res & Technol Alternat Energies Cluj Napoca Romania UTI Grup Inst Space Sci Bucharest Romania

ISBN: (纸本)9781538670422

Earth Observation (EO) through remote sensing satellites gathers reliable information about the environment. The evolution of satellite instrumentation leads to considerable satellite data volumes which require on one hand, mathematically and statistically based algorithms to extract valuable information and, on the other hand, increased computational power for processing. The paper proposes image processing algorithms for Synthetic Aperture Radar (SAR) images together with application-specific hardware architectures for satellite imagery. It is well known that performing feature extraction in image analysis involves complex search algorithms implementation. A novel approach based on content-addressable memories (CAM) for search algorithms optimization is proposed. Results in terms of computational time are presented for the proposed approach and compared with classical image processing search algorithms implementations.

关键词： satellite imagery search algorithms content addressable memories hardware implementation

来源：评论

学校读者我要写书评

暂无评论

Hybrid search algorithms for P2P media streaming distribution in ad hoc networks

Hybrid search algorithms for P2P media streaming distributio...

引用

7th International Conference on Computational Science (ICCS 2007)

作者： Zuo, Dong-hong Du, Xu Yang, Zong-kai Huazhong Univ Sci & Technol Dept Elect & Informat Engn Wuhan 430074 Peoples R China

ISBN: (纸本)9783540725893

Media streaming delivery in wireless ad hoc networks is challenging due to the stringent resource restrictions, potential high loss rate and the decentralized architecture. To support long and high-quality streams, one viable approach is that a media stream is partitioned into segments, and then the segments are replicated in a network and served in a peer-to-peer fashion, however, the searching strategy for segments is one key problem with the approach. This paper proposes a hybrid ant-inspired search algorithm (HASA) for P2P media streaming distribution in Ad Hoc networks. It takes the advantages of random walkers and ant-inspired algorithms for search in unstructured P2P networks, such as low transmitting latency and less redundant query messages. We quantify the performance of our scheme in terms of response time and network query messages for media streaming distribution. Simulation results show that it can effectively improve the search Efficiency for P2P media streaming distribution in Ad Hoc networks.

关键词： ad hoc networks media streaming distribution search algorithms peer to peer

来源：评论

学校读者我要写书评

暂无评论

Comparison of search algorithms and Heuristic Methods in the Solution of Chess Endgame Problems 24

Comparison of Search Algorithms and Heuristic Methods in the...

引用

24th Signal Processing and Communication Application Conference (SIU)

作者： Cesmeli, Melike Siseci Pence, Ihsan Cetisli, Bayram Mehmet Akif Ersoy Univ Burdur Turkey Suleyman Demirel Univ Bilgisayar Muhendisligi Bolumu Isparta Turkey

ISBN: (纸本)9781509016792

Although chess seems like a simple game, considering the quick learning of movements of the chess pieces and other rules, when a solution space is formed for movement possibilities by speculating future movements, complexity and strategic aspects of the game can be better understood. In this study, heuristic methods are utilized in order to search for deeper solutions in the chess game. This way, a person's or standard search algorithms' difficulty in scanning through movements which could amount to millions is tried to be surpassed by heuristic methods. Heuristic methods, rather than scanning the whole space, focus on promising areas and look for the best solution. The results gained from experimental studies reveal the possibility of making a deeper search, while emphasizing the advantages of using heuristic methods as a searching method in chess.

关键词： chess game search algorithms heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

Test Case Prioritization of Configurable Cyber-Physical Systems with Weight-Based search algorithms 16

Test Case Prioritization of Configurable Cyber-Physical Syst...

引用

Genetic and Evolutionary Computation Conference (GECCO)

作者： Arrieta, Aitor Wang, Shuai Sagardui, Goiuria Etxeberria, Leire Mondragon Unibertsitatea Arrasate Mondragon Spain Simula Res Lab Certus Software V&V Ctr Oslo Norway

ISBN: (纸本)9781450342063

Cyber-Physical Systems (CPSs) can be found in many sectors (e.g., automotive and aerospace). These systems are usually configurable to give solutions based on different needs. The variability of these systems is large, which implies they can be set into millions of configurations. As a result, different testing processes are needed to efficiently test these systems: the appropriate configurations must be selected and relevant test cases for each configuration must be chosen as well as prioritized. Prioritizing the order in which the test cases are executed reduces the time for detecting faults in these kinds of systems. However, the test suite size is often large and exploring all the possible test case orders is infeasible. search algorithms can help find optimal solutions from a large solution space. This paper presents an approach based on weight-based search algorithms for prioritizing the test cases for configurable CPSs. We empirically evaluate the performance of the following algorithms with two case studies: Weight-Based Genetic algorithms, Random Weighted Genetic algorithms, Greedy, Alternating Variable Method and Random search (RS). Our results suggest that all the search algorithms outperform RS, which is taken as a baseline. Local search algorithms have shown better performance than global search algorithms.

关键词： Test Case Prioritization search algorithms Configurable Cyber-Physical Systems Testing

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共27页 << < 1 2 3 4 5 6 7 8 9 10 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：