Search Results - (( using optimization max algorithm ) OR ( using optimization parallel algorithm ))

Refine Results
  1. 1

    Parallel metaheuristic algorithm for route planning using CUDA by Looi, Daniel Jun Jie

    Published 2025
    “…Area of Study: Massively Parallel Computing, Combinatorial Optimization Keywords: Parallel Metaheuristic Algorithm, Travelling Salesman Problem, CUDA, GPU, Genetic Algorithm…”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
  2. 2

    Digital Signal Processor (DSP) Design Using Very Long Instruction Word (VLIW) Architecture by Lee, Lini @ Lini Lee

    Published 2001
    “…In order to fulfill the requirement of pDSP, "Very Long Instruction Word" (VLIW) architecture concept is used. Using, VHDL (Very-High-Speed-Integrated-Circuit Hardware Description Language) as design tool has the advantage in optimizing the pDSP hardware requirement with ease where varying the size of units such as register files (RF), program sequencer (PS), data address generator (DAG), arithmetic logic unit (ALU), multiply-accumulator (MAC) and shifter can be done by changing the data width or bit values. …”
    Get full text
    Get full text
    Thesis
  3. 3

    A comparative performance analysis of computational intelligence techniques to solve the asymmetric travelling salesman problem by Odili, Julius Beneoluchi, Noraziah, Ahmad, Zarina, M.

    Published 2021
    “…The comparative algorithms in this study employ different techniques in their search for solutions to ATSP: the African Buffalo Optimization employs the modified Karp–Steele mechanism, Model-Induced Max-Min Ant Colony Optimization (MIMM-ACO) employs the path construction with patching technique, Cooperative Genetic Ant System uses natural selection and ordering; Randomized Insertion Algorithm uses the random insertion approach, and the Improved Extremal Optimization uses the grid search strategy. …”
    Get full text
    Get full text
    Get full text
    Article
  4. 4
  5. 5

    Topology-aware hypergraph based approach to optimize scheduling of parallel applications onto distributed parallel architectures by Koohi, Sina Zangbari

    Published 2020
    “…Any optimization algorithm is suitable for only a specific domain of optimization problems. …”
    Get full text
    Get full text
    Thesis
  6. 6

    Voting algorithms for large scale fault-tolerant systems by Karimi, Abbas

    Published 2011
    “…To solve this problem and gain benefits of this algorithm, we employed parallel algorithm technique and by using optimal number of processors, we could propose optimal algorithms known as Parallel Average Voting and Parallel Weighted Average Voting which both have optimal time complexity and less calculation cost. …”
    Get full text
    Get full text
    Thesis
  7. 7

    An improvement of stochastic gradient descent approach for mean-variance portfolio optimization problem by S. W. Su, Stephanie, Kek, Sie Long

    Published 2021
    “…Furthermore, the applicability of SGD, Adam, AdaMax, Nadam, AMSGrad, and AdamSE algorithms in solving the mean-variance portfolio optimization problem is validated.…”
    Get full text
    Get full text
    Get full text
    Article
  8. 8

    Reactive max-min ant system: An experimental analysis of the combination with K-OPT local searches by Sagban, Rafid, Ku-Mahamud, Ku Ruhana, Abu Bakar, Muhamad Shahbani

    Published 2015
    “…The exploration versus exploitation dilemma rises in ACO search.Reactive max-min ant system algorithm is a recent proposition to automate the exploration and exploitation.It memorizes the search regions in terms of reactive heuristics to be harnessed after restart, which is to avoid the arbitrary exploration later.This paper examined the assumption that local heuristics are useless when combined with local search especially when it applied for combinatorial optimization problems with rugged fitness landscape.Results showed that coupling reactive heuristics with k-Opt local search algorithms produces higher quality solutions and more robust search than max-min ant system algorithm.Well-known combinatorial optimization problems are used in experiments, i.e. traveling salesman and quadratic assignment problems. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  9. 9
  10. 10

    A GPGPU Approach to Accelerate Ant Swarm Optimization Rough Reducts (ASORR) Algorithm by Udayanti, Erika Devi, Choo, Yun Huoy, Draman @ Muda, Azah Kamilah, Nugroho, Fajar Agung

    Published 2012
    “…In order to find a reducts, a such applications of rough set uses a discernibility matrix. Ant Swarm Optimization Rough Reducts (ASORR) algorithm is used in rough reducts calculation for identifying significant attribute set optimally. …”
    Get full text
    Get full text
    Conference or Workshop Item
  11. 11

    An optimal tasks scheduling algorithm based on QoS in cloud computing network by Alhakimi, Mohammed Ameen Mohammed Abdo

    Published 2017
    “…This study presents an optimal task scheduling algorithm by enhancing Max-Min and TS algorithm. …”
    Get full text
    Get full text
    Thesis
  12. 12

    Investigation on the dynamic of computation of semi autonomous evolutionary computation for syntactic optimization of a set of programming codes by Mohammad Sigit Arifianto, Tze, Kenneth Kin Teo, Liau, Chung Fan, Liawas Barukang, Zaturrawiah Ali Omar

    Published 2007
    “…They have to be optimized for parallel execution while some parts still do have sequential execution due to data dependencies, which makes the optimization problem two folds, parallel and serial. …”
    Get full text
    Get full text
    Research Report
  13. 13

    A parallel prevention algorithm for black hole attacks in MANET by Yaakub, Abdul Razak, Ghathwan, Khalil I.

    Published 2015
    “…In this paper, we propose a parallel algorithm for MANETs that optimizes both routing discovery and security in an Ad Hoc On Demand Distance Vector (AODV). …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  14. 14

    Probabilistic ensemble fuzzy ARTMAP optimization using hierarchical parallel genetic algorithms by Loo, C.K., Liew, W.S., Seera, M., Lim, Einly

    Published 2015
    “…This was achieved by mitigating convergence in the genetic algorithms by employing a hierarchical parallel architecture. …”
    Get full text
    Get full text
    Get full text
    Article
  15. 15

    Maximum 2-satisfiability in radial basis function neural network by Shehab Abdulhabib Alzaeemi, Saratha Sathasivam, Mohd Shareduwan Mohd Kasihmuddin, Mohd. Asyraf Mansor

    Published 2020
    “…This paper presents a new paradigm in using MAX2SAT by implementing in Radial Basis Function Neural Network (RBFNN). …”
    Get full text
    Get full text
    Get full text
    Article
  16. 16

    Workflow optimization in distributed computing environment for stream-based data processing model / Saima Gulzar Ahmad by Saima Gulzar, Ahmad

    Published 2017
    “…Similarly, when data parallelism is introduced in the algorithm the performance of the algorithm improved further by 12% in latency and 17% in throughput when compared to PDWA algorithm. …”
    Get full text
    Get full text
    Get full text
    Thesis
  17. 17
  18. 18
  19. 19

    A new minimum pheromone threshold strategy (MPTS) for max-min ant system by Wong, Kuan Yew, See, Phen Chiak

    Published 2009
    “…Among others is the ant colony optimization (ACO) algorithm, which was inspired by the foraging behavior of ants. …”
    Get full text
    Get full text
    Article
  20. 20

    Analysis of evolutionary computing performance via mapreduce parallel processing architecture / Ahmad Firdaus Ahmad Fadzil by Ahmad, Ahmad Firdaus

    Published 2014
    “…Evolutionary computation (EC) is a method that is ubiquitously used to solve complex computation. Examples of EC such as Genetic Algorithm (GA) and PSO (Particle Swarm Optimization) are prevalent due to their efficiency and effectiveness. …”
    Get full text
    Get full text
    Thesis