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

18th International Joint Conference on Theoretical Computer Science-Frontier of algorithmic Wisdom, IJTCS-FAW 2024

作者： Li, Tiantian Jiang, Haitao Wang, Lusheng Zhu, Daming School of Computer Science and Technology Shandong University Qingdao China Department of Computer Science City University of Hong Kong Hong Kong

ISBN: (纸本)9789819777518

A (k]-tuple common substring (abbr. (k]-CSS) is a common subsequence of two or more given strings including at most k common substrings. The complexity of finding a longest (k]-CSS of 2 strings is still open. We present a dynamic programming algorithm for finding a longest (k]-CSS of two strings in O(kn1n2) time and space where n1 and n2 are the given string lengths. To breakthrough the quadratic space complexity, we present an algorithm for finding a longest (k]-CSS in O(kn1n2) time and O(n1+kn2) space. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Towards an Efficient Innovation Path Seeking algorithm Using Directed Domination 13th

Towards an Efficient Innovation Path Seeking Algorithm Usin...

引用

13th International Conference on Evolutionary Multi-Criterion Optimization, EMO 2025

作者： Khan, Ahmer Deb, Kalyanmoy Michigan State University East LansingMI48823 United States

ISBN: (纸本)9789819635054

In practice, users are often stuck with an existing solution, despite agreeing on the fact that the solution needs a substantial change. The hesitation might stem from the hefty cost or amount of effort required to adopt a new solution or could just be human apathy to large changes. In this regard, a recent preliminary study proposed a step-constrained based bi-objective optimization approach which attempts to discover a set of acceptable intermediate solutions starting from the current solution to the desired target solution leading to an innovation path (IP). Intermediate solutions, obtained using a multiobjectivization approach, reduce the amount of change required between two successive steps, thereby facilitating multiple gradual changes more acceptable by the users. In this paper, we propose a directed domination concept to make the IP-seeking algorithm more computationally efficient. Results on a number of test and engineering problems reveal that the proposed new approach reaches closer to the target solution and finds closer to optimally trade-off solutions than the previous IP approach. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Distributed Incentive algorithm for Fine-Grained Offloading in Vehicular Ad Hoc Networks 24th

Distributed Incentive Algorithm for Fine-Grained Offloading...

引用

24th International Conference on algorithms and Architectures for Parallel Processing, ICA3PP 2024

作者： Wu, Junhong Wu, Yalan Huang, Jiale Wu, Jigang School of Computer Science and Technology Guangdong University of Technology Guangzhou China School of Integrated Circuits Guangdong University of Technology Guangzhou China

ISBN: (纸本)9789819615445

In vehicular ad hoc networks, few existing works on task offloading focus on co-offloading at intra-vehicle level and inter-vehicle level for deep neural network (DNN) inference. Moreover, they ignore the decentralized environment and selfishness of vehicles. This seriously limits the improvement of quality of services for DNN inference. To fill this gap, we formulate a fine-grained offloading problem considering two-level offloading and vehicle selfishness. To solve the problem, we propose a distributed algorithm based on coalition game to encourage vehicles to share their resources. Simulation results show that, the proposed algorithm outperforms the state-of-the-arts in terms of system payoff and running time of algorithms for most cases. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

New algorithms for Multivalued Component Trees 27th

New Algorithms for Multivalued Component Trees

引用

27th International Conference on Pattern Recognition, ICPR 2024

作者： Passat, Nicolas Perrin, Romain Randrianasoa, Jimmy Francky Kurtz, Camille Naegel, Benoît Université de Reims Champagne Ardenne CRESTIC Reims France Université de Strasbourg CNRS ICube Strasbourg France Le Kremlin-Bicêtre Le Kremlin-Bicêtre France Université Paris Cité LIPADE Paris France

ISBN: (纸本)9783031783463

Tree-based structures can model images—and more generally valued graphs—for processing and analysis purpose. In this framework, the component tree was natively designed for grey-level images—and more generally totally ordered valued graphs. Ten years ago, the notion of a multivalued component tree was introduced to relax this grey-level/total order constraint. In this algorithmic paper, we provide new tools to handle multivalued component trees. Our contributions are twofold: (1) we propose a new algorithm for the construction of the multivalued component tree;(2) we propose two strategies for building hierarchical orders on value sets, required to further build the multivalued component trees of images/graphs relying on such value sets. Codes available at: https://***/bnaegel/multivalued_component_tree. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

