Search Results - (( based optimization methods algorithm ) OR ( time selection path algorithm ))

Search alternatives:

Refine Results
  1. 1
    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:
  2. 2
    Optimization Of Two-Dimensional Dual Beam Scanning System Using Genetic Algorithms

    Optimization Of Two-Dimensional Dual Beam Scanning System Using Genetic Algorithms by Koh, Johnny Siaw Paw

    Published 2008
    “…In addition, the performance of the new operators called GA_INSP (GA Inspection Module), DTC (Dynamic Tuning Crossover), and BCS (Bi-Cycle Selection Method) for a better evolutionary approach to the time-based problem has been discussed in the thesis. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  3. 3
    Design, development and performance optimization of a new artificial intelligent controlled multiple-beam optical scanning module

    Design, development and performance optimization of a new artificial intelligent controlled multiple-beam optical scanning module by Koh J.S.P., Aris I.B., Ramachandaramurthy V.K., Bashi S.M., Marhaban M.H.

    Published 2023
    “…Also, proposed are the new modifications to existing crossover operator called DPPC (Dynamic Pre-Populated Crossover) together with modification of a simple crossover selection method, called BCS (Bi-Cycle Selection Method). …”
    Article
    Save to List
    Saved in:
  4. 4
    Design, development and performance optimization of a new artificial intelligent controlled multiple-beam optical scanning module

    Design, development and performance optimization of a new artificial intelligent controlled multiple-beam optical scanning module by Koh J.S.P., Aris I.B., Ramachandaramurthy V.K., Bashi S.M., Marhaban M.H.

    Published 2023
    “…Also, proposed are the new modifications to existing crossover operator called DPPC (Dynamic Pre-Populated Crossover) together with modification of a simple crossover selection method, called BCS (Bi-Cycle Selection Method). …”
    Article
    Save to List
    Saved in:
  5. 5
    Logical effort base adder circuits transistor sizing using constriction factor and mutative variants of particle swarm optimization algorithm / Muhammad Aiman Johari

    Logical effort base adder circuits transistor sizing using constriction factor and mutative variants of particle swarm optimization algorithm / Muhammad Aiman Johari by Johari, Muhammad Aiman

    Published 2015
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  6. 6
    Design, development and performance optimization of a new artificial intelligent controlled multiple-beam optical scanning module

    Design, development and performance optimization of a new artificial intelligent controlled multiple-beam optical scanning module by Koh, Johnny Siaw Paw, Aris, Ishak, Ramachandaramurthy, Vigna Kumaran, Bashi, Sinan Mahmod, Marhaban, Mohammad Hamiruce

    Published 2006
    “…Also, proposed are the new modifications to existing crossover operator called DPPC (Dynamic Pre-Populated Crossover) together with modification of a simple crossover selection method, called BCS (Bi-Cycle Selection Method). …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  7. 7
    Modeling and multi-objective optimal sizing of standalone photovoltaic system based on evolutionary algorithms

    Modeling and multi-objective optimal sizing of standalone photovoltaic system based on evolutionary algorithms by Ridha, Hussein Mohammed

    Published 2020
    “…The IEM algorithm uses the attraction-repulsion mechanism to change the positions of solutions towards the optimality. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  8. 8
    Solving vehicle routing problem by using improved genetic algorithm for optimal solution

    Solving vehicle routing problem by using improved genetic algorithm for optimal solution by Mohammed M.A., Abd Ghani M.K., Hamed R.I., Mostafa S.A., Ahmad M.S., Ibrahim D.A.

    Published 2023
    Article
    Save to List
    Saved in:
  9. 9
    Hybrid genetic algorithm with multi-parents recombination for job shop scheduling problems / Ong Chung Sin

    Hybrid genetic algorithm with multi-parents recombination for job shop scheduling problems / Ong Chung Sin by Ong, Chung Sin

    Published 2013
    “…The problem was initially tackled by “exact methods” such as the branch and bound method, which is based on the exhaustive enumeration of a restricted region of solutions containing exact optimal solutions. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  10. 10
    Energy balancing mechanisms for decentralized routing protocols in wireless sensor networks

    Energy balancing mechanisms for decentralized routing protocols in wireless sensor networks by Saleh, Ahmed Mohammed Shamsan

    Published 2012
    “…It is based on Ant Colony Optimization (ACO) meta heuristic, which is adopted to enhance the paths with the best-quality function. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  11. 11
    A reliable time base routing framework with seamless networking operation for SDN / Nauman Khan

    A reliable time base routing framework with seamless networking operation for SDN / Nauman Khan by Nauman , Khan

    Published 2024
    “…PMTRF modules and their algorithms enable the isolation of the maintenance switch and the selection of the most reliable path for future affected flows based on input time provided by the administrator. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  12. 12
    Artificial Bee Colony for Minimizing the Energy Consumption in Mobile Ad Hoc Network

    Artificial Bee Colony for Minimizing the Energy Consumption in Mobile Ad Hoc Network by Tareq, M., Abed, S.A., Sundararajan, E.A.

    Published 2019
    “…This algorithm works on minimizing the average energy consumption of the selected route. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  13. 13
    Node Participation Evaluation Scheme Based on Link Quality for Energy Efficient Routing in Ad-hoc Networks

    Node Participation Evaluation Scheme Based on Link Quality for Energy Efficient Routing in Ad-hoc Networks by Tie, Tai Hieng

    Published 2016
    “…Our proposed algorithms adapt the existing AODV routing protocol to select the optimal route based on the basis of the maximum energy of each route. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  14. 14
    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
    “…Finally, the performance of V-BLAST/STBC transceiver scheme with proposed LC-QR algorithm is compared with other MIMO systems, such as V-BLAST and orthogonal space-time block codes. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  15. 15
    Development of a systematic method in lean tool selection for automotive industry

    Development of a systematic method in lean tool selection for automotive industry by Anvari, Alireza

    Published 2012
    “…The developed software probably assists manufacturers in applying the systematic lean tool selection. Based on the systematic features of this algorithm, the efficiency and effectiveness of the model in presenting optimizing techniques for lean tool selection with the automotive industry seems reasonable and useful. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  16. 16
    Surface defect detection and polishing parameter optimization using image processing for G3141 cold rolled steel

    Surface defect detection and polishing parameter optimization using image processing for G3141 cold rolled steel by Zamri, Ruzaidi

    Published 2016
    “…This techniques will enables the polishing to be done at specific scratch defect area without necessary to develop polishing path throughout the whole surface which is time consuming. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  17. 17
    Automated path testing using the negative selection algorithm

    Automated path testing using the negative selection algorithm by Shayma Mustafa Mohi-Aldeen, Radziah Mohamad, Safaai Deris

    Published 2017
    “…Negative selection algorithm (NSA) has been used in this paper to generate test data for path testing automatically. …”
    Get full text
    Get full text
    Indexed Article
    Save to List
    Saved in:
  18. 18
    A O(|E|) Time Shortest Path Algorithm for Non-Negative Weighted Undirected Graphs

    A O(|E|) Time Shortest Path Algorithm for Non-Negative Weighted Undirected Graphs by Qureshi, M.A., Hassan, M.F., Safdar, S., Akhbar, R.

    Published 2010
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  19. 19
    Optimisation of Environmental Risk Assessment Architecture using Artificial Intelligence Techniques

    Optimisation of Environmental Risk Assessment Architecture using Artificial Intelligence Techniques by Salem S. M. Khalifa

    Published 2024
    “…By contrast, the running time of the safe path selection model (96 µs) is shorter than the running times of Dijkstra's algorithm and the Floyd- Warshall algorithm (150 µs and 184 µs, respectively). …”
    thesis::doctoral thesis
    Save to List
    Saved in:
  20. 20
    Integration of enchanced jump point search (JPS) algorithm with modified bresenham technique for path planning in virtual grid-based environment

    Integration of enchanced jump point search (JPS) algorithm with modified bresenham technique for path planning in virtual grid-based environment by Nurul Atikah Janis

    Published 2018
    “…Jump Point Search is one of the path finding algorithm with huge advantage of maintaining zero memory overhead as no preprocessing process involved. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:

Search Tools: