Gotowe bibliografie tematyczne / Multi-cover Problem / Artykuły w czasopismach
Kliknij ten link, aby zobaczyć inne rodzaje publikacji na ten temat: Multi-cover Problem.

Artykuły w czasopismach na temat „Multi-cover Problem”

Autor: Grafiati
Data publikacji: 6 września 2023

Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych

Wybierz rodzaj źródła:

Sprawdź 50 najlepszych artykułów w czasopismach naukowych na temat „Multi-cover Problem”.

Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.

Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.

Przeglądaj artykuły w czasopismach z różnych dziedzin i twórz odpowiednie bibliografie.

1

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

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
2

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

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
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 (2019): 1133–46. http://dx.doi.org/10.1007/s10898-019-00804-y.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
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 (2019): 3634. http://dx.doi.org/10.3390/su11133634.

Pełny tekst źródła
Streszczenie:
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 app
Style APA, Harvard, Vancouver, ISO itp.
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 (2018): 94–101. http://dx.doi.org/10.1080/17509653.2018.1500952.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
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 (2017): 519–29. http://dx.doi.org/10.17221/32/2017-jfs.

Pełny tekst źródła
Streszczenie:
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 mod
Style APA, Harvard, Vancouver, ISO itp.
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 (2021): 278–95. http://dx.doi.org/10.51201/jusst/21/04242.

Pełny tekst źródła
Streszczenie:
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 restric
Style APA, Harvard, Vancouver, ISO itp.
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 (2021): 9109–16. http://dx.doi.org/10.1609/aaai.v35i10.17100.

Pełny tekst źródła
Streszczenie:
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
Style APA, Harvard, Vancouver, ISO itp.
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.

Pełny tekst źródła
Streszczenie:
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-da
Style APA, Harvard, Vancouver, ISO itp.
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 (2011): 685–98. http://dx.doi.org/10.1142/s021819591100386x.

Pełny tekst źródła
Streszczenie:
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) th
Style APA, Harvard, Vancouver, ISO itp.
11

Zhou, Taoqing, Zhipeng Lü, Yang Wang, Junwen Ding, and Bo Peng. "Multi-start iterated tabu search for the minimum weight vertex cover problem." Journal of Combinatorial Optimization 32, no. 2 (2015): 368–84. http://dx.doi.org/10.1007/s10878-015-9909-3.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
12

Ran, Yingli, Yishuo Shi, Changbing Tang, and Zhao Zhang. "A primal-dual algorithm for the minimum partial set multi-cover problem." Journal of Combinatorial Optimization 39, no. 3 (2019): 725–46. http://dx.doi.org/10.1007/s10878-019-00513-y.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
13

Lei, Tao, Linze Li, Zhiyong Lv, Mingzhe Zhu, Xiaogang Du, and Asoke K. Nandi. "Multi-Modality and Multi-Scale Attention Fusion Network for Land Cover Classification from VHR Remote Sensing Images." Remote Sensing 13, no. 18 (2021): 3771. http://dx.doi.org/10.3390/rs13183771.

Pełny tekst źródła
Streszczenie:
Land cover classification from very high-resolution (VHR) remote sensing images is a challenging task due to the complexity of geography scenes and the varying shape and size of ground targets. It is difficult to utilize the spectral data directly, or to use traditional multi-scale feature extraction methods, to improve VHR remote sensing image classification results. To address the problem, we proposed a multi-modality and multi-scale attention fusion network for land cover classification from VHR remote sensing images. First, based on the encoding-decoding network, we designed a multi-modali
Style APA, Harvard, Vancouver, ISO itp.
14

Shi, Yishuo, Yingli Ran, Zhao Zhang, and Ding-Zhu Du. "A bicriteria algorithm for the minimum submodular cost partial set multi-cover problem." Theoretical Computer Science 803 (January 2020): 1–9. http://dx.doi.org/10.1016/j.tcs.2019.03.004.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
15

Vasegaard, Alex Elkjær, Mathieu Picard, Florent Hennart, Peter Nielsen, and Subrata Saha. "Multi Criteria Decision Making for the Multi-Satellite Image Acquisition Scheduling Problem." Sensors 20, no. 5 (2020): 1242. http://dx.doi.org/10.3390/s20051242.

Pełny tekst źródła
Streszczenie:
The multi-satellite image acquisition scheduling problem is traditionally seen as a complex optimization problem containing a generic objective function that represents the priority structure of the satellite operator. However, the majority of literature neglect the collective and contemporary effect of factors associated with the operational goal in the objective function, i.e., uncertainty in cloud cover, customer priority, image quality criteria, etc. Consequently, the focus of the article is to integrate a real-time scoring approach of imaging attempts that considers these aspects. This is
Style APA, Harvard, Vancouver, ISO itp.
16

Guo, Shaocui, Xiangrong Tong, and Xu Yang. "Shell Analysis and Optimisation of a Pure Electric Vehicle Power Train Based on Multiple Software." World Electric Vehicle Journal 9, no. 4 (2018): 49. http://dx.doi.org/10.3390/wevj9040049.

Pełny tekst źródła
Streszczenie:
Motor end cover mounting fracture is a problem recently encountered by novel pure electric vehicles. Regarding the study of the traditional vehicle engine mount bracket and on the basis of the methods of design and optimisation available, we have analysed and optimised the pure electric vehicle end cover mount system. Multi-body dynamic software and finite element software have been combined. First, we highlight the motor end cover mount bracket fracture engineering problems, analyse the factors that may produce fracture, and propose solutions. By using CATIA software to establish a 3D model o
Style APA, Harvard, Vancouver, ISO itp.
17

Hartmanns, Arnd, Sebastian Junges, Joost-Pieter Katoen, and Tim Quatmann. "Multi-cost Bounded Tradeoff Analysis in MDP." Journal of Automated Reasoning 64, no. 7 (2020): 1483–522. http://dx.doi.org/10.1007/s10817-020-09574-9.

Pełny tekst źródła
Streszczenie:
Abstract We provide a memory-efficient algorithm for multi-objective model checking problems on Markov decision processes (MDPs) with multiple cost structures. The key problem at hand is to check whether there exists a scheduler for a given MDP such that all objectives over cost vectors are fulfilled. We cover multi-objective reachability and expected cost objectives, and combinations thereof. We further transfer approaches for computing quantiles over single cost bounds to the multi-cost case and highlight the ensuing challenges. An empirical evaluation shows the scalability of our new approa
Style APA, Harvard, Vancouver, ISO itp.
18

Shavarani, Seyed Mahdi. "Multi-level facility location-allocation problem for post-disaster humanitarian relief distribution." Journal of Humanitarian Logistics and Supply Chain Management 9, no. 1 (2019): 70–81. http://dx.doi.org/10.1108/jhlscm-05-2018-0036.

Pełny tekst źródła
Streszczenie:
Purpose Previously use of drones as a relief distribution vehicle was studied in several studies where required number of drones and the best locations for the relief centers were investigated. The maximum travel distance of drones without a need to recharge is limited by their endurance. Recharge stations can be used to extend the coverage area of the drones. The purpose of this paper is to find the best topology for both relief centers and recharge stations to cover a large-scale area with minimum and feasible incurred costs and waiting times. Design/methodology/approach A multi-level facili
Style APA, Harvard, Vancouver, ISO itp.
19

Arteconi, Alessia. "An Overview about Criticalities in the Modelling of Multi-Sector and Multi-Energy Systems." Environments 5, no. 12 (2018): 130. http://dx.doi.org/10.3390/environments5120130.

Pełny tekst źródła
Streszczenie:
The urgent need for the reduction of greenhouse gas (GHG) emissions requires efficient and integrated energy communities in order to decrease final energy demand and sustain energy transitions towards renewable energy sources (RES). This introduces a big research challenge for future energy systems design and optimization, given the multi-level and inter-sectorial dimensions of the problem. Buildings cover a central role in this context, because they represent the nexus between different energy carrier networks. The study of the management of multi-sector and multi-energy systems presents seve
Style APA, Harvard, Vancouver, ISO itp.
20

Burhan, Hussein M., Bara’a A. Attea, Amenah D. Abbood, Mustafa N. Abbas, and Mayyadah Al-Ani. "Evolutionary multi-objective set cover problem for task allocation in the Internet of Things." Applied Soft Computing 102 (April 2021): 107097. http://dx.doi.org/10.1016/j.asoc.2021.107097.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
21

Zhang, Wenjie, Jianhua Tu, and Lidong Wu. "A multi-start iterated greedy algorithm for the minimum weight vertex cover P3 problem." Applied Mathematics and Computation 349 (May 2019): 359–66. http://dx.doi.org/10.1016/j.amc.2018.12.067.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
22

Levi, Retsef, Andrea Lodi, and Maxim Sviridenko. "Approximation Algorithms for the Capacitated Multi-Item Lot-Sizing Problem via Flow-Cover Inequalities." Mathematics of Operations Research 33, no. 2 (2008): 461–74. http://dx.doi.org/10.1287/moor.1070.0305.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
23

Bahrami, Amir, and Saeed Ostadzadeh. "Comprehensively Efficient Analysis of Nonlinear Wire Scatterers Considering Lossy Ground and Multi-tone Excitations." Applied Computational Electromagnetics Society 35, no. 8 (2020): 878–86. http://dx.doi.org/10.47037/2020.aces.j.350805.

Pełny tekst źródła
Streszczenie:
In this paper based on intelligent water drops algorithm (IWD), comprehensively nonlinear analysis of nonlinearly loaded wire scatterers are carried out. The analyses involve two stages. First, the problem is modeled as a nonlinear multi-port equivalent circuit and it is then reformulated into an optimization problem which is solved by the IWD. The simulation results are compared with harmonic balance (HB), arithmetic operator method (AOM), approximate methods and experiment. Analysis of the problem under strongly nonlinear loads, presence of lossy ground, multi-port structures, and multi-ton
Style APA, Harvard, Vancouver, ISO itp.
24

Li, Lin, Dianxi Shi, Songchang Jin, et al. "Complete coverage problem of multiple robots with different velocities." International Journal of Advanced Robotic Systems 19, no. 2 (2022): 172988062210916. http://dx.doi.org/10.1177/17298806221091685.

Pełny tekst źródła
Streszczenie:
Complete coverage, which is integral to many robotic applications, aims to cover an area as quickly as possible. In such tasks, employing multiple robots can reduce the overall coverage time by appropriate task allocation. Several multi-robot coverage approaches divide the environment into balanced subareas and minimize the maximum subarea of all robots. However, balanced coverage in many situations, such as in the cases of robots with different velocities and heterogeneous multi-robot systems, may have inefficient results. This study addresses the unbalanced complete coverage problem of multi
Style APA, Harvard, Vancouver, ISO itp.
25

Jia, Jintong, Jiarui Song, Qingqiang Kong, Huan Yang, Yunhe Teng, and Xuan Song. "Multi-Attention-Based Semantic Segmentation Network for Land Cover Remote Sensing Images." Electronics 12, no. 6 (2023): 1347. http://dx.doi.org/10.3390/electronics12061347.

Pełny tekst źródła
Streszczenie:
Semantic segmentation is a key technology for remote sensing image analysis widely used in land cover classification, natural disaster monitoring, and other fields. Unlike traditional image segmentation, there are various targets in remote sensing images, with a large feature difference between the targets. As a result, segmentation is more difficult, and the existing models retain low accuracy and inaccurate edge segmentation when used in remote sensing images. This paper proposes a multi-attention-based semantic segmentation network for remote sensing images in order to address these problem
Style APA, Harvard, Vancouver, ISO itp.
26

Flathmann, Christopher, Nathan McNeese, and Lorenzo Barberis Canonico. "Using Human-Agent Teams to Purposefully Design Multi-Agent Systems." Proceedings of the Human Factors and Ergonomics Society Annual Meeting 63, no. 1 (2019): 1425–29. http://dx.doi.org/10.1177/1071181319631238.

Pełny tekst źródła
Streszczenie:
With multi-agent teams becoming more of a reality every day, it is important to create a common design model for multi-agent teams. These teams need to be able to function in dynamic environments and still communicate with any humans that may need a problem solved. Existing human-agent research can be used to purposefully create multi-agent teams that are interdependent but can still interact with humans. Rather than creating dynamic agents, the most effective way to overcome the dynamic nature of modern workloads is to create a dynamic team configuration, rather than individual member-agents
Style APA, Harvard, Vancouver, ISO itp.
27

Zhang, Bin, Pei De Xu, Jian Jiang Wang, and Chao Bo Wu. "Optimization Deployment of Multi-Platform Earth Observation Resources for Emergencies." Advanced Materials Research 765-767 (September 2013): 552–56. http://dx.doi.org/10.4028/www.scientific.net/amr.765-767.552.

Pełny tekst źródła
Streszczenie:
in emergency, to improve the collaborative observation capacity of multiple platform resources, including satellite, airship and UAV (Unmanned Aerial Vehicle), an approach for deploying resources based on genetic optimization is proposed in this paper. We model the observation area into grids, and formulate the multi-platform resource deployment as a combination optimization problem, which has the goal of maximizing the cover probability of the observation area in the constraint of response time. Integer encoding is adopted in the approach to represent the positions of resources. Besides, elit
Style APA, Harvard, Vancouver, ISO itp.
28

Abdul, Arif Mohammad, Arshad Ahmad Khan Mohammad, Matti Kiran Sastry, and Jyothi Bankapalli. "Brute Force Attack on Distributed data Hiding in the Multi-Cloud Storage Environment More Diminutive than the Exponential Computations." Ingénierie des systèmes d information 27, no. 6 (2022): 915–21. http://dx.doi.org/10.18280/isi.270607.

Pełny tekst źródła
Streszczenie:
Classical steganography is designed to hide data by cover media. Recent approaches fragmented the data and hide them in a distributed manner by embedding each fragmented data into a distinct cover media. This approach makes a secret message extremely difficult for an attacker to detect. However, cover media modification leaves fingerprints that could expose a secret channel to an attacker. To overcome the problem, a novel steganography concept designed by two technical contributions. I). cover media does not undergo any modification, i.e., the cover media act as a pointer to fragmented data. I
Style APA, Harvard, Vancouver, ISO itp.
29

Chraibi, Abdelahad, Said Kharraja, Ibrahim H. Osman, and Omar Elbeqqali. "A Multi-Agents System for Solving Facility Layout Problem: Application to Operating Theater." Journal of Intelligent Systems 28, no. 4 (2019): 601–19. http://dx.doi.org/10.1515/jisys-2017-0081.

Pełny tekst źródła
Streszczenie:
Abstract Facility layout problem (FLP) has a great impact on the efficiency of any organization. It is concerned with defining the optimal location for each facility in order to optimize the supply chain productivity. In this kind of problems, the choice of resolution approach depends on the complexity and the size of the problem. Operating theaters are generally big structures containing a lot of facilities, which makes the conception of their layout a complex problem. In the literature, exact methods are powerless when faced with problem sizes up to 18 facilities. This leads us to explore ot
Style APA, Harvard, Vancouver, ISO itp.
30

Garai, Arindam, and Tapan Kumar Roy. "Intuitionistic Fuzzy Modeling to Travelling Salesman Problem." INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY 11, no. 9 (2013): 3015–24. http://dx.doi.org/10.24297/ijct.v11i9.3414.

Pełny tekst źródła
Streszczenie:
This paper presents solution technique for travelling salesman problem (TSP) under intuitionistic fuzzy environment. Travelling salesman problem is a non-deterministic polynomial-time (NP) hard problem in combinatorial optimization, studied in graph theory, operations research and theoretical computer science. It must be noted that a traveling sales man even face a situation in which he is not able to achieve his objectives completely. There must be a set of alternatives from which he can select one that best meets his aspiration level. For Multi-Objective Symmetric TSP, in fuzzy enviro
Style APA, Harvard, Vancouver, ISO itp.
31

Pamukcu, Duygu, and Burcu Balcik. "A multi-cover routing problem for planning rapid needs assessment under different information-sharing settings." OR Spectrum 42, no. 1 (2019): 1–42. http://dx.doi.org/10.1007/s00291-019-00563-y.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
32

Fluck, Julia. "Investigating the Comparability of Two Multi-Item-Scales for Cyber Bullying Measurement." International Journal of Environmental Research and Public Health 15, no. 11 (2018): 2356. http://dx.doi.org/10.3390/ijerph15112356.

Pełny tekst źródła
Streszczenie:
In current cyberbullying literature, researchers assess the phenomenon using a large variety of measurement approaches. This poses a problem in light of comparability of study results. The most common approaches are singular global questions or multi-item scales that list several forms of cyberbullying. Such lists contain either different types of actions or different types of media. This study explores different measurement approaches. Two multi-item scales, one listing different actions and one listing different media, are compared to investigate whether they measure the same latent construc
Style APA, Harvard, Vancouver, ISO itp.
33

MONGIOVÌ, MISAEL, RAFFAELE DI NATALE, ROSALBA GIUGNO, ALFREDO PULVIRENTI, ALFREDO FERRO, and RODED SHARAN. "SIGMA: A SET-COVER-BASED INEXACT GRAPH MATCHING ALGORITHM." Journal of Bioinformatics and Computational Biology 08, no. 02 (2010): 199–218. http://dx.doi.org/10.1142/s021972001000477x.

Pełny tekst źródła
Streszczenie:
Network querying is a growing domain with vast applications ranging from screening compounds against a database of known molecules to matching sub-networks across species. Graph indexing is a powerful method for searching a large database of graphs. Most graph indexing methods to date tackle the exact matching (isomorphism) problem, limiting their applicability to specific instances in which such matches exist. Here we provide a novel graph indexing method to cope with the more general, inexact matching problem. Our method, SIGMA, builds on approximating a variant of the set-cover problem that
Style APA, Harvard, Vancouver, ISO itp.
34

Chang, Chen Yang, Jing Mei Zhai, Qin Xiang Xia, and Bin Cai. "Application of Particle Swarm Optimization Based on Support Vector Machine in Multi-Objective Structure Optimization." Applied Mechanics and Materials 201-202 (October 2012): 283–86. http://dx.doi.org/10.4028/www.scientific.net/amm.201-202.283.

Pełny tekst źródła
Streszczenie:
Aiming at addressing optimization problems of complex mathematical model with large amount of calculation, a method based on support vector machine and particle swarm optimization for structure optimization design was proposed. Support Vector Machine (SVM) is a powerful computational tool for problems with nonlinearity and could establish approximate structures model. Grey relational analysis was utilized to calculate the coefficient between target parameters in order to change the multi-objective optimization problem into a single objective one. The reconstructed models were solved by Particl
Style APA, Harvard, Vancouver, ISO itp.
35

Pérez-Peló, Sergio, Jesús Sánchez-Oro, Ana Dolores López-Sánchez, and Abraham Duarte. "A Multi-Objective Parallel Iterated Greedy for Solving the p-Center and p-Dispersion Problem." Electronics 8, no. 12 (2019): 1440. http://dx.doi.org/10.3390/electronics8121440.

Pełny tekst źródła
Streszczenie:
This paper generalizes the iterated greedy algorithm to solve a multi-objective facility location problem known as the Bi-objective p-Center and p-Dispersion problem ( B p C D ). The new algorithm is coined as Multi-objective Parallel Iterated Greedy (MoPIG) and optimizes more than one objective at the same time. The B p C D seeks to locate p facilities to service or cover a set of n demand points, and the goal is to minimize the maximum distance between facilities and demand points and, at the same time, maximize the minimum distance between all pairs of selected facilities. Computational res
Style APA, Harvard, Vancouver, ISO itp.
36

Liu, Yongbei, Naiming Qi, Weiran Yao, Jun Zhao, and Song Xu. "Cooperative Path Planning for Aerial Recovery of a UAV Swarm Using Genetic Algorithm and Homotopic Approach." Applied Sciences 10, no. 12 (2020): 4154. http://dx.doi.org/10.3390/app10124154.

Pełny tekst źródła
Streszczenie:
To maximize the advantages of being low-cost, highly mobile, and having a high flexibility, aerial recovery technology is important for unmanned aerial vehicle (UAV) swarms. In particular, the operation mode of “launch-recovery-relaunch” will greatly improve the efficiency of a UAV swarm. However, it is difficult to realize large-scale aerial recovery of UAV swarms because this process involves complex multi-UAV recovery scheduling, path planning, rendezvous, and acquisition problems. In this study, the recovery problem of a UAV swarm by a mother aircraft has been investigated. To solve the pr
Style APA, Harvard, Vancouver, ISO itp.
37

Sidorov, Vladimir N., and Alim M. Primkulov. "Semi-analytical solution to steady-state and transient heat transfer problem with variable conductivity properties of the domain." Vestnik MGSU, no. 5 (May 2023): 685–96. http://dx.doi.org/10.22227/1997-0935.2023.5.685-696.

Pełny tekst źródła
Streszczenie:
Introduction. Present paper studies the case of heat transfer problem where the conductivity property of the domain is not a constant value but varies depending on its temperature. In particular, a conductivity that linearly dependent onthe temperature is reviewed. A semi-analytical formulation is developed and proposed to solve steady-state and transient types of these kinds of heat transfer problems.
 Materials and methods. The domain is mathematically modeled by using finite element method where non-linearity property of the problem has been incorporated. For time-dependent (transient)
Style APA, Harvard, Vancouver, ISO itp.
38

Zhang, Yu, and Meiqi Dai. "Analysis of the Cooling and Humidification Effect of Multi-Layered Vegetation Communities in Urban Parks and Its Impact." Atmosphere 13, no. 12 (2022): 2045. http://dx.doi.org/10.3390/atmos13122045.

Pełny tekst źródła
Streszczenie:
As urbanization continues to accelerate, the urban heat island effects have become one of the most important issues affecting the urban environment and people’s living experience. Numerous studies have shown that urban parks and green spaces can effectively alleviate the problem of the urban heat island effect and provide cooling and humidifying effects. Vegetation communities are a fundamental part of urban parklands, and multi-layered vegetation communities are considered to have better cooling and humidifying effects. Previous studies have focused on comparative analyses between different c
Style APA, Harvard, Vancouver, ISO itp.
39

Kwan, Chiman, David Gribben, Bulent Ayhan, Sergio Bernabe, Antonio Plaza, and Massimo Selva. "Improving Land Cover Classification Using Extended Multi-Attribute Profiles (EMAP) Enhanced Color, Near Infrared, and LiDAR Data." Remote Sensing 12, no. 9 (2020): 1392. http://dx.doi.org/10.3390/rs12091392.

Pełny tekst źródła
Streszczenie:
Hyperspectral (HS) data have found a wide range of applications in recent years. Researchers observed that more spectral information helps land cover classification performance in many cases. However, in some practical applications, HS data may not be available, due to cost, data storage, or bandwidth issues. Instead, users may only have RGB and near infrared (NIR) bands available for land cover classification. Sometimes, light detection and ranging (LiDAR) data may also be available to assist land cover classification. A natural research problem is to investigate how well land cover classific
Style APA, Harvard, Vancouver, ISO itp.
40

Pan, Ping, Zeming Wu, Chen Yang, and Bing Zhao. "Double-Matrix Decomposition Image Steganography Scheme Based on Wavelet Transform with Multi-Region Coverage." Entropy 24, no. 2 (2022): 246. http://dx.doi.org/10.3390/e24020246.

Pełny tekst źródła
Streszczenie:
On the basis of ensuring the quality and concealment of steganographic images, this paper proposes a double-matrix decomposition image steganography scheme with multi-region coverage, to solve the problem of poor extraction ability of steganographic images under attack or interference. First of all, the cover image is transformed by multi-wavelet transform, and the hidden region covering multiple wavelet sub-bands is selected in the wavelet domain of the cover image to embed the secret information. After determining the hidden region, the hidden region is processed by Arnold transform, Hessenb
Style APA, Harvard, Vancouver, ISO itp.
41

Chabert, Maxime, and Christine Solnon. "A Global Constraint for the Exact Cover Problem: Application to Conceptual Clustering." Journal of Artificial Intelligence Research 67 (March 12, 2020): 509–47. http://dx.doi.org/10.1613/jair.1.11870.

Pełny tekst źródła
Streszczenie:

 
 
 We introduce the exactCover global constraint dedicated to the exact cover problem, the goal of which is to select subsets such that each element of a given set belongs to exactly one selected subset. This NP-complete problem occurs in many applications, and we more particularly focus on a conceptual clustering application.
 We introduce three propagation algorithms for exactCover, called Basic, DL, and DL+: Basic ensures the same level of consistency as arc consistency on a classical decomposition of exactCover into binary constraints, without using any specific data
Style APA, Harvard, Vancouver, ISO itp.
42

Liu, B., J. Chen, H. Xing, H. Wu, and J. Zhang. "A SPIRAL-BASED DOWNSCALING METHOD FOR GENERATING 30 M TIME SERIES IMAGE DATA." ISPRS - International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences XLII-2/W7 (September 13, 2017): 817–20. http://dx.doi.org/10.5194/isprs-archives-xlii-2-w7-817-2017.

Pełny tekst źródła
Streszczenie:
The spatial detail and updating frequency of land cover data are important factors influencing land surface dynamic monitoring applications in high spatial resolution scale. However, the fragmentized patches and seasonal variable of some land cover types (e. g. small crop field, wetland) make it labor-intensive and difficult in the generation of land cover data. Utilizing the high spatial resolution multi-temporal image data is a possible solution. Unfortunately, the spatial and temporal resolution of available remote sensing data like Landsat or MODIS datasets can hardly satisfy the minimum m
Style APA, Harvard, Vancouver, ISO itp.
43

Li, Shi. "Constant Approximation Algorithm for Nonuniform Capacitated Multi-Item Lot Sizing via Strong Covering Inequalities." Mathematics of Operations Research 45, no. 3 (2020): 947–65. http://dx.doi.org/10.1287/moor.2019.1018.

Pełny tekst źródła
Streszczenie:
We study the nonuniform capacitated multi-item lot-sizing problem. In this problem, there is a set of demands over a planning horizon of T discrete time periods, and all demands must be satisfied on time. We can place an order at the beginning of each period s, incurring an ordering cost Ks. In this order, we can order up to Cs units of products. On the other hand, carrying inventory from time to time incurs an inventory holding cost. The goal of the problem is to find a feasible solution that minimizes the sum of ordering and holding costs. Levi et al. [Levi R, Lodi A, Sviridenko M (2008) App
Style APA, Harvard, Vancouver, ISO itp.
44

Sharifi, Farid, Mostafa Mirzaei, Youmin Zhang, and Brandon W. Gordon. "Cooperative Multi-Vehicle Search and Coverage Problem in an Uncertain Environment." Unmanned Systems 03, no. 01 (2015): 35–47. http://dx.doi.org/10.1142/s230138501550003x.

Pełny tekst źródła
Streszczenie:
A distributed approach is proposed in this paper to address a cooperative multi-vehicle search and coverage problem in an uncertain environment such as forest fires monitoring and detection. Two different types of vehicles are used for search and coverage tasks: search and service vehicles. The search vehicles have a priori probability maps of targets in the environment. These vehicles update the probability maps based on their sensors measurements during the search mission. The search vehicles use a limited look-ahead dynamic programming algorithm to find their own path individually while the
Style APA, Harvard, Vancouver, ISO itp.
45

Noor Azam, Muhammad Harith, Farida Hazwani Mohd Ridzuan, and M. Norazizi Sham Mohd Sayuti. "Optimized Cover Selection for Audio Steganography Using Multi-Objective Evolutionary Algorithm." Journal of Information and Communication Technology 22, no. 2 (2023): 255–82. http://dx.doi.org/10.32890/jict2023.22.2.5.

Pełny tekst źródła
Streszczenie:
Existing embedding techniques depend on cover audio selected by users. Unknowingly, users may make a poor cover audio selectionthat is not optimised in its capacity or imperceptibility features, which could reduce the effectiveness of any embedding technique. As a trade-off exists between capacity and imperceptibility, producing a method focused on optimising both features is crucial. One ofthe search methods commonly used to find solutions for the trade-off problem in various fields is the Multi-Objective Evolutionary Algorithm (MOEA). Therefore, this research proposed a new method for optimi
Style APA, Harvard, Vancouver, ISO itp.
46

Seyyedi, Mir Hossein, Amir Mohammad Fakoor Saghih, Alireza Pooya, and Zahra Naji Azim. "Designing a Multi-Objective Mathematical Model for Flexible Job Shop Scheduling Problem With the Earliness/Tardiness Penalty." Journal of Social Sciences Research, no. 510 (October 5, 2019): 1375–82. http://dx.doi.org/10.32861/jssr.510.1375.1382.

Pełny tekst źródła
Streszczenie:
The scheduling of flexible job shop systems is one of the most important issues in the various fields of production and is currently being addressed by many researchers in the field of optimization issues. The present research includes flexible job shop scheduling problem (FJSSP) with multi-objective, minimizing maximum completion time (makespan), maximum machine workload, total machines workload and also, earliness/tardiness penalty with different constraints. In this research, the researcher is looking to design a mathematical model that can cover all the constraints and assumptions related
Style APA, Harvard, Vancouver, ISO itp.
47

Bejiga, Mesay Belete, Farid Melgani, and Pietro Beraldini. "Domain Adversarial Neural Networks for Large-Scale Land Cover Classification." Remote Sensing 11, no. 10 (2019): 1153. http://dx.doi.org/10.3390/rs11101153.

Pełny tekst źródła
Streszczenie:
Learning classification models require sufficiently labeled training samples, however, collecting labeled samples for every new problem is time-consuming and costly. An alternative approach is to transfer knowledge from one problem to another, which is called transfer learning. Domain adaptation (DA) is a type of transfer learning that aims to find a new latent space where the domain discrepancy between the source and the target domain is negligible. In this work, we propose an unsupervised DA technique called domain adversarial neural networks (DANNs), composed of a feature extractor, a class
Style APA, Harvard, Vancouver, ISO itp.
48

Yao, Yao, Jun-Hua Cao, Yi Guo, et al. "Adaptive coverage control for multi-USV system in complex environment with unknown obstacles." International Journal of Distributed Sensor Networks 17, no. 6 (2021): 155014772110215. http://dx.doi.org/10.1177/15501477211021525.

Pełny tekst źródła
Streszczenie:
Aiming at the shortcomings of the existing control law based on the global information, this article studies the coverage problem of a given region in the plane using a team of USVs. The coverage goal, which is to cover a given search domain using multiple mobile sensors so that each point is surveyed until a certain preset level is achieved, is formulated in a mathematically precise problem statement. The adaptive control law is presented which enables multi-USV to navigate in a complex environment in the presence of unknown obstacles and guarantees that a fully connected multi-USV system att
Style APA, Harvard, Vancouver, ISO itp.
49

Rukhovich, D. D. "2D-to-3D Projection for Monocular and Multi-View 3D Multi-class Object Detection in Indoor Scenes." Programmnaya Ingeneria 12, no. 9 (2021): 459–69. http://dx.doi.org/10.17587/prin.12.459-469.

Pełny tekst źródła
Streszczenie:
In this paper, we propose a novel method of joint 3D object detection and room layout estimation. The proposed method surpasses all existing methods of 3D object detection from monocular images on the indoor SUN RGB-D dataset. Moreover, the proposed method shows competitive results on the ScanNet dataset in multi-view mode. Both these datasets are collected in various residential, administrative, educational and industrial spaces, and altogether they cover almost all possible use cases. Moreover, we are the first to formulate and solve a problem of multi-class 3D object detection from multi-vi
Style APA, Harvard, Vancouver, ISO itp.
50

Kweon, Hyeokjoon, Jinsun Park, Sanghyun Woo, and Donghyeon Cho. "Deep Multi-Image Steganography with Private Keys." Electronics 10, no. 16 (2021): 1906. http://dx.doi.org/10.3390/electronics10161906.

Pełny tekst źródła
Streszczenie:
In this paper, we propose deep multi-image steganography with private keys. Recently, several deep CNN-based algorithms have been proposed to hide multiple secret images in a single cover image. However, conventional methods are prone to the leakage of secret information because they do not provide access to an individual secret image and often decrypt the entire hidden information all at once. To tackle the problem, we introduce the concept of private keys for secret images. Our method conceals multiple secret images in a single cover image and generates a visually similar container image con
Style APA, Harvard, Vancouver, ISO itp.
Oferujemy zniżki na wszystkie plany premium dla autorów, których prace zostały uwzględnione w tematycznych zestawieniach literatury. Skontaktuj się z nami, aby uzyskać unikalny kod promocyjny!

Do bibliografii