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

Application of backtracking algorithm in College Dormitory Assignment Management

Application of Backtracking Algorithm in College Dormitory A...

2009 2nd IEEE International Conference on Computer Science and Information Technology(第二届计算机科学与信息技术国际会议 ICCSIT2009)

作者： Wen-fa WANG Zhu-lin LI Yan MA Institute of Computer Science Yan’an University Ya’an ShanXi ProvinceChina Software R&D Center Yan’an University Ya’an ShanXi ProvinceChina

The multi-constraint conditions, including the entrance examination for college, the region and the dormitory classification and so on, were analyzed and studied enough by assigning management dormitory reasonably. A new backtracking algorithm based on matrix storage was proposed, and the realization detail of the algorithm was discussed. Further, the complexity of the algorithm was analyzed. The analysis result show the algorithm is more efficient comparing the similar method, and the application result show it is effective and reasonable in practice.

关键词： backtracking algorithm matriz storage multiconstraint conditions dormitory assignment management

来源：评论

学校读者我要写书评

暂无评论

Application of backtracking algorithm in College Dormitory Assignment Management

Application of Backtracking Algorithm in College Dormitory A...

引用

2009 2nd IEEE International Conference on Computer Science and Information Technology（ICCSIT 2009）

作者： Wen-fa WANG,Zhu-lin LI,Yan MA Institute of Computer Science Yan’an University Ya’an,ShanXi Province,China Software R&D Center Yan’an University Ya’an,ShanXi Province,China

The multi-constraint conditions,including the entrance examination for college,the region and the dormitory classification and so on,were analyzed and studied enough by assigning management dormitory reasonably.A new backtracking algorithm based on matrix storage was proposed,and the realization detail of the algorithm was ***,the complexity of the algorithm was *** analysis result show the algorithm is more efficient comparing the similar method,and the application result show it is effective and reasonable in practice.

关键词： backtracking algorithm matrix storage multi- constraint conditions dormitory assignment management

来源：评论

学校读者我要写书评

暂无评论

An efficient backtracking heuristic for the resource allocation problem with compatibility and exclusivity constraints

引用

JOURNAL OF HEURISTICS 2025年第1期31卷 1-29页

作者： Khassiba, Ahmed Capgemini Engn Sud Ouest4 Ave Didier Daurat F-31700 Blagnac France

We study a resource allocation problem featuring specific constraints, called exclusivity constraints, in addition to regular compatibility constraints. Resources are to be allocated to independent modules, each having a list of compatible resources. A resource can be allocated to several modules. However, some modules exhibit exclusivity constraints, requiring each of them to be allocated to one dedicated compatible resource, not shared with any other module. Such a resource allocation problem arises in the deployment of simulation modules on computational resources in a distributed simulation platform, where the simulation requester may require some modules to be allocated to dedicated resources for a better soft real-time execution, or for instrumentation purposes. In this paper, we introduce the problem of resource allocation with compatibility and exclusivity constraints and show it reduces to the list-coloring problem in a threshold graph. We deduce that our problem is NP-complete in the general case, while it can be solved in polynomial time, in two special cases. We propose a heuristic backtracking algorithm enhanced by pruning rules and exploiting the subproblems' special structure. Compared to four list coloring heuristics adapted to our problem, our heuristic algorithm can be considered as the method of choice to find high-quality solutions in short computing times.

关键词： Resource allocation List-coloring problem backtracking algorithm Pruning rules Imperfect matching

来源：评论

学校读者我要写书评

暂无评论

A STOCHASTIC MULTI-CRITERIA ACCEPTABILITY ANALYSIS AND CHOQUET INTEGRAL BASED APPROACH FOR MULTI-CRITERIA PROJECT PORTFOLIO SELECTION AND SCHEDULING PROBLEM WITH INTERACTIVE CRITERIA

引用

JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION 2025年第3期21卷 1846-1866页

作者： Song, Shiling Zhang, Xiaoqi Xia, Qiong South China Agr Univ Coll Math & Informat Guangzhou Peoples R China Univ Sci & Technol China Sch Management Hefei Peoples R China Hefei Univ Technol Sch Econ Hefei Peoples R China

