Search Results - (( program reduction using algorithm ) OR ( parallel optimization path algorithm ))

Refine Results
  1. 1

    Tool path generation of contour parallel based on ant colony optimisation by Abdullah, Haslina, Ramli, Rizauddin, Abd Wahab, Dzuraidah, Abu Qudeiri, Jaber

    Published 2016
    “…An Ant Colony Optimisation (ACO) method is used to optimize the tool path length because of its capability to find the shortest tool path length. …”
    Get full text
    Get full text
    Article
  2. 2
  3. 3
  4. 4

    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
    “…There are two discrete optimization techniques used in this work, which are the Artificial Bee Colony algorithm and Evolutionary Programming. …”
    Get full text
    Get full text
    Get full text
    Thesis
  5. 5

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

    Published 2008
    “…Different adder architectures are investigated for suitability on synthesis implementation of large data bus size adder for efficient usage within the ALU. 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
  6. 6

    Schelkunoff array synthesis methods using adaptive-iterative algorithm by Abdul Latiff, Nurul Mu'azzah

    Published 2003
    “…The adaptive-iterative algorithm is an error-reduction algorithm that has been extensively studied in recent years. …”
    Get full text
    Get full text
    Get full text
    Thesis
  7. 7

    An improved algorithm for channel allocation on direct sequence spread spectrum by Handrizal, M

    Published 2011
    “…Graph coloring is an assignment a color to each vertex, which each vertex that adjacent is given a different color. Graph coloring is a useful algorithm for channel allocation on Direct Sequence Spread Spectrum (DSSS).Through this algorithm,each access point (AP) that adjacent gives different channels based on colors available.Welsh Powell algorithm and Degree of saturation (Dsatur) are the popular algorithms being used for channel allocation in this domain. …”
    Get full text
    Get full text
    Thesis
  8. 8

    Quality of service in mobile IP networks with parametric multi-channel routing algorithms based on linear programming approach by Gholizadeh, Somayyeh

    Published 2018
    “…This approach tunes the parameters of the linear programming models that are used in the other algorithms by using a dynamic element. …”
    Get full text
    Get full text
    Thesis
  9. 9

    Distributed generation allocation to reduce losses and improve voltage profile genetic algorithm: article by Abdol Azis, Hazriq Syahmie

    Published 2010
    “…I used Newton Raphson for load flow algorithm and composed it with Genetic Algorithm. …”
    Get full text
    Get full text
    Article
  10. 10

    Network reconfiguration and control for loss reduction using genetic algorithm by Jawad, Mohamed Hassan Izzaldeen

    Published 2010
    “…Two selection methods that are used in Genetic Algorithm are the roulette wheel and tournament selections. …”
    Get full text
    Get full text
    Thesis
  11. 11

    Attribute reduction based scheduling algorithm with enhanced hybrid genetic algorithm and particle swarm optimization for optimal device selection by Nwogbaga, Nweso Emmanuel, Latip, Rohaya, Affendey, Lilly Suriani, Abdul Rahiman, Amir Rizaan

    Published 2022
    “…Therefore, in this paper, we proposed Dynamic tasks scheduling algorithm based on attribute reduction with an enhanced hybrid Genetic Algorithm and Particle Swarm Optimization for optimal device selection. …”
    Get full text
    Get full text
    Article
  12. 12

    A 'snowflake' geometrical representation for optimised degree six 3-modified chordal ring networks by Chien, Stephen Lim Een, Raja Maamor Shah, Raja Noor Farah Azura, Othman, Mohamed

    Published 2016
    “…A tree visualisation was constructed based on its connectivity to enable the generation of formulae for optimal diameter and average optimal path lengths. …”
    Get full text
    Get full text
    Conference or Workshop Item
  13. 13

    Optimal cost benefit of the EToU electricity tariff for a manufacturing operation by using optimization algorithm by Sulaima, Mohamad Fani, Alias, Nur Umirah, Wan Abdul Razak, Intan Azmira, Sardi, Junainah, Bohari, Zul Hasrizal

    Published 2021
    “…In regard to the issue, Tenaga Nasional Berhad (TNB) has introduced a more advanced tariff under Demand Side Management (DSM) programs namely Enhance Time of Use (EToU) tariff as an advanced version of the Time of Use (ToU) tariff for generation and demand side benefits. …”
    Get full text
    Get full text
    Get full text
    Article
  14. 14

    Detection of black hole nodes in mobile ad hoc network using hybrid trustworthiness and energy consumption techniques by Mustafa, Ahmed Sudad

    Published 2017
    “…In this thesis, a hybrid detection algorithm mechanism has been proposed which combines two detection algorithms based on nodes’ trustworthiness and energy consumption in a parallel manner in order to detect the black hole nodes. …”
    Get full text
    Get full text
    Get full text
    Thesis
  15. 15

    Problem restructuring in interger programming for reduct searching by Ungku Chulan, Ungku Azmi Iskandar

    Published 2003
    “…Standard Integer Programming / Decision Related Integer Programming (SIP/DRIP) is a reduct searching system that finds the reducts in an information system. …”
    Get full text
    Get full text
    Thesis
  16. 16

    Backward reduction application for minimizing wind power scenarios in stochastic programming by Muhamad Razali N.M., Hashim A.H.

    Published 2023
    “…In order to make informed decisions in the presence of uncertainties, risk management problems of power utilities may be modelled by multistage stochastic programs. These programs use a set of scenarios (or plausible realizations) and corresponding probabilities to model the multivariate random data process, e.g. electrical load, stream flows to hydro units, generation output of intermittent renewable sources as well as fuel and electricity prices. …”
    Conference Paper
  17. 17

    Twofold Integer Programming Model for Improving Rough Set Classification Accuracy in Data Mining. by Saeed, Walid

    Published 2005
    “…The accuracy for rules and classification resulted from the TIP method are compared with other methods such as Standard Integer Programming (SIP) and Decision Related Integer Programming (DRIP) from Rough Set, Genetic Algorithm (GA), Johnson reducer, HoltelR method, Multiple Regression (MR), Neural Network (NN), Induction of Decision Tree Algorithm (ID3) and Base Learning Algorithm (C4.5); all other classifiers that are mostly used in the classification tasks. …”
    Get full text
    Get full text
    Thesis
  18. 18

    Parallelization of speech compression based algorithm based on human auditory system on multicore system by Gunawan, Teddy Surya, Kartiwi, Mira, Khalifa, Othman Omran

    Published 2012
    “…To achieve a scalable parallel speech coding algorithm, single program multiple data (SPMD) programming model was used, in which a single program was written for all cores. …”
    Get full text
    Get full text
    Get full text
    Article
  19. 19

    Long-term optimal planning of distributed generations and battery energy storage systems towards high integration of green energy considering uncertainty and demand response progra... by Ba-swaimi S., Verayiah R., Ramachandaramurthy V.K., ALAhmad A.K.

    Published 2025
    “…To address uncertainties in wind speed, solar irradiation, load demands, and energy prices, Monte Carlo Simulation (MCS) is employed. Scenario reduction through the Backward Reduction Algorithm (BRA) manages computational complexity. …”
    Article
  20. 20