Showing 181 - 200 results of 357 for search '"Parallel Computing"', query time: 0.07s Refine Results
  1. 181

    An Efficient Method for Mining Erasable Itemsets Using Multicore Processor Platform by Bao Huynh, Bay Vo

    Published 2018-01-01
    “…This method also solves some limitations of parallel computing approaches in communication, data transfers, and synchronization. …”
    Get full text
    Article
  2. 182

    Multi-node cooperative distributed offloading strategy in V2X scenario by Dun CAO, Yingbao ZHANG, Dian ZOU, Jin WANG, Qiang TANG, Baofeng JI

    Published 2022-02-01
    “…In order to cope with the dynamic changes of the offloading environment for computing resource-intensive and separable tasks in Internet of vehicle and deal with the problem that different collaborative nodes had different communication and computing resources, a distributed offloading strategy that multiple collaborative nodes had serial offloading mode and parallel computing mode in vehicle to everything (V2X) scenario was proposed.Utilizing the predictable motion trajectories of vehicle, the tasks were split into unequal parts, finally each part was computed on itself, mobile edge server, and vehicles in parallel.Then an optimization problem of the system time delay minimization was established.To solve the optimization problem, an offloading scheme based on the game theory was designed to determine the serial offloading execution order of the cooperative nodes.Considering the dynamic characteristics of Internet of vehicles, a sequential quadratic programming (SQP) algorithm was adopted to optimally split tasks.Finally, the simulation results show that the proposed strategy can effectively reduce system delay, and when multiple cooperative nodes offload in parallel, the proposed strategy can still maintain the stable system performance under the different parameter conditions.…”
    Get full text
    Article
  3. 183

    A parallel implementation of the network identification by multiple regression (NIR) algorithm to reverse-engineer regulatory gene networks. by Francesco Gregoretti, Vincenzo Belcastro, Diego di Bernardo, Gennaro Oliva

    Published 2010-04-01
    “…These emerging computational requirements can be met using parallel computing techniques. It has been shown that the Network Identification by multiple Regression (NIR) algorithm performs better than the other ready-to-use reverse engineering software. …”
    Get full text
    Article
  4. 184

    Applying Probability Theory for the Quality Assessment of a Wildfire Spread Prediction Framework Based on Genetic Algorithms by Andrés Cencerrado, Ana Cortés, Tomàs Margalef

    Published 2013-01-01
    “…For this purpose, we rely on a two-stage prediction process to enhance the quality of traditional predictions, taking advantage of parallel computing. This strategy is based on an adjustment stage which is carried out by a well-known evolutionary technique: Genetic Algorithms. …”
    Get full text
    Article
  5. 185

    Performance Comparison of OpenMP, MPI, and MapReduce in Practical Problems by Sol Ji Kang, Sang Yeon Lee, Keon Myung Lee

    Published 2015-01-01
    “…This paper briefly reviews the parallel computing models and describes three widely recognized parallel programming frameworks: OpenMP, MPI, and MapReduce. …”
    Get full text
    Article
  6. 186

    Inner–Outer Loop Intelligent Morphology Optimization and Pursuit–Evasion Control for Space Modular Robot by Wenwei Luo, Ling Meng, Fei Feng, Pengyu Guo, Bo Li

    Published 2025-05-01
    “…In addition, by implementing the algorithm on the JAX framework for parallel computing, the computational efficiency was significantly enhanced, allowing the entire optimization process within 17.3 h. …”
    Get full text
    Article
  7. 187

    Parallel division clustering algorithm based on Spark framework and ASPSO by Yimin MAO, Dejin GAN, Liefa LIAO, Zhigang CHEN

    Published 2022-03-01
    “…To deal with the problems that the partition clustering algorithm for processing massive data encountered problems such as large data dispersion coefficient and poor anti-interference, difficulty to determine the number of local clusters, local cluster centroids randomness, and low efficiency of local cluster parallelization and merging, a parallel partition clustering algorithm based on Spark framework and ASPSO (PDC-SFAS PSO) was proposed.Firstly, a meshing strategy was introduced to reduce the data dispersion coefficient of the data division and improve anti-interference.Secondly, to determine the number of clusters, meshing strategy based on potential function and Gaussian function were proposed, which formed an area with different sample points as the core clusters, and obtained the number of local clusters.Then, to avoid local cluster centroids randomness, ASPSO was proposed.Finally, a local cluster merging strategy based on cluster radius and neighbor nodes was introduced to merge clusters with large similarity based on the Spark parallel computing framework, which improved the efficiency of parallel merging of local clusters.Experimental results showed that the PDC-SFASPSO algorithm has good performance in data partitioning and clustering in a big data environment, and it was suitable for parallel clustering of large-scale data sets.…”
    Get full text
    Article
  8. 188

    Discounted-likelihood valuation of variance and volatility swaps by Napat Rujeerapaiboon, Sanae Rujivan, Hongdan Chen

    Published 2025-01-01
    “…When the underlier’s returns are independent and lognormally but not necessarily identically distributed, our approach for pricing variance and volatility swaps could be greatly simplified, benefit from parallel computing, and be solved by a two-dimensional grid search. …”
    Get full text
    Article
  9. 189

    Research on heterogeneous radio access and resource allocation algorithm in vehicular fog computing by Kai XIONG, Supeng LENG, Ke ZHANG, Hao LIU

    Published 2019-06-01
    “…With the development of intelligent transportation and the constant emergence of new vehicular on-board applications,such as automatic driving,intelligent vehicular interaction and safety driving.It is difficult for an independent vehicle to run a wide variety of applications with a large number of computing needs and time delay needs relying on its own limited computing resources.By distributing computing tasks in devices on the edge of the network,fog computing applies virtualization technology,distributed computing technology and parallel computing technology to enable users to dynamically obtain computing power,storage space and other services on demand.Applying fog computing architecture to Internet of vehicles can effectively alleviate the contradiction between the large computing-low delay demands and limited vehicular resources.By analyzing the channel capacity of vehicle-to-vehicle communication,vehicle-infrastructure communication and vehicle-time-delay tolerant network communication,an optimization model of heterogeneous access to multi-service resources for the Internet of vehicles was established,and various vehicle-to-fog resources were jointly dispatched to realize efficient processing of intelligent transportation applications.The simulation results show that the proposed reinforcement learning algorithm can effectively deal with the resource allocation in the heterogeneous vehicular fog architecture.…”
    Get full text
    Article
  10. 190

    DPU empowered intelligent congestion control mechanism for the intelligent computing center network by CHEN Jinqian, GUO Shaoyong, LIU Chang, QI Feng, QIU Xuesong

    Published 2025-02-01
    “…The completion time of data flow transfer tasks in parallel computing scenarios is decreased by more than 11.23%. …”
    Get full text
    Article
  11. 191

    Towards an efficient LWE‐based fully homomorphic encryption scheme by Uddipana Dowerah, Srinivasan Krishnaswamy

    Published 2022-07-01
    “…Further, for an appropriate choice of parameters, the per computation cost for homomorphic multiplication can be made asymptotically comparable to RLWE‐based schemes in a parallel computing environment. For homomorphic multiplication, the scheme uses a polynomial‐based technique that does not require relinearization (and key switching).…”
    Get full text
    Article
  12. 192

    On the Optimization and Parallelizing Little Algorithm for Solving the Traveling Salesman Problem by V. V. Vasilchikov

    Published 2016-08-01
    “…It allows us to develop effective applications for parallel computing on a local network using any .NET-compatible programming language. …”
    Get full text
    Article
  13. 193

    Secure mobile agents for efficient medical information retrieval: A verifiable variable threshold secret sharing approach. by Pradeep Kumar, Sur Singh Rawat, Kakoli Banerjee, Ayodeji Olalekan Salau, Gyanendra Kumar, Niraj Singhal

    Published 2025-01-01
    “…Many applications, such as e-commerce, parallel computing, network management, and health care, use mobile agents. …”
    Get full text
    Article
  14. 194

    SOME QUESTIONS OF THE GRID AND NEURAL NETWORK MODELING OF AIRPORT AVIATION SECURITY CONTROL TASKS by L. N. Elisov, N. I. Ovchenkov

    Published 2017-06-01
    “…The authors examine the possibility of application of mathematical methods for the modeling of security management processes and procedures in their latest works. Parallel computing methods and network neurocomputing for modeling of airport security control processes are examined in this work. …”
    Get full text
    Article
  15. 195

    Series Arc Fault Detection Based on Improved Artificial Hummingbird Algorithm Optimizer Optimized XGBoost by Lichun Qi, Takahiro Kawaguchi, Seiji Hashimoto

    Published 2025-06-01
    “…By leveraging the global search capability and dynamic adaptive mechanism of AHA, key feature subsets sensitive to arcs are selected from high-dimensional time–frequency domain features. Combining the parallel computing advantages and regularization strategies of XGBoost, a low-complexity, highly interpretable fault classification model is constructed. …”
    Get full text
    Article
  16. 196

    Time-Free Solution to Hamilton Path Problems Using P Systems with d-Division by Tao Song, Xun Wang, Hongjiang Zheng

    Published 2013-01-01
    “…P systems with d-division are a particular class of distributed and parallel computing models investigated in membrane computing, which are inspired from the budding behavior of Baker’s yeast (a cell can generate several cells in one reproducing cycle). …”
    Get full text
    Article
  17. 197

    Multiple viewpoints projection hologram from multiple angular orthogonal projection images based on GPU by CAO Xuemei, ZHANG Chunxiao, GUAN Mingxiang, XIA Linzhong, GUO Lili, MIAO Yuhu, CAO Shiping

    Published 2024-09-01
    “…Finally, by accumulating all parallel computation results, a two-dimensional complex matrix containing three-dimensional object information is obtained. …”
    Get full text
    Article
  18. 198

    A Parallel Algorithm for the Two-Dimensional Time Fractional Diffusion Equation with Implicit Difference Method by Chunye Gong, Weimin Bao, Guojian Tang, Yuewen Jiang, Jie Liu

    Published 2014-01-01
    “…We do think that the parallel computing technology will become a very basic method for the computational intensive fractional applications in the near future.…”
    Get full text
    Article
  19. 199

    Impacts of Permeability Uncertainty in a Coupled Surface‐Subsurface Flow Model Under Perturbed Recharge Scenarios by Nicholas B. Engdahl

    Published 2024-03-01
    “…Consequently, a large fraction of the IHM studies to date have been “numerical hypothesis testing” studies, but, as parallel computing continues to improve, IHMs are approaching the point where they might also be useful as predictive tools. …”
    Get full text
    Article
  20. 200

    GenSDF: An MPI-Fortran based signed-distance-field generator for computational fluid dynamics applications by Akshay Patil, Udhaya Chandiran Krishnan Paranjothi, Clara García-Sánchez

    Published 2025-05-01
    “…Our approach integrates the Message Passing Interface (MPI) for parallel computing with the performance benefits of modern Fortran, enabling efficient and scalable signed distance field (SDF) computations for complex geometries. …”
    Get full text
    Article