An organization's resources are finite, precluding the concurrent launch of every project. Consequently, for those who make organizational choices, pinpointing the best project portfolio from a vast array of potential projects and timing their commencement effectively are two pivotal challenges. Extant research has spawned a multitude of project portfolio selection and scheduling techniques, from simple scoring to intricate mathematical frameworks. Nevertheless, most of these methods frequently fall short in presenting a unified and useful approach that can account for various interconnected criteria and the uncertain criterion weights. This study endeavors to bridge this gap by introducing a multi-criteria decision-making model which combines stochastic multi-criteria acceptability analysis and Choquet integral. We have developed three distinct algorithms: a backtracking algorithm based on stochastic multi-criterion acceptability analysis and Choquet Integral (SMAACI), an artificial immune algorithm derived from SMAACI, and a simulated annealing algorithm also based on SMAACI, to tackle the proposed mathematical problem. The backtracking algorithm is efficient at discovering the global optimal solution for smaller-scale issues, whereas the artificial immune and simulated annealing algorithms can deliver satisfactory solutions swiftly for larger-scale problems. These algorithms are demonstrated through experimental cases and an examination of a middle school construction project in a southern Chinese metropolis.

关键词： Project portfolio selection and scheduling multi-criterion decision-making backtracking algorithm artificial immune algorithm simulated annealing algorithm SMAA Choquet integral

来源：评论

学校读者我要写书评

暂无评论

Time-Optimal Velocity Planning of Single-Axis Multipoint Motion With Global Dynamic Programming algorithm

引用

IEEE TRANSACTIONS ON INDUSTRIAL INFORMATICS 2025年第1期21卷 643-652页

作者： Li, Ke Xiong, Xiaogang Lou, Yunjiang Wang, Shanda Huang, Yuping Jia, Longfei Harbin Inst Technol Shenzhen Sch Mech Engn & Automat Shenzhen 518055 Peoples R China Innovat Ctr Control Actuators Beijing Inst Precis Mechatron & Controls Beijing 100076 Peoples R China

To solve the time-optimal problem of velocity planning, various optimization-based methods were proposed in the literature, but these existing methods typically have limitations on completeness and real-time performance. For the scenario of single-axis multipoint (SAMP) motion, this article proposes a global dynamic programming algorithm with local greedy strategies to solve the time-optimal velocity planning problem, which is important for the multiaxis synchronous velocity planning problem. The proposed method, which is called SAMP algorithm, transfers the problem into the splicing problem of interval endpoints and acceleration. Then, based on the assumptions of continuity and monotonicity of piecewise polynomial functions, it derives the optimal motion mapping in these different intervals. Finally, the SAMP algorithm obtains the global time-optimal solution by employing the global dynamic programming with a backtracking algorithm. Simulation and experiments demonstrate that the SAMP algorithm not only has time optimization but also shows good numerical efficiency.

关键词： Planning Splines (mathematics) backtracking Heuristic algorithms Polynomials Mathematical models Real-time systems backtracking algorithm single-axis multipoint motion time optimization velocity planning

来源：评论

学校读者我要写书评

暂无评论

Draw procedures for balanced 3-team group rounds in sports competitions

引用

ANNALS OF OPERATIONS RESEARCH 2025年第3期346卷 2065-2092页

作者： Laliena, Pablo Lopez, F. Javier IES Mor Fuentes Ave Pueyo 89 Monzon 22400 Spain Univ Zaragoza Fac Ciencias Dept Metodos Estadisticos C Pedro Cerbuna 12 Zaragoza 50009 Spain Univ Zaragoza Fac Ciencias BIFI C PedroCerbuna 12 Zaragoza 50009 Spain

We propose procedures for draws in sports tournaments that will achieve balanced groups of size 3. We start by developing an efficient algorithm that finds all possible balanced groupings;that is, allocations of teams to groups such that the strength of all groups lies between two bounds. The algorithm uses comparison results to discard large sets of unfeasible allocations and backtracking. We then define pot-and-ball draws that randomly pick one of the balanced groupings. Our draw procedures ensure that all groups are of (virtually) identical competitive levels, thereby enhancing the overall fairness and interest of the tournament.

关键词： Assignment problem backtracking algorithm Integer programming Sports

来源：评论

学校读者我要写书评

暂无评论

A novel recursive backtracking genetic programming-based algorithm for 12-lead ECG compression

引用

SIGNAL IMAGE AND VIDEO PROCESSING 2019年第5期13卷 1029-1036页

作者： Feli, Mohammad Abdali-Mohammadi, Fardin Razi Univ Dept Comp Engn & Informat Technol Kermanshah Iran

ECG signal is among medical signals used to diagnose heart problems. A large volume of medical signal's data in telemedicine systems causes problems in storing and sending tasks. In the present paper, a recursive algorithm with backtracking approach is used for ECG signal compression. This recursive algorithm constructs a mathematical estimator function for each segment of the signal using genetic programming algorithm. When all estimator functions of different segments of the signal are determined and put together, a piecewise-defined function is constructed. This function is utilized to generate a reconstructed signal in the receiver. The compression result is a set of compressed strings representing the piecewise-defined function which is coded through a text compression method. In order to improve the compression results in this method, the input signal is smoothed. MIT-BIH arrhythmia database is employed to test and evaluate the proposed algorithm. The results of this algorithm include the average of compression ratio that equals 30.97 and the percent root-mean-square difference that is equal to 2.38%, suggesting its better efficiency in comparison with other state-of-the-art methods.

关键词： Electrocardiograph Signal compression Genetic programming backtracking algorithm

来源：评论

学校读者我要写书评

暂无评论

ModEnPBT: A Modified backtracking Ensemble Pruning algorithm

引用

APPLIED SOFT COMPUTING 2013年第11期13卷 4292-4302页

作者： Dai, Qun Liu, Zhuan Nanjing Univ Aeronaut & Astronaut Dept Comp Sci & Engn Nanjing 210016 Peoples R China

This paper proposes a new Modified backtracking Ensemble Pruning algorithm (ModEnPBT), which is based upon the design idea of our previously proposed Ensemble Pruning via backtracking algorithm (EnPBT), and however, aiming at overcoming its drawback of redundant solution space definition. Solution space of ModEnPBT is compact with no repeated solution vectors, therefore it possesses relatively higher searching efficiency compared with EnPBT algorithm. ModEnPBT still belongs to the category of backtracking algorithm, which can systematically search for the solutions of a problem in a manner of depth-first, which is suitable for solving all those large-scale combinatorial optimization problems. Experimental results on three benchmark classification tasks demonstrate the validity and effectiveness of the proposed ModEnPBT. (C) 2013 Elsevier B.V. All rights reserved.

关键词： Ensemble pruning Selective ensemble backtracking algorithm Ensemble Pruning via backtracking algorithm (EnPBT) Modified Ensemble Pruning via backtracking algorithm (ModEnPBT)

来源：评论

学校读者我要写书评

暂无评论

Common subgraph isomorphism detection by backtracking search

引用

SOFTWARE-PRACTICE & EXPERIENCE 2004年第6期34卷 591-607页

作者： Krissinel, EB Henrick, K Europena Bioinformat Inst Cambridge CB10 1SD England

Graph theory offers a convenient and highly attractive approach to various tasks of pattern recognition. Provided there is a graph representation of the object in question (e.g. a chemical structure or protein fold), the recognition procedure is reduced to the problem of common subgraph isomorphism (CSI). Complexity of this problem shows combinatorial dependence on the size of input graphs, which in many practical cases makes the approach computationally intractable. Among the optimal algorithms for CSI, the leading place in practice belongs to algorithms based on maximal clique detection in the association graph. backtracking algorithms for CSI, first developed two decades ago, are rarely used. We propose an improved backtracking algorithm for CSI, which differs from its predecessors by better search strategy and is therefore more efficient. We found that the new algorithm outperforms the traditional maximal clique approach by orders of magnitude in computational time. Copyright (C) 2004 John Wiley Sons, Ltd.

关键词： common subgraphs backtracking algorithm

来源：评论

学校读者我要写书评

暂无评论

A novel neural network and backtracking based protection coordination scheme for distribution system with distributed generation

引用

INTERNATIONAL JOURNAL OF ELECTRICAL POWER & ENERGY SYSTEMS 2012年第1期43卷 868-879页

作者： Zayandehroodi, Hadi Mohamed, Azah Shareef, Hussain Farhoodnea, Masoud Univ Kebangsaan Malaysia Fac Engn Dept Elect Elect & Syst Engn Ukm Bangi Selangor Malaysia

With the increased installation of renewable energy based distributed generations (DGs) in distribution systems, it brings about a change in the fault current level of the system and causes many problems in the current protection system. Hence, effective protection schemes are required to ensure safe and selective protection relay coordination in the power distribution system with DG units. In this paper, a novel adaptive protection scheme is proposed by integrating fault location with protection relay coordination strategies. An automated fault location method is developed using a two stage radial basis function neural network (RBFNN) in which the first RBFNN determines the fault distance from each source while the second RBFNN identifies the exact faulty line. After identifying the exact faulty line, then protection relay coordination is implemented. A new protection coordination strategy using the backtracking algorithm is proposed in which it considers the main protection algorithm to coordinate the operating states of relays so as to isolate the faulty line. Then a backup protection algorithm is considered to complete the protection coordination scheme for isolating the malfunction relays of the main protection system. Several case studies have been used to validate the accuracy of the proposed adaptive protection schemes. The results illustrate that the adaptive protection scheme is able to accurately identify faulty line and coordinate the relays in a power distribution system with DG units. The developed adaptive protection scheme is useful for assisting power engineers in performing service restoration quickly so as to decrease the total down time during faults. (C) 2012 Elsevier Ltd. All rights reserved.

关键词： Fault location Protection coordination Distribution network Distributed generation (DG) backtracking algorithm Radial basis function neural network (RBFNN)

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：