From First-Order to Second-Order Rationality: Advancing Game Convergence with Dynamic Weighted Fictitious Play 21st

From First-Order to Second-Order Rationality: Advancing Gam...

引用

21st Pacific Rim International Conference on Artificial Intelligence, PRICAI 2024

作者： Ju, Qi Hei, Falin Liu, Yuxuan Fang, Zhemei Luo, Yunfeng Huazhong University of Science and Technology Wuhan China National Key Laboratory of Science and Technology on Multispectral Information Processing Wuhan China

ISBN: (纸本)9789819601271

Constructing effective algorithms to converge to Nash Equilibrium (NE) is a important problem in algorithmic game theory. Prior research generally posits that the upper bound on the convergence rate for games is OT-1/2. This paper introduces a novel perspective, positing that the key to accelerating convergence in game theory is "rationality". Based on this concept, we propose a Dynamic Weighted Fictitious Play (DW-FP) algorithm. We demonstrate that this algorithm can converge to a NE and exhibits a convergence rate of O(T-1) in experimental evaluations. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Noisy (Binary) Searching: Simple, Fast and Correct 42

Noisy (Binary) Searching: Simple, Fast and Correct

引用

42nd International Symposium on Theoretical Aspects of Computer Science, STACS 2025

作者： Dereniowski, Dariusz Lukasiewicz, Aleksander Uznański, Przemyslaw Faculty of Electronics Telecommunications and Informatics Gdańsk University of Technology Poland Institute of Computer Science University of Wroclaw Poland Computer Science Institute Charles University Prague Czech Republic

ISBN: (纸本)9783959773652

This work considers the problem of the noisy binary search in a sorted array. The noise is modeled by a parameter p that dictates that a comparison can be incorrect with probability p, independently of other queries. We state two types of upper bounds on the number of queries: the worst-case and expected query complexity scenarios. The bounds improve the ones known to date, i.e., our algorithms require fewer queries. Additionally, they have simpler statements, and work for the full range of parameters. All query complexities for the expected query scenarios are tight up to lower order terms. For the problem where the target prior is uniform over all possible inputs, we provide an algorithm with expected complexity upperbounded by (log2 n + log2 δ−1 + 3)/I(p), where n is the domain size, 0 ≤ p 0 is the failure probability, and I(p) is the information gain function. As a side-effect, we close some correctness issues regarding previous work. Also, en route, we obtain new and improved query complexities for the search generalized to arbitrary graphs. This paper continues and improves the lines of research of Burnashev-Zigangirov [Prob. Per. Informatsii, 1974], Ben-Or and Hassidim [FOCS 2008], Gu and Xu [STOC 2023], and Emamjomeh-Zadeh et al. [STOC 2016], Dereniowski et al. [SOSA@SODA 2019]. © Dariusz Dereniowski, Aleksander Lukasiewicz, and Przemyslaw Uznański.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Themis: An Equal, Unpredictable, and Scalable consensus for Consortium Blockchain 42

Themis: An Equal, Unpredictable, and Scalable Consensus for ...

引用

42nd IEEE International Conference on Distributed Computing Systems (ICDCS)

作者： Jia, Linpeng Wang, Keyuan Wang, Xin Yu, Lei Li, Zhongcheng Sun, Yi Chinese Acad Sci Inst Comp Technol Beijing Peoples R China Univ Chinese Acad Sci Sch Comp Sci & Technol Beijing Peoples R China

ISBN: (数字)9781665471770

ISBN: (纸本)9781665471770

consensus algorithm is the core component of consortium blockchains. Equality, Unpredictability and Scalability are three important demands for the consensus algorithms of consortium blockchain. Existing deterministic consensus algorithms (e.g. PBFT) can ensure Equality, but cannot meanwhile meet Unpredictability and Scalability;probabilistic consensus algorithms (e.g. PoW) can achieve Scalability and guarantee a decent Unpredictability, but cannot meet the Equality requirement. In this paper, we propose a new consensus algorithm, namely Themis, which takes the three properties into account. Themis independently adjusts the block-producing difficulty of each node through a self-adaptive node election mechanism, effectively reducing the correlation between the block-producing frequency and the invested computing power of each node. Besides, a GEOST main chain consensus rule is proposed to handle forks and further improve the performance of the algorithm. If a fork occurs, consensus nodes will choose the sub-chain with the highest Equality to join the main chain. Evaluations show that Themis achieves outstanding performance in Equality and Unpredictability while ensuring Scalability, compared with the existing algorithms.

关键词： consensus algorithm Blockchain Equality Unpredictability Scalability

来源：评论

学校读者我要写书评

暂无评论

Communication-Efficient consensus Mechanism for Federated Reinforcement Learning

Communication-Efficient Consensus Mechanism for Federated Re...

引用

IEEE International Conference on Communications (ICC)

作者： Xu, Xing Li, Rongpeng Zhao, Zhifeng Zhang, Honggang Zhejiang Univ Hangzhou Peoples R China Zhejiang Lab Hangzhou Peoples R China

ISBN: (数字)9781538683477

ISBN: (纸本)9781538683477

The paper considers independent reinforcement learning (IRL) for multi-agent decision-making process in the paradigm of federated learning (FL). We show that FL can clearly improve the policy performance of IRL in terms of training efficiency and stability. However, since the policy parameters are trained locally and aggregated iteratively through a central server in FL, frequent information exchange incurs a large amount of communication overheads. To reach a good balance between improving the model's convergence performance and reducing the required communication and computation overheads, this paper proposes a system utility function and develops a consensus-based optimization scheme on top of the periodic averaging method, which introduces the consensus algorithm into FL for the exchange of a model's local gradients. This paper also provides novel convergence guarantees for the developed method, and demonstrates its superior effectiveness and efficiency in improving the system utility value through theoretical analyses and numerical simulation results.

关键词： Independent Reinforcement Learning Federated Learning consensus algorithm Communication Overheads Utility Function

来源：评论

学校读者我要写书评

暂无评论

Robust Fixed-Time consensus Tracking Control of High-Order Multiple Nonholonomic Systems

引用

IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS 2021年第3期51卷 1869-1880页

作者： Shi, Shang Xu, Shengyuan Feng, Hongyan Nanjing Univ Sci & Technol Sch Automat Nanjing 210094 Peoples R China

Convergence rate is an important performance index in consensus control. Yet, most of the existing results can only achieve asymptotic consensus, or finite-time consensus whose settling time is contingent on initial conditions. This paper studies the robust fixed-time consensus tracking control problem for high-order nonholonomic chained-form systems subject to unknown parameters and nonlinear uncertainties. By using the modified power integrator method, we propose a new robust fixed-time consensus tracking algorithm, with which the consensus tracking can be achieved in a fixed time independent of initial conditions even in the presence of uncertainties. An observer-based fixed-time consensus tracking algorithm is also developed as an alternative method to overcome the communication loop problem. Lyapunov analysis shows the fixed-time stability of the closed-loop system. An application to multiple wheeled mobile robots is presented.

关键词： Multi-agent systems consensus algorithm Uncertainty Convergence Mobile robots Observers Asymptotic stability Chained-form finite-time control fixed-time control multiagent systems nonholonomic systems

来源：评论

学校读者我要写书评

暂无评论

Second-Order consensus of Hybrid Multiagent Systems

引用

IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS 2021年第10期51卷 6503-6512页

作者： Su, Housheng Wang, Xin Chen, Xia Zeng, Zhigang Huazhong Univ Sci & Technol Sch Artificial Intelligence & Automat Image Proc & Intelligent Control Key Lab Educ Minist China Wuhan 430074 Peoples R China Huazhong Univ Sci & Technol State Key Lab Adv Electromagnet Engn & Technol Wuhan 430074 Peoples R China Huazhong Univ Sci & Technol Sch Elect & Elect Engn Wuhan 430074 Peoples R China

This article studies the consensus of hybrid second-order multiagent systems (MASs), where the hybrid MAS is constituted by the continuous-time second-order (CTSO) and discrete-time second-order (DTSO) dynamic agents. First, a hybrid consensus algorithm is proposed, where a sample-data control is considered in the CTSO subsystems. Under the proposed hybrid consensus algorithm, the convergence of the hybrid second-order MAS matrix is analyzed. Second, a sufficient and necessary condition is proposed, which indicates that the controller parameters, such as coupling gains and the sampling interval, and eigenvalues of network topology have a significant impact on the system consensus. Finally, several simulation examples are presented to prove the validity of the results.

关键词： Eigenvalues and eigenfunctions consensus algorithm Multi-agent systems Graph theory Couplings Delays Laplace equations consensus continuous-time discrete-time hybrid multiagent systems (MASs) second-order

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：