Search Results - (( solution construction method algorithm ) OR ( parallel implementation path algorithm ))

Search alternatives:

Refine Results
  1. 1
    Parallel genetic algorithms for shortest path routing in high- performance computing / Mohd Erman Safawie Che Ibrahim

    Parallel genetic algorithms for shortest path routing in high- performance computing / Mohd Erman Safawie Che Ibrahim by Che Ibrahim, Mohd Erman Safawie

    Published 2012
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  2. 2
    Solving traveling salesman problem on cluster compute nodes

    Solving traveling salesman problem on cluster compute nodes by I.A., Aziz, Haron, N., Mehat, M., Jung, L.T., Mustapa, A.N., Akir, E.A.P.

    Published 2009
    “…In this paper, we present a parallel implementation of a solution for the Traveling Salesman Problem (TSP). …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  3. 3
    High-Speed shortest path co-processor design

    High-Speed shortest path co-processor design by Idris, Mohd Yamani Idna, Abu Bakar, Suraya, Tamil, Emran Mohd, Razak, Zaidi, Noor, Noorzaily Mohamed

    Published 2009
    “…Shortest path algorithms are significant in graph theory and have been applied in many applications such as transportation and networking. …”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  4. 4
    Development of an automatics parallel parking system for nonholonomic mobile robot

    Development of an automatics parallel parking system for nonholonomic mobile robot by Mohd Fairuz , Abdollah, Syed Najib , Syed Salim, Irma Wani , Jamaludin, Muhammad Nizam , Kamarudin

    Published 2011
    “…The configuration of the system consists of ultrasonic sensor, rotary encoder, controller, and actuators. The path planning algorithm is developed based on the data acquired from the sensor. …”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  5. 5
    OPTIMAL DATAPATH DESIGN FOR A CRYPTOGRAPHIC PROCESSOR: THE BLOWFISH ALGORITHM

    OPTIMAL DATAPATH DESIGN FOR A CRYPTOGRAPHIC PROCESSOR: THE BLOWFISH ALGORITHM by Zain Ali, Noohul Basheer, Noras, James

    Published 2001
    “…An 8-bit parallel data-path gives the best performance, mapping into 4 independent 8-bit modules, with a throughput at least 4 times greater than with 32-bit hardware. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  6. 6
    A novel large-bit-size architecture and microarchitecture for the implementation of Superscalar Pipeline VLIW microprocessors

    A novel large-bit-size architecture and microarchitecture for the implementation of Superscalar Pipeline VLIW microprocessors by Lee, Weng Fook

    Published 2008
    “…An adder algorithm using repetitive constructs in a parallel algorithm that allows for efficient and optimal synthesis for large data bus size is proposed as a suitable implementation for the adder within the ALU. …”
    Get full text
    Thesis
    Save to List
    Saved in:
  7. 7
    A test case generation framework based on UML statechart diagram

    A test case generation framework based on UML statechart diagram by Salman, Yasir Dawood

    Published 2018
    “…Current studies also hardly address loops and parallel paths issues, and achieved low coverage criteria. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  8. 8
    Sequential constructive algorithm incorporate with fuzzy logic for solving real world course timetabling problem

    Sequential constructive algorithm incorporate with fuzzy logic for solving real world course timetabling problem by Tan, Li June, Joe H. Obit, Leau, Yu Beng, Jetol Bolongkikit, Rayner Alfred

    Published 2020
    “…Sequential constructive algorithm is one of the popular methods for solving timetabling problems. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  9. 9
    Sequential Constructive Algorithm incorporate with Fuzzy Logic for Solving Real World Course Timetabling Problem

    Sequential Constructive Algorithm incorporate with Fuzzy Logic for Solving Real World Course Timetabling Problem by Tan, Li June, Joe Henry Obit, Leau, Yu Beng, Jetol Bolongkikit, Rayner Alfred

    Published 2020
    “…Sequential constructive algorithm is one of the popular methods for solving timetabling problems. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Book
    Save to List
    Saved in:
  10. 10
    A new parameterized architectural design for SENSE reconstruction

    A new parameterized architectural design for SENSE reconstruction by Siddiqui, M.F., Reza, A.W., Kanesan, J., Omer, H.

    Published 2014
    “…Complex multiplier, divider and complex matrix multiplier modules are designed to implement the algorithm. Furthermore, the variable data bus widths are used in the data path of the architecture, which leads to reduce the hardware cost and silicon area. …”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  11. 11
    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:
  12. 12
    Optimised Crossover Genetic Algorithms for Combinatorial Optimisation Problems

    Optimised Crossover Genetic Algorithms for Combinatorial Optimisation Problems by Nazif, Habibeh

    Published 2010
    “…A Genetic Algorithm is successful in generating near -optimal solutions if it is able to produce o®spring during crossover that is better than the parent solutions. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  13. 13
    Enhanced Intelligent Water Drops Algorithm for University Examination Timetabling Problems

    Enhanced Intelligent Water Drops Algorithm for University Examination Timetabling Problems by Bashar AbedAl Mohdi Talal AlDeeb

    Published 2024
    “…(iii) It is a constructive-based meta-heuristic algorithm which means, the solution is incrementally constructed (step by step) until the complete solution is obtained (Noferesti and Shah-Hosseini, 2012). …”
    thesis::doctoral thesis
    Save to List
    Saved in:
  14. 14
    Centered fan field region under wedge indentation by numerical solution method

    Centered fan field region under wedge indentation by numerical solution method by Syafikah, Ayob, Nor Alisa, Mohd Damanhuri

    Published 2019
    “…The stress field obtained were then compared to the analytical solution. This solution method provides a simple algorithms that is easy to be applied in deformation and this will subsequently provide a contribution in designing tools and the construction industries involving granular materials.…”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  15. 15
    Restoration planning strategy of transmission system based on optimal energizing time of sectionalizing islands / Dian Najihah Abu Talib

    Restoration planning strategy of transmission system based on optimal energizing time of sectionalizing islands / Dian Najihah Abu Talib by Dian Najihah , Abu Talib

    Published 2019
    “…Parallel processing is implemented together with the proposed strategy to minimize the program running time. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  16. 16
    Development of a Negotiation Support Model for Value Management in Construction

    Development of a Negotiation Support Model for Value Management in Construction by UTOMO, CHRISTIONO

    Published 2009
    “…It combines simultaneous triangulation by using case studies and survey methods and sequential triangulation in which results of one method are essential in planning the next method (theoretical mapping, survey research, focus group, case study and conceptual modeling). …”
    Get full text
    Get full text
    Final Year Project
    Save to List
    Saved in:
  17. 17
    Enhancement of Ant System Algorithm for Course Timetabling Problem

    Enhancement of Ant System Algorithm for Course Timetabling Problem by Djamarus, Djasli

    Published 2009
    “…For this kind of problem, researchers believe that it will be better to find an approximate solution that can be delivered by a stochastic algorithm than waiting for an exact solution from the deterministic algorithm. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  18. 18
    Ball surface representations using partial differential equations

    Ball surface representations using partial differential equations by Kherd, Ahmad Saleh Abdullah

    Published 2015
    “…Hence, this new algorithm is a viable alternative for constructing generalized Ball surfaces. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  19. 19
    Genetic algorithm techniques for the design of nonlinear microwave circuits

    Genetic algorithm techniques for the design of nonlinear microwave circuits by Arsat, Rashidah

    Published 2004
    “…By using Sample Balance's differential of current linear and nonlinear equation as an objective function, a Genetic Algorithm routine then been constructed. Genetic Algorithm will then recombine, mutate and evaluate the population of solution to find the best solution based on Sample balance equation. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  20. 20
    Fast Finite Difference Time Domain Algorithms for Solving Antenna Application Problem

    Fast Finite Difference Time Domain Algorithms for Solving Antenna Application Problem by Hasan, Mohammad Khatim

    Published 2008
    “…The objective of the thesis is to develop new sequential and parallel algorithms that are faster than the standard Finite Difference Time Domain method. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:

Search Tools: