In this paper, we propose different binarization methods for the Fruit Fly Algorithm, using S-shaped and V-shaped transfer functions and various discretization methods to make the algorithm work in a binary sea
Efficient heuristic algorithms for the weighted set covering problem. Computers and Oper. Research, 8(4):303-310, 1981.Efficient Heuristic Algorithm For the Weighted Set Covering Problem - K - 1981Efficient heuristic algorithms for the weighted set covering problem - Baker - 1981...
Lessing L, Dumitrescu I, Stützle T (2004) A comparison between ACO algorithms for the set covering problem. Lect Notes Comput Sc 3172:1–12Lessing, L., Dumitrescu, I., Stützle, T. A Comparison between ACO Algorithms for the Set Covering Problem. In: Dorigo, M., Birattari, M., ...
Partition set cover problemPenaltyLP-roundingPrimal-dualIn this paper, we consider the partition set cover problem with penalties. In this problem, we have a universeU, a partitionP={P1,…,Pr}\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts}...
The present study examines the role of feature selection methods in optimizing machine learning algorithms for predicting heart disease. The Cleveland Heart disease dataset with sixteen feature selection techniques in three categories of filter, wrapper,
Proof of the master theorem(主定理的证明)(118) 1. The proof for exact powers(确切权力的证明)(118) 2. Floors and ceilings(地板和天花板)(123) 5. Probabilistic Analysis and Randomized Algorithms(概率分析和随机算法)(134) 1. The hiring problem(招聘问题)(134) 1. Worst-case analysis(最坏情况...
34.5 NP-complete problems Problems 35 Approximation Algorithms 35.1 The vertex-cover problem 35.2 The traveling-salesman problems 35.3 The set-covering problem 35.4 Randomization and linear programming 35.5 The subset-sum problem ProblemAboutSome exercises and problems in Introduction to Algorithms 3rd editi...
3.Weproposethefirstnon-trivialapproximationforthek-generalized connectivity problem. 4. We improve on the currently best approximation for directed Steiner network. 5. We present a unified framework for approximating partial covering problems, and demon- strate the applicability of our method in ...
Structured illumination microscopy (SIM) has become the standard for next-generation wide-field microscopy, offering ultrahigh imaging speed, superresolution, a large field-of-view, and long-term imaging. Over the past decade, SIM hardware and software have flourished, leading to successful application...
We study the classic NP-Hard problem of finding the maximum k-set coverage in the data stream model: given a set system of m sets that are subsets of a universe {1,…,n}, find the k sets that cover the most number of distinct elements. The problem can be approximated up to a fact...