Relevant bibliographies by topics / Multi-cover Problem

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers

Academic literature on the topic 'Multi-cover Problem'

Author: Grafiati
Published: 6 September 2023

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Multi-cover Problem.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Multi-cover Problem"

1

Mestre, Julián. "On the multi-radius cover problem." Information Processing Letters 99, no. 5 (September 2006): 195–98. http://dx.doi.org/10.1016/j.ipl.2006.04.012.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Hochbaum, Dorit S., and Asaf Levin. "The multi-integer set cover and the facility terminal cover problem." Networks 53, no. 1 (January 2009): 63–66. http://dx.doi.org/10.1002/net.20265.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Shi, Yishuo, Yingli Ran, Zhao Zhang, James Willson, Guangmo Tong, and Ding-Zhu Du. "Approximation algorithm for the partial set multi-cover problem." Journal of Global Optimization 75, no. 4 (July 3, 2019): 1133–46. http://dx.doi.org/10.1007/s10898-019-00804-y.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Hu, Shuli, Xiaoli Wu, Huan Liu, Yiyuan Wang, Ruizhi Li, and Minghao Yin. "Multi-Objective Neighborhood Search Algorithm Based on Decomposition for Multi-Objective Minimum Weighted Vertex Cover Problem." Sustainability 11, no. 13 (July 2, 2019): 3634. http://dx.doi.org/10.3390/su11133634.

Full text
Abstract:
The multi-objective minimum weighted vertex cover problem aims to minimize the sum of different single type weights simultaneously. In this paper, we focus on the bi-objective minimum weighted vertex cover and propose a multi-objective algorithm integrating iterated neighborhood search with decomposition technique to solve this problem. Initially, we adopt the decomposition method to divide the multi-objective problem into several scalar optimization sub-problems. Meanwhile, to find more possible optimal solutions, we design a mixed score function according to the problem feature, which is applied in initializing procedure and neighborhood search. During the neighborhood search, three operators ( A d d , D e l e t e , S w a p ) explore the search space effectively. We performed numerical experiments on many instances, and the results show the effectiveness of our new algorithm (combining decomposition and neighborhood search with mixed score) on several experimental metrics. We compared our experimental results with the classical multi-objective algorithm non-dominated sorting genetic algorithm II. It was obviously shown that our algorithm can provide much better results than the comparative algorithm considering the different metrics.
APA, Harvard, Vancouver, ISO, and other styles
5

Kim, Suhwan. "Direction finder deployment based on the partial set multi-cover problem." International Journal of Management Science and Engineering Management 14, no. 2 (August 2, 2018): 94–101. http://dx.doi.org/10.1080/17509653.2018.1500952.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Soleiman Mohammadi, Limaei, Lohmander Peter, and Olsson Leif. "Dynamic growth models for continuous cover multi-species forestry in Iranian Caspian forests." Journal of Forest Science 63, No. 11 (November 30, 2017): 519–29. http://dx.doi.org/10.17221/32/2017-jfs.

Full text
Abstract:
This study concerns some of the relevant topics of the Iranian Caspian forestry planning problem, in particular the first central components in this modelling process, such as forest modelling, forest statistics and growth function estimations. The required data was collected from Iranian Caspian forests. To do so, 201 sample plots were determined and the parameters such as number of trees, tree diameter at breast height and tree height were measured at each sample plot. Three sample plots at different 3 elevations were chosen to measure the tree increment. Data has been used to estimate a modified logistic growth model and a model that describes the growth of the basal area of individual trees as a function of basal area. General function analysis has been applied in combination with regression analysis. The results are interpreted from ecological perspectives. Furthermore, a dynamic multi-species growth model theory is developed and analysed with respect to dynamic behaviour, equilibria, convergence and stability. Logistic growth models have been found applicable for continuous cover forest management optimization. Optimization of management decisions in a changing and not perfectly predictable world should always be based on adaptive optimization.
APA, Harvard, Vancouver, ISO, and other styles
7

Zakarai, Mohammad, Hegazy Zaher, and Naglaa Ragaa. "Stochastic Local Search for Solving Chance-Constrained Multi-Manned U-shaped Assembly Line Balancing Problem with Time and Space Constraints." Journal of University of Shanghai for Science and Technology 23, no. 04 (April 28, 2021): 278–95. http://dx.doi.org/10.51201/jusst/21/04242.

Full text
Abstract:
The assembly line balancing problems have great importance in research and industry fields. They allow minimizing the learning aspects and guaranteeing a fixed number of products per day. This paper introduces a new problem that combines the multi-manned concept with the U-shaped lines with time and space constraints under uncertainty. The processing time of the tasks is considered as random variables with known means and variances. Therefore, chance-constraints appear in the cycle time constraints. In addition, each task has an associated area, where the assigned tasks per station are restricted by a total area. The proposed algorithm for solving the problem is a stochastic local search algorithm. The parameter levels of the proposed algorithm are optimized by the Taguchi method to cover the small, medium, and large-sized problems. Well-known benchmark problems have been adapted to cover the new model. The computational results showed the importance of the new problem and the efficiency of the proposed algorithm.
APA, Harvard, Vancouver, ISO, and other styles
8

Nguyen, Lan N., and My T. Thai. "Minimum Robust Multi-Submodular Cover for Fairness." Proceedings of the AAAI Conference on Artificial Intelligence 35, no. 10 (May 28, 2021): 9109–16. http://dx.doi.org/10.1609/aaai.v35i10.17100.

Full text
Abstract:
In this paper, we study a novel problem, Minimum Robust Multi-Submodular Cover for Fairness (MinRF), as follows: given a ground set V; m monotone submodular functions f_1,...,f_m; m thresholds T_1,...,T_m and a non-negative integer r; MinRF asks for the smallest set S such that f_i(S \ X) ≥ T_i for all i ∈ [m] and |X| ≤ r. We prove that MinRF is inapproximable within (1- ε) ln m; and no algorithm, taking fewer than exponential number of queries in term of r, is able to output a feasible set to MinRF with high certainty. Three bicriteria approximation algorithms with performance guarantees are proposed: one for r = 0, one for r = 1, and one for general r. We further investigate our algorithms' performance in two applications of MinRF, Information Propagation for Multiple Groups and Movie Recommendation for Multiple Users. Our algorithms have shown to outperform baseline heuristics in both solution quality and the number of queries in most cases.
APA, Harvard, Vancouver, ISO, and other styles
9

Stojkovic, Mirela, and François Soumis. "The operational flight and multi-crew scheduling problem." Yugoslav Journal of Operations Research 15, no. 1 (2005): 25–48. http://dx.doi.org/10.2298/yjor0501025s.

Full text
Abstract:
This paper introduces a new kind of operational multi-crew scheduling problem which consists in simultaneously modifying, as necessary, the existing flight departure times and planned individual work days (duties) for the set of crew members, while respecting predefined aircraft itineraries. The splitting of a planned crew is allowed during a day of operations, where it is more important to cover a flight than to keep planned crew members together. The objective is to cover a maximum number of flights from a day of operations while minimizing changes in both the flight schedule and the next-day planned duties for the considered crew members. A new type of the same flight departure time constraints is introduced. They ensure that a flight which belongs to several personalized duties, where the number of duties is equal to the number of crew members assigned to the flight, will have the same departure time in each of these duties. Two variants of the problem are considered. The first variant allows covering of flights by less than the planned number of crew members, while the second one requires covering of flights by a complete crew. The problem is mathematically formulated as an integer nonlinear multi-commodity network flow model with time windows and supplementary constraints. The optimal solution approach is based on Dantzig-Wolfe decomposition/column generation embedded into a branch-and-bound scheme. The resulting computational times on commercial-size problems are very good. Our new simultaneous approach produces solutions whose quality is far better than that of the traditional sequential approach where the flight schedule has been changed first and then input as a fixed data to the crew scheduling problem.
APA, Harvard, Vancouver, ISO, and other styles
10

ABU-AFFASH, A. KARIM, PAZ CARMI, MATTHEW J. KATZ, and GILA MORGENSTERN. "MULTI COVER OF A POLYGON MINIMIZING THE SUM OF AREAS." International Journal of Computational Geometry & Applications 21, no. 06 (December 2011): 685–98. http://dx.doi.org/10.1142/s021819591100386x.

Full text
Abstract:
We consider a geometric optimization problem that arises in sensor network design. Given a polygon P (possibly with holes) with n vertices, a set Y of m points representing sensors, and an integer k, 1 ≤ k ≤ m. The goal is to assign a sensing range, ri, to each of the sensors yi ∈ Y, such that each point p ∈ P is covered by at least k sensors, and the cost, [Formula: see text], of the assignment is minimized, where α is a constant. In this paper, we assume that α = 2, that is, find a set of disks centered at points of Y, such that (i) each point in P is covered by at least k disks, and (ii) the sum of the areas of the disks is minimized. We present, for any constant k ≥ 1, a polynomial-time c1-approximation algorithm for this problem, where c1 = c1(k) is a constant. The discrete version, where one has to cover a given set of n points, X, by disks centered at points of Y, arises as a subproblem. We present a polynomial-time c2-approximation algorithm for this problem, where c2 = c2(k) is a constant.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Multi-cover Problem"

1

Bhowmick, Santanu. "Multi-covering problems and their variants." Diss., University of Iowa, 2017. https://ir.uiowa.edu/etd/5418.

Full text
Abstract:
In combinatorial optimization, covering problems are those problems where given a ground set and a family of subsets of the ground set, the objective is to find a minimum cost set of subsets whose union contains the ground set. We consider covering problems in the context of Computational Geometry, which is a subfield of Computer Science that deals with problems associated with geometric objects such as points, lines, disks, polygons etc. In particular, geometric covering is an active research area, where the ground set and the family of subsets are induced by geometric objects. Covering problems in combinatorial optimizations often have a geometric analogue that arises naturally, and though such problems remain NP-hard, it is often possible to exploit the geometric properties of the set system to obtain better approximation algorithms. In this work, the fundamental problem that we consider is a generalization of geometric covering, where each element in the ground set may need to covered by more than one subset. To be precise, the problem is defined as follows: given two sets of points X, Y and a coverage function κ : X → Z+ ∪ {0}, construct balls centered on the points in Y such that each point in X is covered by at least κ(x) distinct balls. The objective in this problem is to minimize the total cost, which is a function of the radii of the balls. This problem is termed as the metric multi-cover (MMC) problem. We first consider version of the MMC problem where κ(x) = 1 for all clients, i.e. the 1-covering case. The known results that give a constant factor approximation for this problem are variations of LP-based primal-dual algorithm. We use a modified local search technique, motivated by geometric idea, to derive a simple, constant- factor approximation for this problem in Chapter 2. We then look at the MMC problem where the point sets X,Y are in the Euclidean plane, and each client x ∈ X needs to be covered by at least κ(x) distinct disks centered on the points in Y . In Chapter 4, we give the first polynomial time constant factor approximation for this problem, in which the constant is independent of the coverage function κ. Our solution also has an incremental property, which allows the algorithm to handle increases in the coverage requirement by increasing the radii of the current server disks, without affecting the approximation factor. In the next problem, we move from the Euclidean plane to arbitrary metric spaces where we consider the uniform MMC problem. In this problem, each client x has the demand κ(x) = k, where k > 0 is an integer. We give the first constant factor approximation (independent of k) for this problem. The key contribution that led to this result is the formulation of a partitioning scheme of the servers in the uniform MMC problem, that reduces the uniform MMC problem to k instances of 1-covering problem, while preserving the optimality of the solution to a constant multiplicative factor. We present the partitioning scheme as an independent result in Chapter 5, which we then use to solve the uniform MMC problem in Chapter 6. The MMC problem with arbitrary coverage function κ is then considered in Chapter 7. The key challenge that the non-uniform version presents is that the symmetry of the server partitioning scheme breaks down as the coverage demands of clients are independent of each other. We present a constant factor algorithm for this problem in Chapter 7. The last problem that we consider is the t-MMC problem, which is a restricted version of the uniform MMC problem. The objective is to compute a cover in which each client is covered by at least k distinct server disks, using atmost t server disks in total. This problem is a generalization of the clustering problem (where k = 1), and to our knowledge this is the first time this generalization has been considered. We give a constant factor approximation for this problem in Chapter 8.
APA, Harvard, Vancouver, ISO, and other styles
2

Jao, Chang-Yu, and 饒昌毓. "Multi-cover on a routing problem." Thesis, 2015. http://ndltd.ncl.edu.tw/handle/39781546622091391127.

Full text
Abstract:
碩士
中原大學
工業與系統工程研究所
103
In recently years, Greenhouse Effect has increasing which leads to abnormal weather conditions and many natural disasters in each area. Among Taiwan, the natural disasters such as floods, landslides, always happen due to the congenital climates and terrain environment. Therefore, setting up many precipitation stations to grasp variable climate conditions is a very important thing. The installment of precipitation stations did not discuss the maintenance in the past. However, the frequency for preservation is quite considerable. Therefore, in the research, setting up the precipitation stations, meanwhile, we consider the preservation follow-up service. Automatically develop the solution structure by revising Set Covering Problem and Chinese Postman Problem, based on the station locations and numbers which come from the above solution, calculate the shortest route passing through all stations and record as the original solution. Next, find all route combination by increasing point locations and calculate the costs of the shortest route. Test data by random number which generates from normal distribution and find all the results are better than the original results. The research of heuristic algorithms can provide a valuable reference for decision makers to evaluate station locations.
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Multi-cover Problem"

1

Kaushik, Sanket, and Nagendra Singh, eds. Current Developments in the Detection and Control of Multi Drug Resistance. BENTHAM SCIENCE PUBLISHERS, 2022. http://dx.doi.org/10.2174/97898150498791220101.

Full text
Abstract:
The rise in the incidence of infections is caused by multi drug resistant (MDR) bacteria, it is essential to elucidate the basic mechanism of antibiotic resistance to discover effective methods for diagnosis and treatment of infections. The use of pathogen-specific probes offers a faster alternative for pathogen detection and could improve the diagnosis of infection. High resolution melting analysis techniques are useful for the detection of multi drug resistant pathogens. Rational Structural Based Drug Design is a common method to identify a lead compound and take it forward for further developments. This book provides information about recent strategies involved in the diagnosis and treatment of infections caused by MDR bacteria. The volume covers the use of molecular probes for the quantification of pathogenic bacteria, along with other techniques mentioned above. Chapters also cover the use of identification of novel drug targets from the Lipid A biosynthesis and also from quorum sensing mediated biofilm formation in MDR bacteria. Chapters also cover herbal alternatives for the treatment of MDR bacteria like the use of Cassia aungustifolia in treatment of various diseases. The reference is suitable for biomedical students, cellular and molecular biologists.
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Multi-cover Problem"

1

Hassin, Refael, and Danny Segev. "The Multi-radius Cover Problem." In Lecture Notes in Computer Science, 24–35. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11534273_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Pourhassan, Mojgan, Feng Shi, and Frank Neumann. "Parameterized Analysis of Multi-objective Evolutionary Algorithms and the Weighted Vertex Cover Problem." In Parallel Problem Solving from Nature – PPSN XIV, 729–39. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-45823-6_68.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Shi, Yishuo, Zhao Zhang, and Ding-Zhu Du. "A Bicriteria Approximation Algorithm for Minimum Submodular Cost Partial Multi-Cover Problem." In Algorithmic Aspects in Information and Management, 62–73. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-030-04618-7_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Chen, Wenbin, Fufang Li, Ke Qi, Miao Liu, and Maobin Tang. "A Primal-Dual Randomized Algorithm for the Online Weighted Set Multi-cover Problem." In Lecture Notes in Computer Science, 60–68. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-59267-7_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Giupponi, Carlo. "Operationalizing Climate Proofing in Decision/Policy Making." In Springer Climate, 225–32. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-030-86211-4_26.

Full text
Abstract:
AbstractThe purpose of this work is to present an operational approach to include consideration of global change drivers (climatic, economic, social, etc.) in support to the design of local policies or investment plans. In both cases decision/policy makers typically have sets of plausible solutions and decisions to be taken in terms of choices among sets of plausible solutions with the best knowledge about the future dynamics of endogenous and exogenous system variables. The ambition is to identify the preferable solution(s) (in terms of technical performances, acceptance by stakeholders, cost–benefit ratio, etc.) in a medium term perspective, (e.g., 10–40 years), with current knowledge about the problem and under the effect of important sources of uncertainty (both aleatory and epistemic). Common to most decision contexts in a medium term perspective typical of both investment decisions and adaptation policies is the prevalence of economic signals in the shorter term and of climatic signals in the longer term. Models play a fundamental role in both cases, but they rarely cover the whole set of variables needed for decision making and the outcomes usually require integration of qualitative expert knowledge or simply subjective judgements. Multi-criteria analysis coupled with uncertainty analysis can contribute with methodologically sound and operational solutions. This paper elaborates on a series of recent cases with the ambition to extract common elements for a general methodological framework.
APA, Harvard, Vancouver, ISO, and other styles
6

Cao, Huan, Lili Wu, Yue Chen, Yongtao Su, Zhengchao Lei, and Chunping Zhao. "Analysis on the Security of Satellite Internet." In Communications in Computer and Information Science, 193–205. Singapore: Springer Singapore, 2020. http://dx.doi.org/10.1007/978-981-33-4922-3_14.

Full text
Abstract:
AbstractSatellite Internet (SI) is a new way to provide internet access all over the world. It will bring great convenience to international communication. Compared with the traditional communication networks, SI has a significant change in network architecture and communication model, which will have an important impact on national information network security. For example, the global interconnected SI consists of a large number of small satellites and each satellite has multi-beams to cover a vast area, which leads to the disorderly flow of information across the border, and greatly increases the difficulty of network protection. Therefore, it is necessary to closely track the development of SI and analyze security problems brought by SI. In this paper, we analyze the security risks of SI from the perspective of national security, network security and equipment security, and thirteen security issues have been summarized to provide reference for the healthy development of SI industry.
APA, Harvard, Vancouver, ISO, and other styles
7

Raubal, Martin, Dominik Bucher, and Henry Martin. "Geosmartness for Personalized and Sustainable Future Urban Mobility." In Urban Informatics, 59–83. Singapore: Springer Singapore, 2021. http://dx.doi.org/10.1007/978-981-15-8983-6_6.

Full text
Abstract:
AbstractUrban mobility and the transport of people have been increasing in volume inexorably for decades. Despite the advantages and opportunities mobility has brought to our society, there are also severe drawbacks such as the transport sector’s role as one of the main contributors to greenhouse-gas emissions and traffic jams. In the future, an increasing number of people will be living in large urban settings, and therefore, these problems must be solved to assure livable environments. The rapid progress of information and communication, and geographic information technologies, has paved the way for urban informatics and smart cities, which allow for large-scale urban analytics as well as supporting people in their complex mobile decision making. This chapter demonstrates how geosmartness, a combination of novel spatial-data sources, computational methods, and geospatial technologies, provides opportunities for scientists to perform large-scale spatio-temporal analyses of mobility patterns as well as to investigate people’s mobile decision making. Mobility-pattern analysis is necessary for evaluating real-time situations and for making predictions regarding future states. These analyses can also help detect behavioral changes, such as the impact of people’s travel habits or novel travel options, possibly leading to more sustainable forms of transport. Mobile technologies provide novel ways of user support. Examples cover movement-data analysis within the context of multi-modal and energy-efficient mobility, as well as mobile decision-making support through gaze-based interaction.
APA, Harvard, Vancouver, ISO, and other styles
8

Bouteraa, Noureddine, and Habib Djourdem. "A Study of Nonlinear Boundary Value Problem." In Simulation Modeling. IntechOpen, 2022. http://dx.doi.org/10.5772/intechopen.100491.

Full text
Abstract:
In this chapter, firstly we apply the iterative method to establish the existence of the positive solution for a type of nonlinear singular higher-order fractional differential equation with fractional multi-point boundary conditions. Explicit iterative sequences are given to approximate the solutions and the error estimations are also given. Secondly, we cover the multi-valued case of our problem. We investigate it for nonconvex compact valued multifunctions via a fixed point theorem for multivalued maps due to Covitz and Nadler. Two illustrative examples are presented at the end to illustrate the validity of our results.
APA, Harvard, Vancouver, ISO, and other styles
9

Atesmen, M. Kemal. "A Finite Difference Method to Solve 2-Dimensional Transient Heat Transfer Equation." In Case Studies in Transient Heat Transfer With Sensitivities to Governing Variables, 65–77. ASME, 2023. http://dx.doi.org/10.1115/1.886786_ch9.

Full text
Abstract:
The lumped capacitance method and analytical solutions cannot be applied to transient and multi-dimensional heat transfer problems with complicated geometries and boundary conditions. In this chapter, we will cover the explicit finite difference method application to a 2-dimensional transient heat transfer problem with multiple boundary conditions. Let us investigate the cooling of a stainless- steel rectangular prism bar with 1 m by 1 m square insulated ends from an initial temperature of 500 C down to 100 C at its center. The rectangular prism bar is subject to free and forced convection heat transfer at its four surfaces as shown in a 1 m by 1 m square cross-section view in Figure 9-1.
APA, Harvard, Vancouver, ISO, and other styles
10

Dasgupta, Prithviraj. "Coverage Path Planning Using Mobile Robot Team Formations." In Emerging Research on Swarm Intelligence and Algorithm Optimization, 214–47. IGI Global, 2015. http://dx.doi.org/10.4018/978-1-4666-6328-2.ch010.

Full text
Abstract:
The multi-robot coverage path-planning problem involves finding collision-free paths for a set of robots so that they can completely cover the surface of an environment. This problem is non-trivial as the geometry and location of obstacles in the environment is usually not known a priori by the robots, and they have to adapt their coverage path as they discover obstacles while moving in the environment. Additionally, the robots have to avoid repeated coverage of the same region by each other to reduce the coverage time and energy expended. This chapter discusses the research results in developing multi-robot coverage path planning techniques using mini-robots that are coordinated to move in formation. The authors present theoretical and experimental results of the proposed approach using e-puck mini-robots. Finally, they discuss some preliminary results to lay the foundation of future research for improved coverage path planning using coalition game-based, structured, robot team reconfiguration techniques.
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Multi-cover Problem"

1

Chekuri, Chandra, Kenneth L. Clarkson, and Sariel Har-Peled. "On the set multi-cover problem in geometric settings." In the 25th annual symposium. New York, New York, USA: ACM Press, 2009. http://dx.doi.org/10.1145/1542362.1542421.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Demange, Marc, and Cerasela Tanasescu. "A Multi-period Vertex Cover Problem and Application to Fuel Management." In 5th International Conference on Operations Research and Enterprise Systems. SCITEPRESS - Science and Technology Publications, 2016. http://dx.doi.org/10.5220/0005708900510057.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Assadi, Sepehr. "Tight Space-Approximation Tradeoff for the Multi-Pass Streaming Set Cover Problem." In SIGMOD/PODS'17: International Conference on Management of Data. New York, NY, USA: ACM, 2017. http://dx.doi.org/10.1145/3034786.3056116.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Wu, Binghan, Wei Bao, Dong Yuan, and Bing Zhou. "Competitive Analysis for Multi-Commodity Ski-Rental Problem." In Thirty-First International Joint Conference on Artificial Intelligence {IJCAI-22}. California: International Joint Conferences on Artificial Intelligence Organization, 2022. http://dx.doi.org/10.24963/ijcai.2022/648.

Full text
Abstract:
We investigate an extended version of the classical ski-rental problem with multiple commodities. A customer uses a set of commodities altogether, and he/she needs to choose payment options to cover the usage of each commodity without the knowledge of the future. The payment options of each commodity include (1) renting: to pay for an on-demand usage and (2) buying: to pay for the lifetime usage. It is a novel extension of the classical ski-rental problem which deals with only one commodity. To address this problem, we propose a new online algorithm called the Multi-Object Break-Even (MOBE) algorithm and conduct competitive analysis. We show that the tight lower and upper bounds of MOBE algorithm's competitive ratio are e/e-1 and 2 respectively against adaptive adversary under arbitrary renting and buying prices. We further prove that MOBE algorithm is an optimal online algorithm if commodities have the same rent-to-buy ratio. Numerical results verify our theoretical conclusion and demonstrate the advantages of MOBE in a real-world scenario.
APA, Harvard, Vancouver, ISO, and other styles
5

Voss, Heinrich, and Markus Stammberger. "Free Vibrations of Fluid–Solid Structures With Strong Coupling." In ASME 2010 Pressure Vessels and Piping Division/K-PVP Conference. ASMEDC, 2010. http://dx.doi.org/10.1115/pvp2010-25207.

Full text
Abstract:
Free vibrations of fluid-solid structures are governed by unsymmetric eigenvalue problems. A common approach which works fine for weakly coupled systems is to project the problem to a space spanned by modes of the uncoupled system. For strongly coupled systems however the approximation properties are not satisfactory. This paper reports on a framework for taking advantage of the structure of the unsymmetric eigenvalue problem allowing for a variational characterization of its eigenvalues, and structure preserving iterative projection methods. We further cover an adjusted automated multi-level sub-structuring method for huge fluid-solid structures.
APA, Harvard, Vancouver, ISO, and other styles
6

Lima, Joao, Rafael Roberto, Lucas Figueiredo, Francisco Magalhaes, and Veronica Teichrieb. "Generalizable Multi-Camera 3D Pedestrian Detection." In LatinX in AI at Computer Vision and Pattern Recognition Conference 2021. Journal of LatinX in AI Research, 2021. http://dx.doi.org/10.52591/lxai202106252.

Full text
Abstract:
We present a multi-camera 3D pedestrian detection method that does not need to train using data from the target scene. We estimate pedestrian location on the ground plane using a novel heuristic based on human body poses and person’s bounding boxes from an off-the-shelf monocular detector. We then project these locations onto the world ground plane and fuse them with a new formulation of a clique cover problem. We also propose an optional step for exploiting pedestrian appearance during fusion by using a domain-generalizable person re identification model. We evaluated the proposed approach on the challenging WILDTRACK dataset. It obtained a MODA of 0.569 and an F-score of 0.78, superior to state-of-the-art generalizable detection techniques.
APA, Harvard, Vancouver, ISO, and other styles
7

Boonlong, Kittipong, Nachol Chaiyaratana, and Suwat Kuntanapreeda. "Time Optimal and Time-Energy Optimal Control of Satellite Attitude Using Genetic Algorithms." In ASME 2002 International Mechanical Engineering Congress and Exposition. ASMEDC, 2002. http://dx.doi.org/10.1115/imece2002-33436.

Full text
Abstract:
This paper presents the use of genetic algorithms for solving time optimal and time-energy optimal control problems in a satellite attitude control system. The satellite attitude control system is a multi-input/multi-output non-linear system at which its continuous attitude-related states are driven by discrete-valued command torque input. The problems investigated cover the time optimal control with two-state input (−u, +u) and three-state input (−u, 0, u) and the time-energy optimal control with three-state input. With the use of two-state input, the control problem has been formulated as a multi-objective optimisation problem where the decision variables are composed of the time where an input-state switching occurs while the objectives consist of the final state errors and the trajectory time. A multi-objective genetic algorithm (MOGA) has been successfully used to obtain the time optimal solution which is superior to that generated by linearising the system and utilising a bang-bang control law. In contrast, with the use of three-state input, the control problems are reduced to single-objective optimisation problems. In the case of time optimal control, the objective is the trajectory time while a time-energy cost is used as the search objective in the time-energy optimal control. A single-objective genetic algorithm has been successfully used to generate the optimal control solutions for both problems. In addition, the effects of diversity control on the genetic algorithm performances in the control problems have also been identified.
APA, Harvard, Vancouver, ISO, and other styles
8

Seif, M. A. "Computer Aided Optimization of Mechanical Systems." In ASME 1993 International Computers in Engineering Conference and Exposition. American Society of Mechanical Engineers, 1993. http://dx.doi.org/10.1115/cie1993-0060.

Full text
Abstract:
Abstract Optimization is the ultimate goal of any design that aims to obtain a maximum gain out of a system at minimum expense within a framework of physical laws that restrict an absolute multi-aspect gains. The current paper presents a design methodology for optimum performance of mechanical systems. Design optimization problems have been classified based on the nature of the relation between the parameters and the restrictions imposed by virtue of operation conditions and the complexity of weighing the competitiveness of design objectives. Three classes of optimization problems are introduced: direct (explicit), interacting (implicit), and comparative (modeling). Examples of each class are given and suggested approaches to tackle the solutions are presented. These examples cover a wide range of applications in mechanical systems and would help clarify the overall framework of problem-solution schemes frequently encountered in the design of machine components.
APA, Harvard, Vancouver, ISO, and other styles
9

Das, Ranjan. "An Inverse Method for Parameter Retrieval in Solar Thermal Collector With a Single Glass Cover." In ASME 2021 Power Conference. American Society of Mechanical Engineers, 2021. http://dx.doi.org/10.1115/power2021-65601.

Full text
Abstract:
Abstract The present article highlights the implementation of differential evolution (DE)-assisted metaheuristic optimizer to provide the solution of an inverse multi-variable problem related to a flat absorber solar collector consisting of a single glass. For satisfying a given heating requirement from the solar collector, the necessary tilt angle and the thickness of the glass cover are simultaneously predicted using the proposed DE methodology. The existing study of inverse multi-variable optimization analysis has been done for dynamic values of solar energy radiation and different ambient conditions commonly encountered in various geographical locations of India. Formulation of the current research involves the minimization of a newly proposed cost function involving the required and the acquired heat transfer rates from the solar collector in Euclidean space. The solution approach then utilizes a dynamic exchange between evolutionary metaheuristic DE and a well-validated forward solver containing analytical expressions of heat energy balance within the solar collector. Variations of cost function and the estimated design variables are mainly studied to visualize the algorithm’s behavior for a single gazing-based solar thermal device. Multiple possible groupings of the unknown parameters of the solar collector are revealed, which always collectively result in a desired heating requirement from the solar collector. Sensitivity indices related to the design variables are evaluated for ascertaining the relative importance of parameter selection. Encouraging opportunity is found towards the system’s size reduction through sparing selection of inclination angle. The current study provides a convenient and cost-effective tool to select the necessary inclination and glass covers to obtain low to medium heating requirements from the available incident solar energy.
APA, Harvard, Vancouver, ISO, and other styles
10

Piao, Yongri, Zhengkun Rong, Miao Zhang, Xiao Li, and Huchuan Lu. "Deep Light-field-driven Saliency Detection from a Single View." In Twenty-Eighth International Joint Conference on Artificial Intelligence {IJCAI-19}. California: International Joint Conferences on Artificial Intelligence Organization, 2019. http://dx.doi.org/10.24963/ijcai.2019/127.

Full text
Abstract:
Previous 2D saliency detection methods extract salient cues from a single view and directly predict the expected results. Both traditional and deep-learning-based 2D methods do not consider geometric information of 3D scenes. Therefore the relationship between scene understanding and salient objects cannot be effectively established. This limits the performance of 2D saliency detection in challenging scenes. In this paper, we show for the first time that saliency detection problem can be reformulated as two sub-problems: light field synthesis from a single view and light-field-driven saliency detection. We propose a high-quality light field synthesis network to produce reliable 4D light field information. Then we propose a novel light-field-driven saliency detection network with two purposes, that is, i) richer saliency features can be produced for effective saliency detection; ii) geometric information can be considered for integration of multi-view saliency maps in a view-wise attention fashion. The whole pipeline can be trained in an end-to-end fashion. For training our network, we introduce the largest light field dataset for saliency detection, containing 1580 light fields that cover a wide variety of challenging scenes. With this new formulation, our method is able to achieve state-of-the-art performance.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Multi-cover Problem' for particular source types:
Journal articles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography