Log in

Relevant bibliographies by topics / Mapping Algorithm / Journal articles

To see the other types of publications on this topic, follow the link: Mapping Algorithm.

Journal articles on the topic 'Mapping Algorithm'

Author: Grafiati

Published: 4 June 2021

Last updated: 25 July 2025

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

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Mapping Algorithm.'

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.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Seliverstov, E. Yu. "Structural Mapping of Global Optimization Algorithms to Graphics Processing Unit Architecture." Herald of the Bauman Moscow State Technical University. Series Instrument Engineering, no. 2 (139) (June 2022): 42–59. http://dx.doi.org/10.18698/0236-3933-2022-2-42-59.

Full text

Abstract:

Graphics processing units (GPU) deliver a high execution efficiency for modern metaheuristic algorithms with a high computation complexity. It is crucial to have an optimal task mapping of the optimization algorithm to the parallel system architecture which strongly affects the efficiency of the optimization process. The paper proposes a novel task mapping algorithm of the parallel metaheuristic algorithm to the GPU architecture, describes problem statement for the mapping of algorithm graph model to the GPU model, and gives a formal definition of graph mapping and mapping restrictions. The al

APA, Harvard, Vancouver, ISO, and other styles

2

BAIYA, SUPARAT, and KASAMSUK UNGCHITTRAKOOL. "Modified inertial Mann’s algorithm and inertial hybrid." Carpathian Journal of Mathematics 39, no. 1 (2022): 27–43. http://dx.doi.org/10.37193/cjm.2023.01.02.

Full text

Abstract:

"In this work, we introduce and study the modified inertial Mann’s algorithm and inertial hybrid algorithm for approximating some fixed points of a k-strict pseudo-contractive mapping in Hilbert spaces. Weak convergence to a solution of fixed-point problems for a k-strict pseudo-contractive mapping is obtained by using the modified inertial Mann’s algorithm. In order to obtain strong convergence, we introduce an inertial hybrid algorithm by using the inertial extrapolation method mixed with the convex combination of three iterated vectors and forcing for strong convergence by the hybrid projec

APA, Harvard, Vancouver, ISO, and other styles

3

Younis, Mudasir, Aadil Dar, and Nawab Hussain. "Revised algorithm for finding a common solution of variational inclusion and fixed point problems." Filomat 37, no. 20 (2023): 6949–60. http://dx.doi.org/10.2298/fil2320949y.

Full text

Abstract:

Recent research has uncovered an algorithm for locating the common solution to variational inclusion problems with multivalued maximal monotone mapping and ?-inverse strongly monotone mapping, as well as the points that are invariant under non-expansive mapping. In their algorithm, Zhang et al. [S. Zhang, J. H. W. Lee, C. K. Chan, Algorithms of common solutions to quasi-variational inclusion and fixed point problems, Appl. Math. Mech. 29(5) (2008), 571-581.], ? must satisfy a very strict condition, namely ? ? [0, 2?]; thus, it cannot be used for all Lipschitz continuous mappings, despite the f

APA, Harvard, Vancouver, ISO, and other styles

4

CHUNG, I.-HSIN, CHE-RUNG LEE, JIAZHENG ZHOU, and YEH-CHING CHUNG. "HIERARCHICAL MAPPING FOR HPC APPLICATIONS." Parallel Processing Letters 21, no. 03 (2011): 279–99. http://dx.doi.org/10.1142/s0129626411000229.

Full text

Abstract:

As the high performance computing systems scale up, mapping the tasks of a parallel application onto physical processors to allow efficient communication becomes one of the critical performance issues. Existing algorithms were usually designed to map applications with regular communication patterns. Their mapping criterion usually overlooks the size of communicated messages, which is the primary factor of communication time. In addition, most of their time complexities are too high to process large scale problems. In this paper, we present a hierarchical mapping algorithm (HMA), which is capab

APA, Harvard, Vancouver, ISO, and other styles

5

He, Tengyuan, Weijun Lu, and Pengju Li. "Fast mapping algorithm with optimized placement selection for CGRA." Journal of Physics: Conference Series 2849, no. 1 (2024): 012106. http://dx.doi.org/10.1088/1742-6596/2849/1/012106.

Full text

Abstract:

Abstract In the field of parallel computing, Coarse-Grained Reconfigurable Architecture (CGRA) is a promising technique for processing parallel applications. Application kernels are mapped on CGRA through the calculation of mapping algorithms. This paper presents a Fast Mapping Algorithm with Optimized Placement Selection for mapping application kernels on CGRAs. The mapping algorithm incorporates heuristic optimizations for processing element (PE) selection based on Hycube Mapping Algorithm and reduces the redundant extra calculation procedures to achieve fast DFG mapping. In algorithm tests

APA, Harvard, Vancouver, ISO, and other styles

6

Aleomraninejad, Seyed, Kanokwan Sitthithakerngkiet, and Poom Kumam. "Hybrid subgradient algorithm for equilibrium and fixed point problems by approximation of nonexpansive mapping." Filomat 34, no. 5 (2020): 1721–29. http://dx.doi.org/10.2298/fil2005721a.

Full text

Abstract:

In this paper anew algorithm considered on a real Hilbert space for finding acommonpoint in the solution set of a class of pseudomonotone equilibrium problem and the set of fixed points of nonexpansive mappings. We produce this algorithm by mappings Tk that are approximations of non-expansive mapping T. The strong convergence theorem of the proposed algorithms is investigated. Our results generalize some recent results in the literature.

APA, Harvard, Vancouver, ISO, and other styles

7

Shrivas, Jaynendra, Rohit Kumar Verma, and Priya Chandraker. "On fixed point convergence results for class of nonexpansivemappings in hyperbolic spaces via PJ iteration process." International Journal of Applied Mathematical Research 13, no. 1 (2024): 12–19. http://dx.doi.org/10.14419/2wamtj79.

Full text

Abstract:

In this paper, we provide certain fixed point results for a mean nonexpansive mapping, as well as a new iterative algorithm called PJ-iterationfor approximating the fixed point of this class of mappings in the setting of hyperbolic spaces. Furthermore, we establish strong and∆-convergence theorem for mean nonexpansive mapping in hyperbolic space. Finally, we present a numerical example to illustrate ourmain result and then display the efficiency of the proposed algorithm compared to different iterative algorithms in the literature. Our resultsobtained in this paper improve, extend and unify so

APA, Harvard, Vancouver, ISO, and other styles

8

Komatsu, Yuki, and Pierre Jais. "Practical Mapping Algorithm." Cardiac Electrophysiology Clinics 5, no. 2 (2013): 161–68. http://dx.doi.org/10.1016/j.ccep.2013.01.008.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Villaseñor, Carlos, Nancy Arana-Daniel, Alma Alanis, Carlos Lopez-Franco, and Javier Gomez-Avila. "Multiellipsoidal Mapping Algorithm." Applied Sciences 8, no. 8 (2018): 1239. http://dx.doi.org/10.3390/app8081239.

Full text

Abstract:

The robotic mapping problem, which consists in providing a spatial model of the environment to a robot, is a research topic with a wide range of applications. One important challenge of this problem is to obtain a map that is information-rich (i.e., a map that preserves main structures of the environment and object shapes) yet still has a low memory cost. Point clouds offer a highly descriptive and information-rich environmental representation; accordingly, many algorithms have been developed to approximate point clouds and lower the memory cost. In recent years, approaches using basic and “si

APA, Harvard, Vancouver, ISO, and other styles

10

Niu, Xiaoqiang, Hao Lan, and Dan Zeng. "Research on Intelligent Mapping Algorithm of Secure Virtual Network under Cloud Computing." Wireless Communications and Mobile Computing 2022 (May 9, 2022): 1–10. http://dx.doi.org/10.1155/2022/4976176.

Full text

Abstract:

In order to improve the mapping efficiency of network intelligent mapping algorithm, this paper proposes a secure virtual network intelligent mapping algorithm under cloud computing. Firstly, the network virtualization technology is analyzed, and a network virtualization example diagram is proposed. Then the energy consumption model and network load model of virtual network mapping problem are constructed to analyze the mapping reliability. Finally, the virtual network mapping strategy is optimized by cloud computing technology to realize the research on intelligent mapping algorithm of secure

APA, Harvard, Vancouver, ISO, and other styles

11

Vargas-Vera, Maria, and Miklos Nagy. "Architecture of DSSim." International Journal of Knowledge Society Research 6, no. 2 (2015): 65–82. http://dx.doi.org/10.4018/ijksr.2015040104.

Full text

Abstract:

This paper presents the architecture of DSSim (DSSim stands for Similarity based on Dempster-Shafer) our multi-agent ontology mapping system. It describes several types of agents and their roles in the DSSim architecture. These agents are mapping agents which are able to perform either semantic or syntactic similarity. The authors' architecture is generic as no mappings need to be learned in advance and it could be easily extended by adding new mapping agents in the framework. These new mapping agents could run different similarity algorithms either semantic or syntactic. In this way, DSSim co

APA, Harvard, Vancouver, ISO, and other styles

12

Vargas-Vera, Maria. "The Implementation of DSSim." International Journal of Knowledge Society Research 8, no. 3 (2017): 34–53. http://dx.doi.org/10.4018/ijksr.2017070103.

Full text

Abstract:

