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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

122 篇 期刊文献
54 篇 会议
1 篇 学位论文

馆藏范围

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

日期分布

学科分类号

151 篇 工学
- 85 篇 计算机科学与技术...
- 41 篇 电气工程
- 39 篇 信息与通信工程
- 23 篇 软件工程
- 22 篇 电子科学与技术（可...
- 14 篇 控制科学与工程
- 8 篇 仪器科学与技术
- 7 篇 机械工程
- 3 篇 光学工程
- 3 篇 材料科学与工程（可...
- 2 篇 力学（可授工学、理...
- 2 篇 网络空间安全
- 1 篇 动力工程及工程热...
- 1 篇 测绘科学与技术
- 1 篇 化学工程与技术
- 1 篇 石油与天然气工程
63 篇 理学
- 43 篇 数学
- 12 篇 物理学
- 7 篇 统计学（可授理学、...
- 5 篇 生物学
- 2 篇 化学
- 1 篇 地理学
- 1 篇 地球物理学
27 篇 管理学
- 26 篇 管理科学与工程(可...
- 3 篇 工商管理
6 篇 教育学
- 5 篇 心理学(可授教育学...
- 1 篇 教育学
3 篇 经济学
- 3 篇 应用经济学
3 篇 医学
- 3 篇 临床医学
1 篇 法学
- 1 篇 法学
1 篇 农学

主题

177 篇 algorithm comple...
6 篇 optimization
6 篇 algorithm design
6 篇 complexité algor...
5 篇 algorithm
5 篇 dynamic programm...
4 篇 computational co...
4 篇 transformation f...
4 篇 adaptive algorit...
4 篇 infimal convolut...
4 篇 scheduling
3 篇 geometric algori...
3 篇 signal detection
3 篇 discrete fourier...
3 篇 line clipping
3 篇 computer graphic...
3 篇 comparative stud...
3 篇 digital simulati...
3 篇 graph theory
3 篇 resource allocat...

机构

2 篇 victoria univ sc...
2 篇 kanazawa univ fa...
2 篇 univ west bohemi...
2 篇 univ oviedo dept...
2 篇 univ toyama fac ...
2 篇 nanyang technol ...
2 篇 univ oviedo dept...
2 篇 synopsys inc. 70...
2 篇 jiangsu agrianim...
2 篇 lulea univ techn...
2 篇 northeastern uni...
2 篇 chinese acad sci...
2 篇 1.département sy...
1 篇 univ elect sci &...
1 篇 univ estadual ca...
1 篇 xidian univ sch ...
1 篇 saarland univ sa...
1 篇 igit dept elect ...
1 篇 commun univ chin...
1 篇 guangdong tech c...

作者

4 篇 ruiz m. m.
4 篇 suarez p. m.
4 篇 skala v
4 篇 day whe
4 篇 bayon l.
3 篇 qian jin
3 篇 skala vaclav
2 篇 tasis c.
2 篇 bui dh
2 篇 huang guangyan
2 篇 zhang yanchun
2 篇 lunkovskiy mikha...
2 篇 grau j. m.
2 篇 kahraman hamdi t...
2 篇 battail g
2 篇 chen jingsen
2 篇 kameda t
2 篇 zabinsky zb
2 篇 feng yi
2 篇 todo yuki

语言

166 篇 英文
7 篇 其他
2 篇 中文
1 篇 俄文

检索条件"主题词=Algorithm complexity"

共 177 条记录，以下是141-150 订阅

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

详细简洁

排序：

Hybrid Pre-judging Fix-LLL Lattice Reduction algorithm for MIMO Detection 3

Hybrid Pre-judging Fix-LLL Lattice Reduction Algorithm for M...

引用

3rd International Conference on Information Science and Control Engineering (ICISCE)

作者： Liu, Simeng Yu, Ying Lv, Huazhang Commun Univ China Sch Informat Engn Beijing Peoples R China

ISBN: (纸本)9781509025350

Lenstra-Lenstra-Lovasz (LLL) is an effective lattice reduction algorithm in multi-input-multi-output (MIMO) system. Its modified version Fix Lenstra-Lenstra-Lovasz (FLLL) algorithm uses fix method to substitute round method in original LLL algorithm in processing the parameter aiming to largely reduce the algorithm complexity. However, with the number of antennas and iteration times increasing, performance of F-LLL gradually becomes unsatisfactory. It will cause much performance loss especially in large MIMO system. In this paper, a novel hybrid algorithm which inserts a pre-judging procedure and combines both fix method and round method is proposed. The pre-judging procedure firstly searches all the size reduction pairs to calculate all the possible values. Then analyze these values by making histogram. Fitting curve of this histogram will be presented as Gaussian distribution that mean value and standard deviation will be determined. The iteration criterion is settled equals to standard deviation. Hybrid F-LLL algorithm makes a better trade-off between algorithm complexity and performance. Also it can solve the problem of large performance loss in F-LLL.

关键词： F-LLL algorithm lattice reduction algorithm complexity MIMO system

来源：评论

学校读者我要写书评

暂无评论

Compressed Topology Tomography in Sensor Networks

Compressed Topology Tomography in Sensor Networks

引用

IEEE Wireless Communications and Networking Conference (WCNC)

作者： Liang, Yao Liu, Rui Indiana Univ Purdue Univ Indianapolis Dept Comp & Informat Sci Indiana PA 15705 USA

ISBN: (纸本)9781467359399;9781467359382

Wireless sensor network (WSN) topology tomography is essential for routing improvement, topology control, anomaly detection and load balance. Previous studies on WSN topology tomography are restricted to static routing tree estimation, which is unrealistic in real-world WSNs due to wireless channel dynamics. We study general WSN routing topology tomography from indirect measurements observed at the sink, where routing structure is dynamic. We formulate the problem as a novel compressed sensing problem, and present our decoding algorithm. We provide rigorous complexity analyses of our algorithm. Thorough simulations validate the effectiveness of our approach and algorithm.

关键词： network tomography wireless sensor networks compressed sensing algorithm complexity

来源：评论

学校读者我要写书评

暂无评论

A New Highly Efficient Preprocessing algorithm for Convex Hull, Maximum Distance and Minimal Bounding Circle in E²: Efficiency Analysis 24th

A New Highly Efficient Preprocessing Algorithm for Convex Hu...

引用

24th International Conference on Computational Science (ICCS)

作者： Skala, Vaclav Univ West Bohemia Fac Appl Sci Dept Comp Sci & Engn CZ-30100 Plzen Czech Republic

ISBN: (纸本)9783031637582;9783031637599

This contribution describes an efficient and simple preprocessing algorithm for finding a convex hull, maximum distance of points or convex hull diameter, and the smallest enclosing circle in E-2. The proposed algorithm is convenient for large data sets with unknown intervals and ranges of the data sets. It is based on efficient preprocessing, which significantly reduces points used in final processing by standard available algorithms.

关键词： Preprocessing maximum distance smallest enclosing circle smallest enclosing ball algorithm complexity preprocessing convex hull convex hull diameter

来源：评论

学校读者我要写书评

暂无评论

Effects of channel SNR in Mobile Cognitive Radios and Coexisting Deployment of Cognitive Wireless Sensor Networks

Effects of channel SNR in Mobile Cognitive Radios and Coexis...

引用

IEEE 29th International Performance Computing and Communications Conference

作者： Iyer, Vasanth Iyengar, S. Sitharama Murthy, Garmiela Rama Parameswaran, N. Singh, Dhananjay Srinivas, Mandalika B. Int Inst Informat Technol Hyderabad 500032 Andhra Pradesh India Louisiana State Univ Baton Rouge LA 70803 USA Brila Inst Technol & Sci Hyderabad 500078 Andhra Pradesh India Natl Inst Math Sci NIMS Daejeon 305390 South Korea Univ New South Wales Sydney NSW 2052 Australia

ISBN: (纸本)9781424493289

In this paper, we describe the cognitive radios sharing the spectrum with licensed users and its effects on operational coexistence with unlicensed users. Due to the unlicensed spectrum band growing needs and usage by many IEEE 802.11 protocols, normal wireless radio operation sees high interference leading to high error rates on operational environments. We study the licensed bands and the characteristics of the unlicensed bands in general and more specific to radio characterization of individual radios and cognitive deployment of sensor networks and its effect on lifetime. The cognitive radio signals detection algorithm for this probabilistic model for the unlicensed users, uses a mobility model which takes into account the threshold variable ratio Eb/No and also calculates the lower-bound of the combined value of secondary user interference for overlapping frequencies with the primary user. By using simulation, we detect the primary user when the radio frequencies are known a priori and compare it when the frequencies are unknown. In our analysis we exploit the similarity measure seen at each sub-channel frequency, which are due to multiple paths of the same reflected signal by maximizing the correlated information of the correlation matrix. For the general case the co-variance matrix for blind source separation, we use ICA de-correlation methods and show that cognitive radio can efficiently identify users in complex situations. The effects of large deployment and cognitive sensor network are studied for a family of 802.15.4 radios adapting to power-aware algorithms.

关键词： algorithm complexity SDR and Cognitive Radios Power Aware Radios Cognitive Wireless Sensor Network Covariance Matrix PCA ICA

来源：评论

学校读者我要写书评

暂无评论

Approximate the Clique-Width of a Graph Using Shortest Paths 20th

Approximate the Clique-Width of a Graph Using Shortest Paths

引用

20th Mexican International Conference on Artificial Intelligence (MICAI)

作者： Leonardo Gonzalez-Ruiz, J. Raymundo Marcial-Romero, J. Hernandez, J. A. De-Ita, Guillermo Univ Autonoma Estado Mexico Fac Ingn Cerro Coatepec S-NCiudad Univ Toluca 50100 Mexico Benemerita Univ Autonoma Puebla 4 Sur 104 Ctr Hist Puebla 72000 Mexico

ISBN: (纸本)9783030898205;9783030898199

In this paper, we present an algorithm to approximate the clique-width of a graph. The proposed approach is based on computing the shortest paths between pairs of vertices. We experimentally show that our proposal approximates the clique-width of simple graphs in polynomial time, while other methods that calculate it in an exact way, transform the problem to SAT, that is well-known as NP-Complete.

关键词： Graph theory Clique-width algorithm complexity

来源：评论

学校读者我要写书评

暂无评论

UAV Task Allocation Method Using Swarm Intelligence Optimization algorithm 15th

UAV Task Allocation Method Using Swarm Intelligence Optimiza...

引用

15th China Conference on Wireless Sensor Networks (CWSN)

作者： Shi, Jiaqi Tan, Li Lian, Xiaofeng Xu, Tianying Zhang, Hongtao Beijing Technol & Business Univ Sch Comp Sci & Engn Beijing 100048 Peoples R China Beijing Technol & Business Univ Sch Artificial Intelligence Beijing 100048 Peoples R China

ISBN: (纸本)9789811681745;9789811681738

The multi-unmanned aerial vehicle (UAV) task allocation method has shortcomings such as long flight distance and long algorithm initialization time. In response to these problems, this paper proposes a UAV task allocation method based on Swarm Intelligence Optimization algorithm (SIOA). The algorithm first compares the relationship between the number of UAVs and mission points when UAV is performing a task, and then introduces the idea of gradient descent to reduce the flying distance of UAV. Experimental results show that the SIOA method can effectively reduce the initialization time, shorten search distance of the UAV and the time UAV complete the task, and effectively solve the problem of high algorithm complexity.

关键词： Task allocation Swarm intelligence optimization algorithm algorithm complexity Initialization time Gradient descent

来源：评论

学校读者我要写书评

暂无评论

THE CHOICE OF PARAMETERS IN ARC LENGTH algorithm

THE CHOICE OF PARAMETERS IN ARC LENGTH ALGORITHM

引用

International Conference on Apperceiving Computing and Intelligence Analysis

作者： Nie, Xiao-Wen Lu, Xian-Liang Xu, Hai-Mei Peng, Yong-Xiang Univ Elect Sci & Technol China Sch Engn & Comp Sci Chengdu 610054 Peoples R China

ISBN: (纸本)9781424434275

To improve the efficiency of the Arc Length (AL) algorithm, the paper presents a quantitative method to choose the parameters of AL. The paper analyzes the condition to guarantee the correctness of AL, and gives the approaches to set the parameters. Moreover, the latency of AL under the new method is discussed in detailed. The analysis and simulation shows that the latency of AL with the parameters chosen under the new method remains constant, while is not increasing as the size of network grows.

关键词： Distributed hash table (DHT) random sampling algorithm complexity

来源：评论

学校读者我要写书评

暂无评论

Wireless Power Transference Services Opportunistic Transactions in Improper Comparison Services

Wireless Power Transference Services Opportunistic Transacti...

引用

2023 International Conference on Power Energy, Environment and Intelligent Control, PEEIC 2023

作者： Singh, Vivek Mohan, Chandra Singh Karla, Jasmeet Kumar, V. Mathan Subha, E. Patil, Milind S. School of Media Film & Television Studies Iimt University Meerut India School of Basic & Applied Sciences K. R. Mangalam University Department of Chemistry Haryana Gurugram122103 India School of Management & Commerce Dev Bhoomi Uttarakhand University Uttarakhand 248007 India Karpagam Academy of Higher Education Department of Commerce Coimbatore641021 India Karpagam College of Engineering Department of Science and Humanities Coimbatore641032 India Vishwakarma Institute of Information Technology EnTC Pune India

ISBN: (纸本)9798350357769

IA is a potential method for wireless interference control. difficulties, however. Due to the innate characteristic and channel fading, a reduction in is one of the most difficult problems. Wireless networks may benefit from recent advancements like better. In this post, we cover some recent studies on wireless based networks. Moreover, based on we provide transmission mechanism. To compare the effectiveness of various systems, simulation results are given. Finally, a summary of the techniques for reducing algorithm complexity is provided. © 2023 IEEE.

关键词： algorithm complexity Antenna selection Channel fading Cognitive radio Interference alignment Multiuser diversity Opportunistic transactions Simulation results Transmission mechanism Wireless interference control Wireless networks Wireless power transfer

来源：评论

学校读者我要写书评

暂无评论

Comparative analysis of the KL-UCB and UCB algorithms:Delving into complexity and performance

Comparative analysis of the KL-UCB and UCB algorithms:Delvin...

引用

作者： Chenyue Wu School of Information Science and Technology School of Cyber Security Guangdong University of Foreign Studies

This paper embarks on a meticulous comparative exploration of two venerable algorithms often invoked in multi-armed bandit problems: the Kullback-Leibler Upper Confidence Bound(KL-UCB) and the generic Upper Confidence Bound(UCB) ***, a comprehensive discourse is presented, elucidating the definition, evolution, and realworld applications of both algorithms. The crux of the study then shifts to a side-by-side comparison, weighing the regret performance and time complexities when applied to a quintessential movie rating dataset. In the trenches of practical implementations, addressing multi-armed bandit problems invariably demands extensive training. Consequently, even seemingly minor variations in algorithmic complexity can usher in pronounced differences in computational durations and resource utilization. This inherent intricacy prompts introspection:Is the potency of a given algorithm in addressing diverse practical quandaries commensurate with its inherent complexity. By juxtaposing the KL-UCB and UCB algorithms, this study not only highlights their relative merits and demerits but also furnishes insights that could serve as catalysts for further refinement and optimization. The overarching aim is to cultivate an informed perspective, guiding practitioners in choosing or fine-tuning algorithms tailored to specific applications without incurring undue computational overheads.

关键词： Multi-armed bandit algorithm Comparison algorithm complexity regret performance algorithm improvements

来源：评论

学校读者我要写书评

暂无评论

Algoritmy třídění

Algoritmy třídění

引用

作者： Lýsek, Jiří Brno University of Technology

Práce se zabývá problémem třídění polí, který patří mezi známé problémy informatiky. Definuje pojmy třídění, algoritmus a složitost algoritmů. Po... 详细信息

Práce se zabývá problémem třídění polí, který patří mezi známé problémy informatiky. Definuje pojmy třídění, algoritmus a složitost algoritmů. Popisuje vybrané algoritmy pro třídění od nejjednodušších po vybrané složitější konstrukce. Nakonec jsou algoritmy porovnány v závislosti na počtu operací a době trvání celého procesu.

关键词： algoritmus třídění složitost algoritmů bublinové třídění třídění vkládáním třídění výběrem Shellovo třídění třídění haldou rychlé třídění algorithm sorting algorithm complexity bubblesort insertionsort selectionsort shellsort heapsort qui

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共18页 << < 9 10 11 12 13 14 15 16 17 18 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：