Search Results - (( based selection path algorithm ) OR ( using optimization max algorithm ))

Search alternatives:

Refine Results
  1. 1
    Dynamic transmit antenna shuffling scheme for hybrid multiple-input multiple-output in layered architecture

    Dynamic transmit antenna shuffling scheme for hybrid multiple-input multiple-output in layered architecture by Chong, Jin Hui

    Published 2010
    “…Dynamic transmit antenna shuffling scheme improves the performance of MIMO by selecting the appropriate pairs of antennas at transmitter based on the CSI from receiver. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  2. 2
    A comparative performance analysis of computational intelligence techniques to solve the asymmetric travelling salesman problem

    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
    Save to List
    Saved in:
  3. 3
    A new strategy to improve the search performance of Max-Min Ant Aystem Algorithm when solving the Quadratic Assignment Problems

    A new strategy to improve the search performance of Max-Min Ant Aystem Algorithm when solving the Quadratic Assignment Problems by Phen, Chiak See

    Published 2010
    Get full text
    Working Paper
    Save to List
    Saved in:
  4. 4
    An improvement of stochastic gradient descent approach for mean-variance portfolio optimization problem

    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
    Save to List
    Saved in:
  5. 5
    Reactive max-min ant system: An experimental analysis of the combination with K-OPT local searches

    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
    Save to List
    Saved in:
  6. 6
    A hybrid sampling-based path planning algorithm for mobile robot navigation in unknown environments

    A hybrid sampling-based path planning algorithm for mobile robot navigation in unknown environments by Khaksar, Weria

    Published 2013
    “…The motion planning problem poses the question of how a robot can move from an initial to a final position. Sampling-based motion planning is a class of randomized path planning algorithms with proven completeness. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  7. 7
    An optimal tasks scheduling algorithm based on QoS in cloud computing network

    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
    Save to List
    Saved in:
  8. 8
    Path planning for unmanned aerial vehicles using visibility line-based methods

    Path planning for unmanned aerial vehicles using visibility line-based methods by Omar, Rosli

    Published 2011
    “…In order to ensure that the 3D path planning algorithms are computationally efficient, the proposed 2D path planning algorithms are applied into them. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  9. 9
    Maximum 2-satisfiability in radial basis function neural network

    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
    Save to List
    Saved in:
  10. 10
    A comparative evaluation of heuristic and metaheuristic job scheduling algorithms for optimized resource management in cloud environments

    A comparative evaluation of heuristic and metaheuristic job scheduling algorithms for optimized resource management in cloud environments by Haque, Najmul, Zafril Rizal, M. Azmi, Murad, Saydul Akbar

    Published 2026
    “…The CloudSim simulator is applied to evaluate each algorithm using key performance metrics, including makespan, average flow time, and the number of cloudlets that fail to meet deadlines. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  11. 11
    Fair uplink bandwidth allocation and latency guarantee for mobile WiMAX using fuzzy adaptive deficit round robin

    Fair uplink bandwidth allocation and latency guarantee for mobile WiMAX using fuzzy adaptive deficit round robin by Alsahag, Ali Mohammed, Mohd Ali, Borhanuddin, Noordin, Nor Kamariah, Mohamad, Hafizal

    Published 2014
    “…In this paper, an efficient bandwidth allocation algorithm for the uplink traffic in mobile WiMAX is proposed. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  12. 12
    Cross-layer design using multi-channel system in WiMAX mesh networks

    Cross-layer design using multi-channel system in WiMAX mesh networks by Al-Hemyari, Ali, Ng, Chee Kyun, Noordin, Nor Kamariah, Ismail, Alyani, Khatun, Sabira, Jamuar, Sudhanshu Shekhar

    Published 2008
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  13. 13
    Weighted Sum-Dijkstra’s Algorithm in Best Path Identification based on Multiple Criteria

    Weighted Sum-Dijkstra’s Algorithm in Best Path Identification based on Multiple Criteria by Ting, Kien Hua, Noraini Abdullah

    Published 2018
    “…The main objective of this paper was to identify the best path selection based on multiple criteria instead of a single criterion. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  14. 14
    A new minimum pheromone threshold strategy (MPTS) for max-min ant system

    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
    Save to List
    Saved in:
  15. 15
    Path Selection With Critical Switch-Aware For Software Defined Networking

    Path Selection With Critical Switch-Aware For Software Defined Networking by Isyaku, B., Bakar, K.B.A., Ghaleb, F.A., Zahid, M.S.M.

    Published 2021
    “…However, the traditional path selection algorithms failed to consider the switch role during the path selection process. …”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  16. 16
    Path planning for autonomous navigation in roundabouts using an improved triangular based polynomial estimation technique for bezier curve generation with aa and aa* algorithms

    Path planning for autonomous navigation in roundabouts using an improved triangular based polynomial estimation technique for bezier curve generation with aa and aa* algorithms by Sajith Akhil, Vinayak

    Published 2023
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  17. 17
    AUTOMATIC ROUTE FINDER FOR NEW VISITORS

    AUTOMATIC ROUTE FINDER FOR NEW VISITORS by ADNAN, MOHD SHIHAM

    Published 2006
    “…This project proposes a new visitor route model that is based on shortest path algorithms for road networks. …”
    Get full text
    Get full text
    Final Year Project
    Save to List
    Saved in:
  18. 18
    An exploration technique for the interacted multiple ant colonies optimization framework

    An exploration technique for the interacted multiple ant colonies optimization framework by Aljanaby A., Ku-Mahamud K.R., Norwawi N.Md.

    Published 2024
    Conference Paper
    Save to List
    Saved in:
  19. 19
    Optimal QoS aware multiple paths web service composition using heuristic algorithms and data mining techniques

    Optimal QoS aware multiple paths web service composition using heuristic algorithms and data mining techniques by Qtaish, Osama Kayed Taher

    Published 2014
    “…The aim is to solve the above-mentioned problems via an optimization mechanism based upon the combination between runtime path prediction method and heuristic algorithms. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  20. 20
    OPTIMIZED MIN-MIN TASK SCHEDULING ALGORITHM FOR SCIENTIFIC WORKFLOWS IN A CLOUD ENVIRONMENT

    OPTIMIZED MIN-MIN TASK SCHEDULING ALGORITHM FOR SCIENTIFIC WORKFLOWS IN A CLOUD ENVIRONMENT by Murad S.S., Badeel R., Alsandi N.S.A., Alshaaya R.F., Ahmed R.A., Muhammed A., Derahman M.

    Published 2023
    “…To achieve this, we propose a new noble mechanism called Optimized Min-Min (OMin-Min) algorithm, inspired by the Min-Min algorithm. …”
    Review
    Save to List
    Saved in:

Search Tools: