Search Results - (( using function path algorithm ) OR ( linear optimization path algorithm ))

Search alternatives:

Refine Results
  1. 1
    Simulated Kalman Filter algorithms for solving optimization problems

    Simulated Kalman Filter algorithms for solving optimization problems by Nor Hidayati, Abdul Aziz

    Published 2019
    “…The algorithms are evaluated using 30 benchmark functions of the CEC2014 benchmark suite, and then applied to solve PCB drill path optimization case study. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  2. 2
    On network flow problems with convex cost

    On network flow problems with convex cost by Nguyen, V.A., Tan, Y. P.

    Published 2004
    “…To address this problem, we derive the optimality conditions for minimising convex and differentiable cost functions, and devise an algorithm based on the primal-dual algorithm commonly used in linear programming. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  3. 3
    Improvement and application of particle swarm optimization algorithm

    Improvement and application of particle swarm optimization algorithm by Deevi, Durga Praveen, Kodadi, Sharadha, Allur, Naga Sushma, Dondapati, Koteswararao, Chetlapalli, Himabindu, Perumal, Thinagaran

    Published 2025
    “…This method combines CPTD with the Genetic Algorithm and PSO (GAPSO), resulting in an effective strategy for dynamic formation reconfiguration and path optimization. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  4. 4
    Adaptive model predictive control based on wavelet network and online sequential extreme learning machine for nonlinear systems

    Adaptive model predictive control based on wavelet network and online sequential extreme learning machine for nonlinear systems by Salih, Dhiadeen Mohammed

    Published 2015
    “…Moreover, the ability of initialization the hidden nodes parameters using density function and recursive algorithm will help WN-OSELM to perform useful generalization facility and modeling accuracy. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  5. 5
    Path planning algorithm for a car like robot based on MILP method

    Path planning algorithm for a car like robot based on MILP method by Mohd Sadri, Mohd Pawzi

    Published 2013
    “…This project is presents an algorithm for path planning optimal routes mobile robot “like a car” to a target in unknown environment. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  6. 6
    Recent research in cooperative path planning algorithms for multi-agent using mixed- integer linear programming

    Recent research in cooperative path planning algorithms for multi-agent using mixed- integer linear programming by Che Ku, Nor Azie Hailma, Omar, Rosli, Sabudin Elia Nadira, Sabudin Elia Nadira

    Published 2016
    “…Cooperative path planning fuses information from all agents to plan an optimal path. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  7. 7
    Design and development of optimal path trace back using graph theory technique for accelerate DNA sequence alignment accelerator: article

    Design and development of optimal path trace back using graph theory technique for accelerate DNA sequence alignment accelerator: article by Othman, Nor Shuhaida

    Published 2010
    “…The Smith-Waterman is been simplified into four modules which were initialization, score calculation, matrix filling and optimal path. The scope of the paper based on optimal path trace back using graph theory. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  8. 8
    Design and development of optimal path trace back using graph theory technique for accelerate DNA sequence alignment accelerator

    Design and development of optimal path trace back using graph theory technique for accelerate DNA sequence alignment accelerator by Othman, Nor Shuhaida

    Published 2010
    “…The Smith-Waterman is been simplified into four modules which were initialization, score calculation, matrix filling and optimal path. The scope of the paper based on optimal path trace back using graph theory. …”
    Get full text
    Get full text
    Student Project
    Save to List
    Saved in:
  9. 9
    A-star (A*) algorithm implementation for robotics path planning navigation

    A-star (A*) algorithm implementation for robotics path planning navigation by Emirul Ridzwan, Nor Azmi

    Published 2018
    “…This thesis is about the implementation of Astar (A*) algorithm as path planning algorithm used in robotics navigation. …”
    Get full text
    Get full text
    Undergraduates Project Papers
    Save to List
    Saved in:
  10. 10
    Synthesis of transistor chaining algorithm for CMOS cell layout using euler path / Sukri Hanafiah

    Synthesis of transistor chaining algorithm for CMOS cell layout using euler path / Sukri Hanafiah by Hanafiah, Sukri

    Published 1997
    “…The euler's path it using pseudo input and Heuristic algorithm to find the minimum interlace. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  11. 11
    Cognitive map approach for mobility path optimization using multiple objectives genetic algorithm

    Cognitive map approach for mobility path optimization using multiple objectives genetic algorithm by Krishnan P.S., Paw J.K.S., Kiong T.S.

    Published 2023
    Conference Paper
    Save to List
    Saved in:
  12. 12
    Hybrid path planning for indoor robot with Laplacian Behaviour-based control via four point-explicit group

    Hybrid path planning for indoor robot with Laplacian Behaviour-based control via four point-explicit group by Azali Saudi, Jumat Sulaiman

    Published 2014
    “…Consequently, the gradient of the potential functions would be used by the searching algorithm to generate path from starting to goal location. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  13. 13
    False path identification algorithm framework for nonseparable controller-data path circuits

    False path identification algorithm framework for nonseparable controller-data path circuits by Shaheen, Ateeq U. R., Hussin, Fawnizu Azmadi, Hamid, Nor Hisham

    Published 2016
    “…This paper proposes an algorithm frame-work to deal with these false paths through identification for DFT test. …”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  14. 14
    Path Following Using A Learning Neural Network

    Path Following Using A Learning Neural Network by NHH , Mohamad Hanif

    Published 2004
    “…This thesis is a development ofprevious works done by [2} on capability of neural controller to efficiently track prescribed paths. Equipped with knowledge on optimal preview control obtained from [1], the initial weights of linear and nonlinear neural controller are initialized to the optimal gains. …”
    Get full text
    Get full text
    Final Year Project
    Save to List
    Saved in:
  15. 15
    Nlfxlms and thf-nlfxlms algorithms for wiener-hammerstein nonlinear active noise control

    Nlfxlms and thf-nlfxlms algorithms for wiener-hammerstein nonlinear active noise control by Srazhidinov, Radik

    Published 2016
    “…However, this assumption may lead to inaccurate secondary path model. In this work, the modelling of acoustic path using FIR filters is incorporated for both algorithms for Wiener-Hammerstein structure. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  16. 16
    Optimized topology control in mobile IP networks using a new parametric routing algorithm

    Optimized topology control in mobile IP networks using a new parametric routing algorithm by Gholizadeh, Somayyeh, Abdullah, Azizol, Othman, Mohamed, Mohd Hanapi, Zurina

    Published 2018
    “…For this purpose, an Optimal Parametric Topology Control Routing (OPTCR) algorithm is introduced based on parametric linear programming formulation (LPF). …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  17. 17
    Development of Hybrid Algorithm for Integrated Aircraft Routing Problem and Crew Pairing Problem

    Development of Hybrid Algorithm for Integrated Aircraft Routing Problem and Crew Pairing Problem by NurulFarihan Mohamed, ZaitulMarlizawati Zainuddin, Said Salhi, Nurul Huda Mohamed, NurulAkmal Mohamed

    Published 2024
    Article
    Save to List
    Saved in:
  18. 18
    False path identification algorithm framework for nonseparable controller-data path circuits

    False path identification algorithm framework for nonseparable controller-data path circuits by Shaheen, A.-U.-R., Hussin, F.A., Hamid, N.H.

    Published 2017
    “…This paper proposes an algorithm framework to deal with these false paths through identification for DFT test. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  19. 19
    The Development Of A Robust Algorithm For Uav Path Planning In 3d Environment

    The Development Of A Robust Algorithm For Uav Path Planning In 3d Environment by Kok, Kai Yit

    Published 2016
    “…Significant research has been conducted on Unmanned Aerial Vehicle (UAV) path planning using evolutionary algorithms, such as Particle Swarm Optimization (PSO), Genetic Algorithm (GA), Differential Evolution (DE), and Biogeographic-Based Optimization (BBO). …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  20. 20
    Robotic indoor path planning using dijkstra's algorithm with multi-layer dictionaries

    Robotic indoor path planning using dijkstra's algorithm with multi-layer dictionaries by Fadzli, S.A., Abdulkadir, S.I., Makhtar, M., Jamal, A.A.

    Published 2016
    “…The path computed using the classic Dijkstra's algorithm is the shortest; however, it may not be the most feasible. …”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:

Search Tools: