Results 21 to 30 of about 149,503 (282)
IEEE Access, 2022 The Minimum Weighted Connected Vertex Cover problem (MWCVC) is to find a subset $F\subset V(G)$ with minimum weight in a node-weighted graph $G$ , such that when removing the set $F$ , the inducing graph of remaining vertices holds no edges, and the ...
Qipeng Xie +4 more
doaj +1 more source
A Greedy Strategy for Coarse-Grid Selection [PDF]
SIAM Journal on Scientific Computing, 2007 Efficient solution of the very large linear systems that arise in numerical modeling of real-world applications is often only possible through the use of multilevel techniques. While highly optimized algorithms may be developed using knowledge about the origins of the matrix problem to be considered, much recent interest has been in the development of ...
S. MacLachlan, Yousef Saad
openaire +1 more source
International Journal of Computational Intelligence Systems, 2018 An improved adaptive genetic algorithm is proposed for solving 3-SAT problems based on effective restart and greedy strategy in this paper. Several new characteristics of the algorithm are developed.
Huimin Fu +5 more
doaj +1 more source
An Adaptive Network Coverage Optimization Method based on Reinforcement Learning
Guangtongxin yanjiu, 2022 With the development of 5th Generation Mobile Communication Technology (5G) and the evolution of network architecture, the analysis and optimization of network coverage need to consider comprehensive factors, including not only the link budget of the ...
Xu-dong LIU, Su ZHAO, Xiao-rong ZHU
doaj +1 more source
Sensors, 2023 In reinforcement learning, the epsilon (ε)-greedy strategy is commonly employed as an exploration technique This method, however, leads to extensive initial exploration and prolonged learning periods.
Dohyun Kyoung, Yunsick Sung
doaj +1 more source
Geographic GReedy Routing with ACO Recovery Strategy GRACO [PDF]
, 2015 Geographic routing is an attractive routing strategy in wireless sensor networks. It works well in dense networks, but it may suffer from the void problem. For this purpose, a recovery step is required to guarantee packet delivery. Face routing has widely been used as a recovery strategy since proved to guarantee delivery.
Rekik, Mouna +2 more
openaire +2 more sources
UAV Formation Adjustment Strategy Based on Greedy Criterion
Journal of Physics: Conference Series, 2023 Abstract In order to ensure that the UAV cluster remains electromagnetically silent during the attempted formation flight, so that the emission of electromagnetic wave signalsj is minimised, a purely azimuthal passive positioning method can be used to adjust the position of the UAVs.
Yiru Wang +5 more
openaire +1 more source
Greedy Strategy Works for k-Center Clustering with Outliers and Coreset Construction [PDF]
, 2019 We study the problem of k-center clustering with outliers in arbitrary metrics and Euclidean space. Though a number of methods have been developed in the past decades, it is still quite challenging to design quality guaranteed algorithm with low ...
Ding, Hu, Wang, Zixiu, Yu, Haikuo
core +2 more sources
Hierarchized Block Wise Image Approximation by Greedy Pursuit Strategies [PDF]
IEEE Signal Processing Letters, 2013 4 pages. An example and the computing routines for implementing the approach are available on http://www.nonlinear-approx.info/examples/node0 ...
Rebollo-Neira, Laura +2 more
openaire +2 more sources
The greedy strategy for optimizing the Perron eigenvalue [PDF]
Mathematical Programming, 2020 AbstractWe address the problems of minimizing and of maximizing the spectral radius over a compact family of non-negative matrices. Those problems being hard in general can be efficiently solved for some special families. We consider the so-called product families, where each matrix is composed of rows chosen independently from given sets.
Cvetkovic A., Protasov V. Y.
openaire +1 more source