This paper presents the decisions taken during the implementation of DSSim (DSSim stands for Similarity based on Dempster-Shafer) our multi-agent ontology mapping system. It describes several types of agents and their roles in the DSSim architecture. These agents are mapping agents which are able to perform either semantic or syntactic similarity. Our architecture is generic as no mappings need to be learned in advance and it could be easily extended by adding new mapping agents in the framework. The new added mapping agents could run different similarity algorithms (either semantic or syntact

APA, Harvard, Vancouver, ISO, and other styles

13

Zhang, Jingling, Yongfu Su, and Qingqing Cheng. "Hybrid Algorithm of Fixed Point for Weak Relatively Nonexpansive Multivalued Mappings and Applications." Abstract and Applied Analysis 2012 (2012): 1–13. http://dx.doi.org/10.1155/2012/479438.

Full text

Abstract:

The purpose of this paper is to present the notion of weak relatively nonexpansive multi-valued mapping and to prove the strong convergence theorems of fixed point for weak relatively nonexpansive multivalued mappings in Banach spaces. The weak relatively nonexpansive multivalued mappings are more generalized than relatively nonexpansive multivalued mappings. In this paper, an example will be given which is a weak relatively nonexpansive multivalued mapping but not a relatively nonexpansive multivalued mapping. In order to get the strong convergence theorems for weak relatively nonexpansive mu

APA, Harvard, Vancouver, ISO, and other styles

14

Xia, Xun, and Ling Chen. "Elastic Optical Network Service-Oriented Architecture (SOA) Used for Cloud Computing and Its Resource Mapping Optimization Scheme." Journal of Nanoelectronics and Optoelectronics 15, no. 4 (2020): 442–49. http://dx.doi.org/10.1166/jno.2020.2783.

Full text

Abstract:

In this study, starting from the elastic optical network, the layered and function isolated service-oriented architecture (SOA) is introduced, so as to propose an elastic optical network SOA for cloud computing, and further study the resource mapping of optical network. Linear mapping model, random routing mapping algorithm, load balancing mapping algorithm and link separation mapping algorithm are introduced respectively, and the resource utilization effect of different mapping algorithms for the proposed optical network is compared. During the experiment, firstly, the elastic optical network

APA, Harvard, Vancouver, ISO, and other styles

15

Li, Ke, Jingbo Shao, and Yan Song. "ET: A Metaheuristic Optimization Algorithm for Task Mapping in Network-on-Chip." Electronics 14, no. 14 (2025): 2846. https://doi.org/10.3390/electronics14142846.

Full text

Abstract:

In Network-on-Chip (NoC) research, the task mapping problem has attracted considerable attention as a core issue influencing system performance. As an NP-hard problem, it remains challenging, and existing algorithms exhibit limitations in both mapping quality and computational efficiency. To address this, a method named ET (Enhanced Coati Optimization Algorithm) is proposed, which leverages the nature-inspired Coati Optimization Algorithm (COA) for task mapping. An incremental hill-climbing strategy is integrated to improve local search capabilities, and a dynamic mechanism for adjusting the e

APA, Harvard, Vancouver, ISO, and other styles

16

Sun, Jin, and Yi Zhang. "A Communication Probability-Based Mapping Algorithm for Mesh-Based Network-on-Chip Systems." Journal of Circuits, Systems and Computers 27, no. 14 (2018): 1850226. http://dx.doi.org/10.1142/s0218126618502262.

Full text

Abstract:

Network-on-chip (NoC) mapping algorithms significantly affect NoC system performance in terms of communication cost and energy consumption. For a specific application represented by a task graph, this paper proposes an energy-efficient mapping algorithm that searches for the mapping decision with best communication locality and therefore lowest energy consumption. To this end, we formulate the concerned mapping problem as an optimization model, and propose an effective meta-heuristic algorithm to solve the formulated optimization model. During the mapping procedure, we employ a simulation-free

APA, Harvard, Vancouver, ISO, and other styles

17

Heirich, A. "A Scalable Diffusion Algorithm for Dynamic Mapping and Load Balancing on Networks of Arbitrary Topology." International Journal of Foundations of Computer Science 08, no. 03 (1997): 329–46. http://dx.doi.org/10.1142/s0129054197000215.

Full text

Abstract:

The problems of mapping and load balancing applications on arbitrary networks are considered. A novel diffusion algorithm is presented to solve the mapping problem. It complements the well known diffusion algorithms for load balancing which have enjoyed success on massively parallel computers (MPPs). Mapping is more difficult on interconnection networks than on MPPs because of the variations which occur in network topology. Popular mapping algorithms for MPPs which depend on recursive topologies are not applicable to irregular networks. The most celebrated of these MPP algorithms use informati

APA, Harvard, Vancouver, ISO, and other styles

18

Et. al., Siva Sankara Phani T. ,. "CGRA MODULO SCHEDULING FOR ACHIEVING BETTER PERFORMANCE AND INCREASED EFFICIENCY." Turkish Journal of Computer and Mathematics Education (TURCOMAT) 12, no. 4 (2021): 1400–1413. http://dx.doi.org/10.17762/turcomat.v12i4.1225.

Full text

Abstract:

Coarse-Grained Reconfigurable Architectures (CGRA) is an effective solution for speeding up computer-intensive activities due to its high energy efficiency and flexibility sacrifices. The timely implementation of CGRA loops was one of the hardest problems in the analysis. Modulo scheduling (MS) was productive in order to implement loops on CGRAs. The problem remains with current MS algorithms, namely to map large and irregular circuits to CGRAs over a fair period of compilation with restricted computational and high-performance routing tools. This is mainly due to an absence of awareness of ma

APA, Harvard, Vancouver, ISO, and other styles

19

Zhang, Jingzhi. "Research on Laser SLAM Mapping and Navigation Algorithm Based on Improved Cartographer Algorithm and Path Planning Algorithm." International Journal of Computer Science and Information Technology 6, no. 2 (2025): 1–18. https://doi.org/10.62051/ijcsit.v6n2.01.

Full text

Abstract:

Aiming at the problems of high environmental sensitivity, poor mapping effect and poor autonomous navigation and positioning accuracy of traditional laser SLAM mapping in complex environments, a lidar mapping algorithm based on the improved Cartographer algorithm and a path planning algorithm based on multi-algorithm fusion are proposed. Firstly, the radar data is dedistorted by using the feature extraction method of the curvature size in LIO-SAM to generate high-quality point clouds. Then, the adaptive untraced Kalman filtering algorithm is used to fuse the IMU and odometer data to obtain mor

APA, Harvard, Vancouver, ISO, and other styles

20

Zhang, Jinwei, Xijing Zhu, and Jing Li. "Intelligent Path Planning with an Improved Sparrow Search Algorithm for Workshop UAV Inspection." Sensors 24, no. 4 (2024): 1104. http://dx.doi.org/10.3390/s24041104.

Full text

Abstract:

Intelligent workshop UAV inspection path planning is a typical indoor UAV path planning technology. The UAV can conduct intelligent inspection on each work area of the workshop to solve or provide timely feedback on problems in the work area. The sparrow search algorithm (SSA), as a novel swarm intelligence optimization algorithm, has been proven to have good optimization performance. However, the reduction in the SSA’s search capability in the middle or late stage of iterations reduces population diversity, leading to shortcomings of the algorithm, including low convergence speed, low solutio

APA, Harvard, Vancouver, ISO, and other styles

21

Turney, P. D. "The Latent Relation Mapping Engine: Algorithm and Experiments." Journal of Artificial Intelligence Research 33 (December 22, 2008): 615–55. http://dx.doi.org/10.1613/jair.2693.

Full text

Abstract:

Many AI researchers and cognitive scientists have argued that analogy is the core of cognition. The most influential work on computational modeling of analogy-making is Structure Mapping Theory (SMT) and its implementation in the Structure Mapping Engine (SME). A limitation of SME is the requirement for complex hand-coded representations. We introduce the Latent Relation Mapping Engine (LRME), which combines ideas from SME and Latent Relational Analysis (LRA) in order to remove the requirement for hand-coded representations. LRME builds analogical mappings between lists of words, using a large

APA, Harvard, Vancouver, ISO, and other styles

22

NITHIARAYAPHAKS, WORAPHAK, and WUTIPHOL SINTUNAVARAT. "On approximating fixed points of weak enriched contraction mappings via Kirk's iterative algorithm in Banach spaces." Carpathian Journal of Mathematics 39, no. 2 (2022): 423–32. http://dx.doi.org/10.37193/cjm.2023.02.07.

Full text

Abstract:

Recently Berinde and Păcurar [Approximating fixed points of enriched contractions in Banach spaces. {\em J. Fixed Point Theory Appl.} {\bf 22} (2020), no. 2., 1--10], first introduced the idea of enriched contraction mappings and proved the existence of a fixed point of an enriched contraction mapping using the well-known fact that any fixed point of {the averaged mapping $T_\lambda$, where $\lambda\in (0,1]$, is also a fixed point of the initial mapping $T$}. In this work, we introduce the idea of weak enriched contraction mappings, and a new generalization of an averaged mapping called doubl

APA, Harvard, Vancouver, ISO, and other styles

23

Zhou, Hao, and Haochang Bi. "Wireless Sensor Network Security Based on Improved Identity Encryption." Scientific Programming 2022 (April 1, 2022): 1–10. http://dx.doi.org/10.1155/2022/2308825.

Full text

Abstract:

In order to protect network information security and improve the security of wireless sensor networks, based on chaotic systems, we propose a wireless sensor algorithm based on improved identity encryption. First, the basic principle of chaotic system mapping is specifically analyzed; the two chaotic mapping systems are rectified to obtain the hybrid chaotic mapping system according to the demand of wireless sensing network. After that, an encryption framework and key are designed and the hybrid mapping system is applied to the encryption framework to encrypt the data. In this way, the length

APA, Harvard, Vancouver, ISO, and other styles

24

Ai, Sumei, and Yongfu Su. "Hybrid Algorithm for Common Fixed Points of Uniformly Closed Countable Families of Hemirelatively Nonexpansive Mappings and Applications." Journal of Applied Mathematics 2012 (2012): 1–20. http://dx.doi.org/10.1155/2012/401960.

Full text

Abstract:

The authors have obtained the following results: (1) the definition of uniformly closed countable family of nonlinear mappings, (2) strong convergence theorem by the monotone hybrid algorithm for two countable families of hemirelatively nonexpansive mappings in a Banach space with new method of proof, (3) two examples of uniformly closed countable families of nonlinear mappings and applications, (4) an example which is hemirelatively nonexpansive mapping but not weak relatively nonexpansive mapping, and (5) an example which is weak relatively nonexpansive mapping but not relatively nonexpansiv

APA, Harvard, Vancouver, ISO, and other styles

25

Song, De Rui, Ke Cao, and Yu Hao. "The Implement of Parcel Sea Map Automatic Mapping Algorithm." Advanced Materials Research 989-994 (July 2014): 1891–94. http://dx.doi.org/10.4028/www.scientific.net/amr.989-994.1891.

Full text

Abstract:

Parcel Sea Map mapping is currently implemented by manual, which causes the task tedious and error prone. To overcome this problem, this paper proposes an automatic mapping method for Parcel Sea Map. The boundary point data are basic mapping elements, which are obtained from sea cadastral survey. The mapping result can be demonstrated by two aspects: convex polygon and concave polygon. For convex polygon, well known left-turn and convex hull algorithms are adopted. For concave polygon, two algorithms are proposed. One is enumeration and the other is cutting algorithm. The above two mapping res

APA, Harvard, Vancouver, ISO, and other styles

26

Maibed, Zena H., and Noor N. Salem. "On the Stability and Acceleration of Projection Algorithms." Ibn AL-Haitham Journal For Pure and Applied Sciences 36, no. 1 (2023): 292–99. http://dx.doi.org/10.30526/36.1.2923.

Full text

Abstract:

The focus of this paper is the presentation of a new type of mapping called projection Jungck zn- Suzuki generalized and also defining new algorithms of various types (one-step and two-step algorithms) (projection Jungck-normal N algorithm, projection Jungck-Picard algorithm, projection Jungck-Krasnoselskii algorithm, and projection Jungck-Thianwan algorithm). The convergence of these algorithms has been studied, and it was discovered that they all converge to a fixed point. Furthermore, using the previous three conditions for the lemma, we demonstrated that the difference between any two sequ

APA, Harvard, Vancouver, ISO, and other styles

27

K, A. Kiran, and Jaison Jacob. "Energy-aware Application Mapping onto 3D Mesh-Based Network-on-Chip using Heuristic Mapping Algorithms." JUCS - Journal of Universal Computer Science 31, no. (2) (2025): 136–58. https://doi.org/10.3897/jucs.123539.

Full text

Abstract:

Network-on-chip (NoC) architectures have emerged as a potential solution for facilitating communication between processing elements (PEs) in modern multi-core systems. The design and optimization of NoC architectures are critical for achieving efficient communication, reduced energy consumption, and improved overall system performance. In this study, we investigate and compare the performance of two prominent optimization algorithms, like Genetic Algorithm (GA) and CastNet Algorithm, for 2D and 3D mesh NoC architectures. The study's objective is to estimate these algorithms' effectiveness in o

APA, Harvard, Vancouver, ISO, and other styles

28

Ryma, Guefrouchi, and Kholladi Mohamed-Khireddine. "Genetic Algorithm With Hill Climbing for Correspondences Discovery in Ontology Mapping." Journal of Information Technology Research 12, no. 4 (2019): 153–70. http://dx.doi.org/10.4018/jitr.2019100108.

Full text

Abstract:

Meta-heuristics are used as a tool for ontology mapping process in order to improve their performance in mapping quality and computational time. In this article, ontology mapping is resolved as an optimization problem. It aims at optimizing correspondences discovery between similar concepts of source and target ontologies. For better guiding and accelerating the concepts correspondences discovery, the article proposes a meta-heuristic hybridization which incorporates the Hill Climbing method within the mutation operator in the genetic algorithm. For test concerns, syntactic and lexical similar

APA, Harvard, Vancouver, ISO, and other styles

29

Weng, Xiaodong, Yi Liu, Changqing Xu, et al. "A Machine Learning Mapping Algorithm for NoC Optimization." Symmetry 15, no. 3 (2023): 593. http://dx.doi.org/10.3390/sym15030593.

Full text

Abstract:

Network on chip (NoC) is a promising solution to the challenge of multi-core System-on-Chip (SoC) communication design. Application mapping is the first and most important step in the NoC synthesis flow, which determines most of the NoC design performance. NoC mapping has been confirmed as an NP-hard (Non-Polynomial hard) problem, which could not be solved in polynomial time. Various heuristic mapping algorithms have been applied to the mapping problem. However, the heuristic algorithm easily falls into a local optimal solution which causes performance loss. Additionally, regular topologies of

APA, Harvard, Vancouver, ISO, and other styles

30

K A, Kiran, and Jaison Jacob. "Energy-aware Application Mapping onto 3D Mesh-Based Network-on-Chip using Heuristic Mapping Algorithms." JUCS - Journal of Universal Computer Science 31, no. 2 (2025): 136–58. https://doi.org/10.3897/jucs.123539.

Full text

Abstract:

Network-on-chip (NoC) architectures have emerged as a potential solution for facilitating communication between processing elements (PEs) in modern multi-core systems. The design and optimization of NoC architectures are critical for achieving efficient communication, reduced energy consumption, and improved overall system performance. In this study, we investigate and compare the performance of two prominent optimization algorithms, like Genetic Algorithm (GA) and CastNet Algorithm, for 2D and 3D mesh NoC architectures. The study&rsquo;s objective is to estimate these algorithms&rsquo

APA, Harvard, Vancouver, ISO, and other styles

31

Zhang, Huan, Xiaolan Liu, Yan Sun, and Ju Hu. "An Alternated Inertial Projection Algorithm for Multi-Valued Variational Inequality and Fixed Point Problems." Mathematics 11, no. 8 (2023): 1850. http://dx.doi.org/10.3390/math11081850.

Full text

Abstract:

In this paper, we propose an alternated inertial projection algorithm for solving multi-valued variational inequality problem and fixed point problem of demi-contractive mapping. On one hand, this algorithm only requires the mapping is pseudo-monotone. On the other hand, this algorithm is combined with the alternated inertial method to accelerate the convergence speed. The global convergence of the algorithm can be obtained under mild conditions. Preliminary numerical results show that the convergence speed of our algorithm is faster than some existing algorithms.

APA, Harvard, Vancouver, ISO, and other styles

32

Mirzaei, Saham, Simone Pascucci, Maria Francesca Carfora, et al. "Early-Season Crop Mapping by PRISMA Images Using Machine/Deep Learning Approaches: Italy and Iran Test Cases." Remote Sensing 16, no. 13 (2024): 2431. http://dx.doi.org/10.3390/rs16132431.

Full text

Abstract:

Despite its high importance for crop yield prediction and monitoring, early-season crop mapping is severely hampered by the absence of timely ground truth. To cope with this issue, this study aims at evaluating the capability of PRISMA hyperspectral satellite images compared with Sentinel-2 multispectral imagery to produce early- and in-season crop maps using consolidated machine and deep learning algorithms. Results show that the accuracy of crop type classification using Sentinel-2 images is meaningfully poor compared with PRISMA (14% in overall accuracy (OA)). The 1D-CNN algorithm, with 89%

APA, Harvard, Vancouver, ISO, and other styles

33

Cheng, Shi, Quande Qin, Junfeng Chen, Yuhui Shi, and Qingyu Zhang. "Analytics on Fireworks Algorithm Solving Problems with Shifts in the Decision Space and Objective Space." International Journal of Swarm Intelligence Research 6, no. 2 (2015): 52–86. http://dx.doi.org/10.4018/ijsir.2015040103.

Full text

Abstract:

Fireworks algorithms for solving problems with the optima shift in decision space and/or objective space are analyzed in this paper. The standard benchmark problems have several weaknesses in the research of swarm intelligence algorithms for solving single objective problems. The optimum is in the center of search range, and is the same at each dimension of the search space. The optimum shift in decision space and/or objective space could increase the difficulty of problem solving. A mapping strategy, modular arithmetic mapping, is utilized in the original fireworks algorithm to handle solutio

APA, Harvard, Vancouver, ISO, and other styles

34

Alakoya, Timilehin Opeyemi, Lateef Olakunle Jolaoso, and Oluwatosin Temitope Mewomo. "Two modifications of the inertial Tseng extragradient method with self-adaptive step size for solving monotone variational inequality problems." Demonstratio Mathematica 53, no. 1 (2020): 208–24. http://dx.doi.org/10.1515/dema-2020-0013.

Full text

Abstract:

AbstractIn this work, we introduce two new inertial-type algorithms for solving variational inequality problems (VIPs) with monotone and Lipschitz continuous mappings in real Hilbert spaces. The first algorithm requires the computation of only one projection onto the feasible set per iteration while the second algorithm needs the computation of only one projection onto a half-space, and prior knowledge of the Lipschitz constant of the monotone mapping is not required in proving the strong convergence theorems for the two algorithms. Under some mild assumptions, we prove strong convergence resu

APA, Harvard, Vancouver, ISO, and other styles

35

Hamedani, Parisa Khadem, Natalie Enright Jerger, Shaahin Hessabi, and Hamid Sarbazi-Azad. "Exploration of Temperature Constraints for Thermal-Aware Mapping of 3D Networks-on-Chip." International Journal of Adaptive, Resilient and Autonomic Systems 4, no. 3 (2013): 42–60. http://dx.doi.org/10.4018/jaras.2013070103.

Full text

Abstract:

This paper proposes three ILP-based static thermal-aware mapping algorithms for 3D Networks-on-Chip (NoC). With these three mapping algorithms, the authors explore the thermal constraints and their effects on temperature and performance. Through complexity analysis, the authors show that the first algorithm, an optimal one, is not suitable for 3D NoCs. Therefore, the authors develop two approximation algorithms and analyze their algorithmic complexities to show their proficiency. According to simulation results, mapping algorithms that employ direct thermal calculation to minimize the temperat

APA, Harvard, Vancouver, ISO, and other styles

36

Gao, Xianming, Baosheng Wang, and Xiaozhe Zhang. "VR-Cluster: Dynamic Migration for Resource Fragmentation Problem in Virtual Router Platform." Scientific Programming 2016 (2016): 1–14. http://dx.doi.org/10.1155/2016/3976965.

Full text

Abstract:

Network virtualization technology is regarded as one of gradual schemes to network architecture evolution. With the development of network functions virtualization, operators make lots of effort to achieve router virtualization by using general servers. In order to ensure high performance, virtual router platform usually adopts a cluster of general servers, which can be also regarded as a special cloud computing environment. However, due to frequent creation and deletion of router instances, it may generate lots of resource fragmentation to prevent platform from establishing new router instanc

APA, Harvard, Vancouver, ISO, and other styles

37

Yu, Jie, Ting-Hai Yu, Qing-Yong Zhang, and Trong-The Nguyen. "NI-LIO: A Hybrid Approach Combining ICP and NDT for Improving Simultaneous Localization and Mapping Performance." Electronics 14, no. 1 (2025): 178. https://doi.org/10.3390/electronics14010178.

Full text

Abstract:

The accuracy and stability of front-end point cloud registration algorithms are crucial for the mapping and localization precision in laser SLAM (simultaneous localization and mapping) systems. Traditional point-to-line and point-to-plane iterative closest point (ICP) registration algorithms, widely used in SLAM front ends, often suffer from low efficiency, significant data dependency during the matching process, and a propensity for local optima. This registration method exhibits a more pronounced local optimum issue in large-scale SLAM mapping, thereby diminishing matching accuracy and incre

APA, Harvard, Vancouver, ISO, and other styles

38

SHEN, C. W., R. C. T. LEE, and Y. H. CHIN. "A PARALLEL NONLINEAR MAPPING ALGORITHM." International Journal of Pattern Recognition and Artificial Intelligence 01, no. 01 (1987): 53–69. http://dx.doi.org/10.1142/s0218001487000059.

Full text

Abstract:

In this paper, we shall present a parallel algorithm to perform nonlinear mapping which is useful for clustering analysis and pattern recognition. This parallel nonlinear mapping algorithm is slightly different from the original nonlinear mapping algorithm. Experimental results show that our parallel nonlinear mapping algorithm works quite well.

APA, Harvard, Vancouver, ISO, and other styles

39

Liu, Chunyuan, and Qun Ding. "A Color Image Encryption Scheme Based on a Novel 3D Chaotic Mapping." Complexity 2020 (December 23, 2020): 1–20. http://dx.doi.org/10.1155/2020/3837209.

Full text

Abstract:

Low-dimensional chaotic mappings are simple functions that have low computation cost and are easy to realize, but applying them in a cryptographic algorithm will lead to security vulnerabilities. To overcome this shortcoming, this paper proposes the coupled chaotic system, which coupled the piecewise and Henon mapping. Simulation results indicate that the novel mapping has better complexity and initial sensitivity and larger key space compared with the original mapping. Then, a new color image encryption algorithm is proposed based on the new chaotic mapping. The algorithm has two processes: d

APA, Harvard, Vancouver, ISO, and other styles

40

Zhao, Yanchun, Senlin Bi, Huanlong Zhang, and Zhiwu Chen. "Dynamic Weight and Mapping Mutation Operation-Based Salp Swarm Algorithm for Global Optimization." Applied Sciences 13, no. 15 (2023): 8960. http://dx.doi.org/10.3390/app13158960.

Full text

Abstract:

The salp swarm algorithm imitates the swarm behavior of salps during navigation and hunting that has been proven the superiority of search for best solution. However, although it has sufficient global search ability, it is still worth paying attention to problems of falling into local optima and lower convergence accuracy. This paper proposes some improvements to the salp swarm algorithm that are based on a nonlinear dynamic weight and the mapping mutation operation. Firstly, the nonlinear dynamic weight is helpful for further optimizing the transition from exploration to exploitation and alle

APA, Harvard, Vancouver, ISO, and other styles

41

PENG, BO, and HONG-KUN XU. "A cyclic coordinate-update fixed point algorithm." Carpathian Journal of Mathematics 35, no. 3 (2019): 365–70. http://dx.doi.org/10.37193/cjm.2019.03.10.

Full text

Abstract:

We prove that a cyclic coordinate fixed point algorithm for nonexpansive mappings when the underlying Hilbert space is decomposed into a Cartesian product of finitely many block spaces is weakly convergent to a fixed point of the mapping under investigation. Our result relaxes a condition imposed on the stepsizes of Theorem 3.4 of Chow, et al [Chow, Y. T., Wu, T. and Yin, W., Cyclic coordinate-update algorithms for fixed-point problems: analysis and applcations, SIAM J. Sci. Comput., 39 (2017), No. 4, A1280–A1300].

APA, Harvard, Vancouver, ISO, and other styles

42

Singh, Watanjeet, and Sumit Chandok. "A Modified Form of Inertial Viscosity Projection Methods for Variational Inequality and Fixed Point Problems." Journal of Mathematics 2024 (February 19, 2024): 1–18. http://dx.doi.org/10.1155/2024/9509788.

Full text

Abstract:

This paper aims to introduce an iterative algorithm based on an inertial technique that uses the minimum number of projections onto a nonempty, closed, and convex set. We show that the algorithm generates a sequence that converges strongly to the common solution of a variational inequality involving inverse strongly monotone mapping and fixed point problems for a countable family of nonexpansive mappings in the setting of real Hilbert space. Numerical experiments are also presented to discuss the advantages of using our algorithm over earlier established algorithms. Moreover, we solve a real-l

APA, Harvard, Vancouver, ISO, and other styles

43

Usurelu, Gabriela Ioana, Teodor Turcanu, and Mihai Postolache. "Algorithm for Two Generalized Nonexpansive Mappings in Uniformly Convex Spaces." Mathematics 10, no. 3 (2022): 318. http://dx.doi.org/10.3390/math10030318.

Full text

Abstract:

In this paper, we study the common fixed-point problem for a pair of García-Falset mapping and (α,β)-generalized hybrid mapping in uniformly convex Banach spaces. For this purpose, we construct a modified three-step iteration by properly including together these two types of mappings into its formula. Under this modified iteration, a necessary and sufficient condition for the existence of a common fixed point as well as weak and strong convergence outcomes are phrased under some additional conditions.

APA, Harvard, Vancouver, ISO, and other styles

44

Li, Yuanzhen, and Yingyu Zhang. "EPVNE: An Efficient Parallelizable Virtual Network Embedding Algorithm." Wireless Communications and Mobile Computing 2019 (November 22, 2019): 1–10. http://dx.doi.org/10.1155/2019/8416592.

Full text

Abstract:

Virtual network embedding (VNE) problem is a key issue in network virtualization technology, and much attention has been paid to the virtual network embedding. However, very little research work focuses on parallelized virtual network embedding problems which assumes that the substrate infrastructure supports parallel computing and allows one virtual node to be mapped to multiple substrate nodes. Based on the work of Liang and Zhang, we extend the well-known VNE to parallelizable virtual network embedding (PVNE) in this paper. Furthermore, to the best of our knowledge, we give the first formul

APA, Harvard, Vancouver, ISO, and other styles

45

Liao, Heng, and Huadong Huang. "A multi strategy improved pigeon-inspired optimization algorithm." ITM Web of Conferences 47 (2022): 02002. http://dx.doi.org/10.1051/itmconf/20224702002.

Full text

Abstract:

Pigeon-inspired optimization algorithm is easy to fall into local optimization and low convergence accuracy in solving nonlinear optimization problems. In this paper, an improved pigeon-inspired optimization algorithm called Gaussian mixture pigeon-inspired optimization algorithm (GPIO) is proposed. In GPIO, the cubic mapping of chaotic mapping method is used to initialize the pigeon population, which increases the diversity of the population. Gaussian mutation operator is introduced to change the shortage that pigeon swarm algorithm is easy to fall into local optimization, and improve the con

APA, Harvard, Vancouver, ISO, and other styles

46

Yang, Lei, Xin Hu, Hui Wang, Wensheng Zhang, Kang Huang, and Dongya Wang. "An ACO-Based Clustering Algorithm With Chaotic Function Mapping." International Journal of Cognitive Informatics and Natural Intelligence 15, no. 4 (2021): 1–21. http://dx.doi.org/10.4018/ijcini.20211001.oa20.

Full text

Abstract:

To overcome shortcomings when the ant colony optimization clustering algorithm (ACOC) deal with the clustering problem, this paper introduces a novel ant colony optimization clustering algorithm with chaos. The main idea of the algorithm is to apply the chaotic mapping function in the two stages of ant colony optimization: pheromone initialization and pheromone update. The application of chaotic mapping function in the pheromone initialization phase can encourage ants to be distributed in as many different initial states as possible. Applying the chaotic mapping function in the pheromone updat

APA, Harvard, Vancouver, ISO, and other styles

47

Chidume, C. E., K. R. Kazmi, and H. Zegeye. "Iterative approximation of a solution of a general variational-like inclusion in Banach spaces." International Journal of Mathematics and Mathematical Sciences 2004, no. 22 (2004): 1159–68. http://dx.doi.org/10.1155/s0161171204209395.

Full text

Abstract:

We introduce a class ofη-accretive mappings in a real Banach space and show that theη-proximal point mapping forη-m-accretive mapping is Lipschitz continuous. Further, we develop an iterative algorithm for a class of general variational-like inclusions involvingη-accretive mappings in real Banach space, and discuss its convergence criteria. The class ofη-accretive mappings includes several important classes of operators that have been studied by various authors.

APA, Harvard, Vancouver, ISO, and other styles

48

HABA, Kazumoto, Wataru HOTTA, Akihito HATA, Kazuaki WATANABE, and Muneo HORI. "SPECTRAL STOCHASTIC RETURN MAPPING ALGORITHM." Journal of Japan Society of Civil Engineers, Ser. A2 (Applied Mechanics (AM)) 73, no. 1 (2017): 34–45. http://dx.doi.org/10.2208/jscejam.73.34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

Zhao, Lanfei, Ruiyang Sun, and Jun Wang. "Three-Stage Tone Mapping Algorithm." Electronics 11, no. 24 (2022): 4072. http://dx.doi.org/10.3390/electronics11244072.

Full text

Abstract:

In this paper, a tone mapping algorithm is presented to map real-world luminance into displayed luminance. Our purpose is to reveal the local contrast of real-world scenes on a conventional monitor. Around this point, we propose a three-stage algorithm to visualize high dynamic range images. All pixels of high dynamic range images are classified into three groups. For the first stage, we introduce piecewise linear mapping as the global tone mapping operator to map the luminance of the first group, which provides overall impressions of luminance. For the second stage, the luminance of the secon

APA, Harvard, Vancouver, ISO, and other styles

50

Chen, Song, and Mary M. Eshaghian. "A fast recursive mapping algorithm." Concurrency: Practice and Experience 7, no. 5 (1995): 391–409. http://dx.doi.org/10.1002/cpe.4330070505.

Full text

APA, Harvard, Vancouver, ISO, and other styles

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!