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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

1,451 篇 期刊文献
1,156 篇 会议
3 篇 学位论文

馆藏范围

2,610 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

2,094 篇 工学
- 1,529 篇 计算机科学与技术...
- 692 篇 电气工程
- 577 篇 软件工程
- 306 篇 信息与通信工程
- 291 篇 控制科学与工程
- 102 篇 石油与天然气工程
- 56 篇 仪器科学与技术
- 47 篇 动力工程及工程热...
- 43 篇 机械工程
- 40 篇 航空宇航科学与技...
- 39 篇 电子科学与技术（可...
- 34 篇 土木工程
- 34 篇 交通运输工程
- 28 篇 建筑学
- 22 篇 网络空间安全
- 19 篇 力学（可授工学、理...
- 19 篇 测绘科学与技术
- 10 篇 材料科学与工程（可...
- 10 篇 环境科学与工程（可...
703 篇 理学
- 617 篇 数学
- 106 篇 统计学（可授理学、...
- 81 篇 系统科学
- 32 篇 物理学
- 21 篇 化学
- 20 篇 生物学
208 篇 管理学
- 130 篇 管理科学与工程(可...
- 82 篇 图书情报与档案管...
- 30 篇 工商管理
20 篇 经济学
- 19 篇 应用经济学
11 篇 法学
- 9 篇 社会学
10 篇 医学
2 篇 文学
2 篇 艺术学
1 篇 教育学
1 篇 农学
1 篇 军事学

主题

2,610 篇 consensus algori...
417 篇 blockchain
187 篇 blockchains
142 篇 security
128 篇 scalability
102 篇 heuristic algori...
99 篇 convergence
87 篇 fault tolerant s...
86 篇 throughput
85 篇 fault tolerance
85 篇 multi-agent syst...
79 篇 privacy
76 篇 microgrids
75 篇 consensus protoc...
74 篇 distributed cont...
73 篇 internet of thin...
73 篇 peer-to-peer com...
71 篇 protocols
66 篇 topology
62 篇 delays

机构

9 篇 xidian univ sch ...
8 篇 southeast univ s...
8 篇 google research ...
7 篇 columbia univers...
7 篇 aalborg univ dep...
7 篇 mit united state...
7 篇 shanghai jiao to...
6 篇 beihang univ sch...
6 篇 carnegie mellon ...
6 篇 southeast univ s...
6 篇 university of to...
5 篇 shanghai univ sc...
5 篇 beijing inst tec...
5 篇 shandong univ sc...
5 篇 school of mathem...
5 篇 nanyang technol ...
5 篇 north china elec...
5 篇 dalian maritime ...
5 篇 qufu normal univ...
4 篇 massachusetts in...

作者

13 篇 guerrero josep m...
12 篇 li junmin
8 篇 chen jiaxi
7 篇 dragicevic tomis...
7 篇 du yuhua
7 篇 chow mo-yuen
7 篇 kim hak-man
7 篇 schulz christian
6 篇 ding zhengtao
6 篇 li jinsha
6 篇 meng lexuan
6 篇 wen guanghui
6 篇 wang jianan
6 篇 burgos-mellado c...
6 篇 hadjicostis chri...
5 篇 fischer nick
5 篇 chae kijoon
5 篇 wang jing
5 篇 fu xiang
5 篇 zhang qinjin

语言

2,204 篇 英文
397 篇 其他
9 篇 中文
2 篇 斯洛文尼亚文

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

共 2610 条记录，以下是1001-1010 订阅

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

详细简洁

排序：

Active Ranking and Matchmaking, with Perfect Matchings 41

Active Ranking and Matchmaking, with Perfect Matchings

引用

41st International Conference on Machine Learning, ICML 2024

作者： El Ferchichi, Hafedh Lerasle, Matthieu Perchet, Vianney CREST ENSAE IP Paris France FAIRPLAY Joint Team France Criteo AI Lab

We address the challenge of actively ranking a set of items/players with varying values/strengths. The comparison outcomes are random, with a greater noise the closer the values. A crucial requirement is that, at each iteration of the algorithm, all items must be compared once, i.e., an iteration is a perfect matching. Furthermore, we presume that comparing two players with closely matched strengths incurs no cost and, in contrast, a unit cost is associated with comparing players whose strength difference is more substantial. Our secondary objective is to determine an optimal matching between players based on this cost function: we propose and analyze an algorithm that draws on concepts from both AKS sorting networks and bandit theory. Our algorithm achieves both objectives with high probability, and the total cost is optimal (up to logarithmic terms). Copyright 2024 by the author(s)

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Research on Travel Route Planing Problems Based on Greedy algorithm 4

Research on Travel Route Planing Problems Based on Greedy Al...

引用

4th International Conference on Electronic Information Engineering and Computer Science, EIECS 2024

作者： Wang, Guanjie Wang, Yiquan Li, Wei School of Computer and Artificial Intelligence Huaihua University Huaihua China College of Mathematics and System Science Xinjiang University Urumqi China

ISBN: (纸本)9798331531409

The greedy algorithm based route planning problem is a method of finding the optimal or near optimal route between a given starting and ending point. This article first uses PCA method to reduce the dimensionality of urban evaluation indicators, extracts key principal components, and KMO and TOPSIS algorithms to reduce the dimensionality of the data. Secondly, for datasets that have not passed the KMO test, a comprehensive evaluation will be conducted using the entropy weight method and TOPSIS method. Finally, based on the greedy algorithm, a route planning algorithm was proposed and optimized to provide personalized route customization according to the different needs of tourists. We also took into account the local travel efficiency, the time required to visit tourist attractions, and necessary daily rest time to reduce costs and avoid falling into the local optimal solution. © 2024 IEEE.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Pruned Pivot: Correlation Clustering algorithm for Dynamic, Parallel, and Local Computation Models 41

Pruned Pivot: Correlation Clustering Algorithm for Dynamic, ...

引用

41st International Conference on Machine Learning, ICML 2024

作者： Dalirrooyfard, Mina Makarychev, Konstantin Mitrović, Slobodan Morgan Stanley United States Department of Computer Science Northwestern University Evanston United States Department of Computer Science UC Davis Davis United States

Given a graph with positive and negative edge labels, the correlation clustering problem aims to cluster the nodes so to minimize the total number of between-cluster positive and within-cluster negative edges. This problem has many applications in data mining, particularly in unsupervised learning. Inspired by the prevalence of large graphs and constantly changing data in modern applications, we study correlation clustering in dynamic, parallel (MPC), and local computation (LCA) settings. We design an approach that improves state-of-the-art runtime complexities in all these settings. In particular, we provide the first fully dynamic algorithm that runs in an expected amortized constant time, without any dependence on the graph size. Moreover, our algorithm essentially matches the approximation guarantee of the celebrated PIVOT algorithm. Copyright 2024 by the author(s)

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Application Mathematics Universal Method Based on UniLM and Word Vector Adjustment algorithm 1

Application Mathematics Universal Method Based on UniLM and ...

引用

1st International Conference on Software, Systems and Information Technology, SSITCON 2024

作者： Shi, Guiping Shandong Vocational College of Science and Technology Weifang China

ISBN: (纸本)9798350352931

This study proposes a universal solution based on UniLM (Unified Language Model) and word vector adjustment algorithm to address the high computational complexity and poor model generalization ability of traditional methods in solving applied mathematical problems. Firstly, utilizing UniLM's multitasking capabilities to handle complex language structures enhances the model's understanding of mathematical problems. Next, the word vector adjustment algorithm is introduced to dynamically reinforce mathematical terms, in order to improve the model's ability to accurately capture key mathematical concepts. In addition, the data has been standardized, including tagging and feature extraction, to ensure that the model can efficiently process input data. The experimental results show that the accuracy of this method is significantly improved on different types of mathematical problems, with accuracy rates of 9 5. 2 %and 9 0. 5 %for addition and subtraction problems, respectively. At the same time, it has high computational efficiency and generalization ability, indicating that the proposed method has obvious advantages in solving mathematical problems and is expected to provide new solutions and practical references for this field. © 2024 IEEE.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Development of a Legal Document Recognition algorithm for the Karakalpak Language

Development of a Legal Document Recognition Algorithm for th...

引用

2024 IEEE International Multi-Conference on Engineering, Computer and Information Sciences, SIBIRCON 2024

作者： Mengliev, Davlatyor B. Barakhnin, Vladimir B. Eshkulov, Mukhriddin O. Allamov, Oybek T. Ibragimov, Bahodir B. Khudaybergenov, Timur A. Novosibirsk State University Novosibirsk Russia Urgench branch of Tashkent University of Information Technologies named after Muhammad al-Khwarizmi Urgench Uzbekistan Federal Research Center for Information and Computational Technologies Novosibirsk Russia Jizzakh polytechnic institute Jizzakh Uzbekistan Urgench State University Urgench Uzbekistan

ISBN: (纸本)9798331532024

In this study, the authors propose an algorithm for recognizing legal documents in Karakalpak texts. To develop such an algorithm, similar scientific works were studied, the relevance of the current work and the problems that need to be solved were identified. The proposed algorithm is developed based on traditional rules, which include the rules of morphology of the Karakalpak language, as well as a dictionary of tagged words used to identify legal words and phrases from texts. The dictionary used contains more than 12,000 tagged words, which include both word roots and other forms concatenated to grammatical affixes. The authors also tested the algorithm, where high accuracy in identifying the necessary words was achieved. In particular, three samples were formed, each of which contained words and phrases of legal terminology in a certain amount. In conclusion, the authors added information regarding the proposed improvements and further prospects for the development of the algorithm. © 2024 IEEE.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

The Canadian Traveller Problem on Outerplanar Graphs 49

The Canadian Traveller Problem on Outerplanar Graphs

引用

49th International Symposium on Mathematical Foundations of Computer Science, MFCS 2024

作者： Beaudou, Laurent Bergé, Pierre Chernyshev, Vsevolod Dailly, Antoine Gerard, Yan Lagoutte, Aurélie Limouzy, Vincent Pastor, Lucas Université Clermont-Auvergne CNRS Mines de Saint-Etienne Clermont-Auvergne-INP LIMOS Clermont-Ferrand63000 France Univ. Grenoble Alpes CNRS Grenoble INP G-SCOP Grenoble38000 France

ISBN: (纸本)9783959773355

We study the k-Canadian Traveller Problem, where a weighted graph G = (V, E, ω) with a source s ∈ V and a target t ∈ V are given. This problem also has a hidden input E∗ ⊊ E of cardinality at most k representing blocked edges. The objective is to travel from s to t with the minimum distance. At the beginning of the walk, the blockages E∗ are unknown: the traveller discovers that an edge is blocked when visiting one of its endpoints. Online algorithms, also called strategies, have been proposed for this problem and assessed with the competitive ratio, i.e., the ratio between the distance actually traversed by the traveller divided by the distance he would have traversed knowing the blockages in advance. Even though the optimal competitive ratio is 2k + 1 even on unit-weighted planar graphs of treewidth 2, we design a polynomial-time strategy achieving competitive ratio 9 on unit-weighted outerplanar graphs. This value 9 also stands as a lower bound for this family of graphs as we prove that, for any Ε > 0, no strategy can achieve a competitive ratio 9 − Ε. Finally, we show that it is not possible to achieve a constant competitive ratio (independent of G and k) on weighted outerplanar graphs. © Laurent Beaudou, Pierre Bergé, Vsevolod Chernyshev, Antoine Dailly, Yan Gerard, Aurélie Lagoutte, Vincent Limouzy, and Lucas Pastor.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

A proximal bundle algorithm for solving generalized variational inequalities with inexact data

A proximal bundle algorithm for solving generalized variatio...

引用

2024 International Conference on Computational Modeling and Applied Mathematics - Chinese-Russian Conference on Differential Equations and Applications, CMAM 2024 and DEA 2024

作者： Zhang, Siqi Huang, Ming Feng, Yongxiu Lin, Sida Zhang, Yajing School of Science Dalian Maritime University Dalian116026 China Department of Applied Mathematics The Hong Kong Polytechnic University Kowloon Hong Kong

This paper proposes a proximal bundle algorithm based on the proximal point method for solving generalized variational inequalities with inexact data. First, the explanation of subgradient values and function inexactness is given. The algorithm's fundamental steps are then presented. Ultimately, the algorithm's convergence is confirmed under specific circumstances. © Published under licence by IOP Publishing Ltd.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

An Adaptive version of the Metropolis Adjusted Langengevin algorithm for Survival prediction in a high dimensional framework 3

An Adaptive version of the Metropolis Adjusted Langengevin A...

引用

3rd AIxIA Workshop on Artificial Intelligence For Healthcare, HC@AIxIA 2024

作者： Tinè, Gabriele Miceli, Rosalba Biostatistics for Clinical Research Unit Fondazione IRCCS Istituto Nazionale dei Tumori Milano Italy

The objective is to construct a prognostic index that incorporates radiomic information with the validated prognostic index (Sarculator) provided by the Fondazione IRCCS Istituto Nazionale dei Tumori di Milano. A Bayesian approach was employed, utilising a Weibull model. Vague prior distributions were elicited for the shape parameter, the intercept, and the Sarculator. A multivariate Gaussian prior was elicited for the 2, 144 radiomic parameters, incorporating a penalty factor, λ. A total of 100 penalty values were considered. A new, ad hoc adaptive version of the pre-conditioned Metropolis adjusted Langevin algorithm (A-MALA) was proposed for sampling. Bayesian Model Averaging (BMA) was employed to yield a composite of the 100 models. A Bayesian hypothesis test was constructed to evaluate the superiority of the BMA prognostic index relative to the Sarculator. The five-year AUC posterior mean was 0.809, with a 95% credible interval (CI) of (0.768, 0.851). The posterior mean of the C-index was 0.804 (95% CI, 0.764, 0.845) for the BMA, 0.743 (95% CI, 0.713, 0.771) for the best model log λ = 10.39 and 0.735 (95% CI, 0.674, 0.761) for the Sarculator. The results suggest that radiomic variables should be included in the model. © 2024 CEUR-WS. All rights reserved.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

algorithm for Local Extrema Seeking of Black-Box Functions Based on Information Landscape Measure

Algorithm for Local Extrema Seeking of Black-Box Functions B...

引用

2024 China Automation Congress, CAC 2024

作者： Zhitao, Long Zhijun, Cheng Yang, Chen Jiacheng, Li Chen, Feng School of Systems Engineering National University of Defense Technology Changsha China

ISBN: (数字)9798350368604

ISBN: (纸本)9798350368604

This paper provides an introduction to the concepts of fitness landscapes and information landscapes(IL), and proposes an improvement to the IL measure, transforming it into an indicator for evaluating the ruggedness of landscapes. A novel extremum-solving algorithm based on the IL measure is introduced for the extremum seeking of high-dimensional functions. The algorithm incorporates Latin hypercube sampling (LHS) from spatial filling designs to sample high-dimensional spaces, thereby obtaining regional sample points in high-dimensional spaces. It then applies the IL measure to calculate intervals, facilitating the extremum solving process of the algorithm. Finally, by comparing this algorithm with other methods, it is demonstrated that the algorithm can find all solutions with fewer initial points, outperforming traditional methods in both speed and solution quality, thus providing a theoretical foundation for subsequent engineering applications. © 2024 IEEE.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

A Location algorithm for Optimizating of Average Jump Distance 4

A Location Algorithm for Optimizating of Average Jump Distan...

引用

4th International Conference on Computer Systems, ICCS 2024

作者： Han, Yulao Pan Zhihua University Department of Mathematics and Computer PanZhiHua China

ISBN: (纸本)9798350366341

Due to the deviation of hop number and hop distance estimation in traditional DV-Hop localization algorithm, the accuracy of localization is affected. The paper presents a localization algorithm for optimizing average jump distance. The algorithm uses the beacon path distance between beacon nodes instead of the linear distance between them. In addition, the communication radius of each node is divided into non-equal dichotomies instead of fixed communication radius. Simulation results show that the localization algorithm proposed in the paper can effectively improve the localization accuracy and stability of unknown nodes by optimizing the average jump distance of beacon nodes. © 2024 IEEE.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共261页 << < 97 98 99 100 101 102 103 104 105 106 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：