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

algorithm complexity of neighborhood total domination and -graphs

JOURNAL OF COMBINATORIAL OPTIMIZATION 2018年第2期35卷 424-435页

作者： Lu, Changhong Wang, Bing Wang, Kan East China Normal Univ Shanghai Key Lab PMMP Dept Math Shanghai 200241 Peoples R China

A neighborhood total dominating set, abbreviated for NTD-set D, is a vertex set of G such that D is a dominating set with an extra property: the subgraph induced by the open neighborhood of D has no isolated vertex. The neighborhood total domination number, denoted by , is the minimum cardinality of a NTD-set in G. In this paper, we prove that NTD problem is NP-complete for bipartite graphs and split graphs. Then we give a linear-time algorithm to determine for a given tree T. Finally, we characterize a constructive property of -trees and provide a constructive characterization for -graphs, where and are domination number and packing number for the given graph, respectively.

关键词： Neighborhood total domination algorithm complexity Labeled graph

来源：评论

学校读者我要写书评

暂无评论

The risk of algorithm transparency: How algorithm complexity drives the effects on the use of advice

引用

PRODUCTION AND OPERATIONS MANAGEMENT 2022年第9期31卷 3419-3434页

作者： Lehmann, Cedric A. Haubitz, Christiane B. Fuegener, Andreas Thonemann, Ulrich W. Univ Cologne Dept Supply Chain Management & Management Sci D-50923 Cologne Germany

Although algorithmic decision support is omnipresent in many managerial tasks, a lack of algorithm transparency is often stated as a barrier to successful human-machine collaboration. In this paper, we analyze the effects of algorithm transparency on the use of advice from algorithms with different degrees of complexity. We conduct a set of laboratory experiments in which participants receive identical advice from algorithms with different levels of transparency and complexity. Our results indicate that not the algorithm itself, but the individually perceived appropriateness of algorithmic complexity moderates the effects of transparency on the use of advice. We summarize this effect as a plateau curve: While perceiving an algorithm as too simple severely harms the use of its advice, the perception of an algorithm as being too complex has no significant effect. Our insights suggest that managers do not have to be concerned about revealing algorithms that are perceived to be appropriately complex or too complex to decision-makers, even if the decision-makers do not fully comprehend them. However, providing transparency on algorithms that are perceived to be simpler than appropriate could disappoint people's expectations and thereby reduce the use of their advice.

关键词： algorithm transparency algorithm complexity decision-making decision support use of advice

来源：评论

学校读者我要写书评

暂无评论

A novel time computation model based on algorithm complexity for data intensive scientific workflow design and scheduling

引用

CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE 2009年第16期21卷 2070-2083页

作者： He, Jing Zhang, Yanchun Huang, Guangyan Pang, Chaoyi Victoria Univ Sch Sci & Engn Melbourne Vic 8001 Australia Chinese Acad Sci Res Ctr Fictitious Econ & Data Sci Beijing 100190 Peoples R China

Scientific workflow offers a framework for cooperation between remote and shared resources on a grid computing environment (GCE) for scientific discovery. One major function of scientific workflow is to schedule a collection of computational subtasks in well-defined orders for efficient outputs by estimating task duration at runtime. In this paper, we propose a novel time computation model based on algorithm complexity (termed as TCMAC model) for high-level data intensive scientific workflow design. The proposed model schedules the subtasks based on their durations and the complexities of participant algorithms. Characterized by utilization of task duration computation function for time efficiency, the TCMAC model has three features for a full-aspect scientific workflow including both dataflow and control-flow: (1) provides flexible and reusable task duration functions in GCE;(2) facilitates better parallelism in iteration structures for providing more precise task durations;and (3) accommodates dynamic task durations for rescheduling in selective structures of control flow. We will also present theories and examples in scientific workflows to show the efficiency of the TCMAC model, especially for control-flow. Copyright (C) 2009 John Wiley & Sons, Ltd.

关键词： scientific workflow computation time model dataflow control-flow algorithm complexity

来源：评论

学校读者我要写书评

暂无评论

A novel time computation model based on algorithm complexity for data intensive scientific workflow design and scheduling

A novel time computation model based on algorithm complexity...

引用

3rd International Workshop on Workflow Management and Applications in Grid Environments (WaGe2008)

关键词： scientific workflow computation time model dataflow control-flow algorithm complexity

来源：评论

学校读者我要写书评

暂无评论

Informational Sensitivity as algorithm's complexity Function Characteristic

Informational Sensitivity as Algorithm's Complexity Function...

引用

International Conference on Numerical Analysis and Applied Mathematics (ICNAAM)

作者： Kiktenko, Anastasia Lunkovskiy, Mikhail Nikiforov, Konstantin St Petersburg State Univ St Petersburg 199034 Russia

The main goal of this study is to present technique realized with the numeric experiments, that can come to the aid in algorithm practical characterization. Input data of both varied size and varied values are conside... 详细信息

ISBN: (纸本)9780735412873

关键词： informational sensitivity algorithm complexity Travelling Salesman problem Concorde

来源：评论

学校读者我要写书评

暂无评论

Simple and efficient step detection algorithm for foot-mounted IMU

引用

MEASUREMENT SCIENCE AND TECHNOLOGY 2025年第1期36卷 016302-016302页

作者： Shi, Ling-Feng Yan, Xu Zhou, Wen Shi, Yifan Xidian Univ Sch Elect Engn Xian 710071 Shaanxi Peoples R China Queens Univ Mech & Mat Engn Dept Kingston ON K7L 3N6 Canada

This paper presents a concise, efficient, and adaptive step detection algorithm based on foot-mounted inertial measurement unit sensors. The proposed method maps the temporal values of pedestrian motion and gait diversity into two variables: the distance between peaks and valleys, and the slope. Compared to traditional sliding window methods, this approach amplifies the differences between normal and abnormal steps, allowing it to adapt to various indoor activities such as fast walking, slow walking, running, jogging, standing still, and turning. By incorporating adaptive factors, it addresses the challenge of detecting steps while going up and down stairs. The proposed algorithm overcomes the limitations of traditional adaptive threshold methods that require different temporal and peak thresholds for various gait conditions. By utilizing the significant differences in distance and slope, it effectively resolves the issue of detecting steps during stationary periods. Unlike neural network-based gait classifiers, this algorithm does not need to account for multiple gait conditions, thereby simplifying the training process. Experimental results demonstrate that the algorithm achieves an average accuracy of over 99% under mixed indoor walking conditions and over 98% accuracy in long-term outdoor walking conditions.

关键词： pedestrian dead reckoning step detection IMU algorithm complexity adaptive factor

来源：评论

学校读者我要写书评

暂无评论

A Distributed Symmetric Game Optimization to 3-Path Vertex Cover of Networks

引用

IEEE TRANSACTIONS ON NETWORKING 2025年第2期33卷 913-928页

作者： Chen, Jie Ding, Yong Zhou, Rongpei Qiu, Zhifeng Gui, Weihua Natl Univ Def Technol Coll Elect Engn Hefei 230037 Peoples R China Nanchang Univ Sch Informat Engn Nanchang 330036 Peoples R China Cent South Univ Sch Automat Changsha 410083 Peoples R China

As a typical combinatorial optimization problem, the 3-path vertex cover problem has wide applications in practice. To solve the 3-path vertex cover problem from the perspective of distributed optimization, we treat each vertex as an agent (i.e., player) with computation, and decision-making capabilities. First, we establish a 3-player symmetric game model to describe the 3-path vertex cover problem, and design the corresponding cost function for each player. Then, we prove that under the established game model, strict Nash equilibriums (SNEs) act as the basis of the connection between 3-path vertex cover states and minimum 3-path vertex cover states. Next, we propose a novel memory-based synchronous learning (MSL) algorithm, where the initial profile strategy generation of players relies on the designed degree preference rule, and each player has a memory length for recording strategies and independently update their strategies concurrently based on the accessed local information. After that, we prove that our proposed MSL algorithm can guarantee that any strategy profile converges to an SNE, and provide a theoretical analysis of the algorithm's complexity. Finally, we present numerous numerical simulations to demonstrate the performance of our proposed algorithm on various networks. Moreover, we find that increasing the memory length and adopting the degree preference initialization can yield a better SNE.

关键词： Games Optimization Approximation algorithms Nash equilibrium Monitoring Symmetric matrices NP-hard problem Wireless sensor networks Training Standards 3-path vertex cover symmetric game distributed optimization strict Nash equilibrium algorithm complexity

来源：评论

学校读者我要写书评

暂无评论

Estimation of Computational complexity of Combinatorial-Genetic algorithm COMBI-GA 9

Estimation of Computational Complexity of Combinatorial-Gene...

引用

9th International Conference on Advanced Computer Information Technologies (ACIT)

作者： Moroz, Olha Stepashko, Volodymyr NAS Int Res & Training Ctr Informat Technol & Syst Dept Informat Technol Induct Modeling Akad Glushkov Ave 40 UA-03680 Kiev Ukraine MES Ukraine Akad Glushkov Ave 40 UA-03680 Kiev Ukraine

The article presents a description of the combinatorial-genetic algorithm COMBI-GA as well as results of theoretical estimation of its computational complexity and numerical comparison of its effectiveness with known ... 详细信息

ISBN: (纸本)9781728104492

关键词： Combinatorial GMDH algorithm algorithm COMBI-GA algorithm complexity algorithm MULTI algorithm LASSO

来源：评论

学校读者我要写书评

暂无评论

complexity Research on B algorithm

Complexity Research on <i>B</i> Algorithm

引用

International Conference on Information Technology for Manufacturing Systems

作者： Han, Aili Shandong Univ Sch Informat Engn Weihai 264209 Peoples R China

ISBN: (纸本)9780878492879

The time complexity of B algorithm, one of the intelligent search algorithms, is discussed. By anatomizing some instances, it is pointed out that the cost of calculating the value of heuristic function should be included in the range of time complexity analysis for B algorithm. And then, an algorithm of calculating the value of heuristic function is presented. By analyzing the cost of calculating the value of heuristic function, it is pointed out that the number of recursions in B algorithm is O(n!) in the worst case. Therefore, the time complexity of B algorithm is exponential instead of O(n(2)).

关键词： algorithm complexity intelligent search B algorithm

来源：评论

学校读者我要写书评

暂无评论

An improved low-complexity LMMSE channel estimation algorithm

An improved low-complexity LMMSE channel estimation algorith...

引用

International Conference on Control Engineering and Communication Technology (ICCECT)

作者： Wang, Xuchen Guo, Feng Wuhan Univ Technol Sch Informat Engn Wuhan 430070 Peoples R China

ISBN: (纸本)9781467344999

This paper proposes an improved linear minimum mean square error (LMMSE) algorithm of adaptive order determination by taking advantage of the structure characteristics of time domain least square (LS) channel estimation based on hardware platform, which provides the approximate estimation approach of max-time delay and noise power. In addition, this algorithm achieves a practical channel estimation formula which greatly reduces the complexity of the algorithm by decomposing the autocorrelation matrix into some sub-matrixes on the foundation of correlation bandwidth. Finally, comparisons are made between the simulation performances of improved LMMSE algorithm with those of other estimation methods for further analysis.

关键词： LTE LMMSE adaptive order determination channel parameter algorithm complexity

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：