Search Results - optical ((((((based algorithm) OR (_ algorithm))) OR (colony algorithm))) OR (path algorithm))

Refine Results
  1. 1

    Zero Algorithms for Avoiding Crosstalk in Optical Multistage Interconnection Network by Ali Al-Shabi, Mohammed Abdulhameed

    Published 2005
    “…This routing problem is an NP-hard problem. Many heuristic algorithms have been proposed and designed to perform the routing such as the sequential algorithm, the sequential down algorithm, the degree-ascending algorithm, the degree-descending algorithm, the Simulated Annealing algorithm and the Ant Colony algorithm. …”
    Get full text
    Get full text
    Thesis
  2. 2

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

    Published 2008
    “…This thesis presents a new approach to optimize the performance of a dual beam optical scanning system in terms of its scanning combinations and speed, using Genetic Algorithm (GA). …”
    Get full text
    Get full text
    Thesis
  3. 3
  4. 4
  5. 5

    Investigation On Optical Fibre Configurations For Process Tomography by Ibrahim, Sallehuddin

    Published 2002
    “…The response of the sensors was based on two models:- (1) optical attenuation model due to material with differing optical densities, and (2) optical path length model which is used for opaque solids in air or liquid. …”
    Get full text
    Get full text
    Get full text
    Article
  6. 6
  7. 7

    Enhanced gravitational search algorithm for nano-process parameter optimization problem / Norlina Mohd Sabri by Mohd Sabri, Norlina

    Published 2020
    “…Based on the capabilities of the metaheuristic algorithms, this research is proposing the enhanced Gravitational Search Algorithm (eGSA) to solve the nano-process parameter optimization problem. …”
    Get full text
    Get full text
    Thesis
  8. 8
  9. 9

    Efficient Sequential and Parallel Routing Algorithms in Optical Multistage Interconnection Network by Abduh Kaid, Monir Abdullah

    Published 2005
    “…This routing problem is an NPhard problem. Many algorithms are designed by many researchers to perform this routing such as window method, sequential algorithm, degree-descending algorithm, simulated annealing algorithm, genetic algorithm and ant colony algorithm.This thesis explores two approaches, sequential and parallel approaches. …”
    Get full text
    Get full text
    Thesis
  10. 10

    A multi-beam optical scanning device. by Aris, Ishak, Koh, Siaw Paw

    Published 2008
    “…The scanning heads are adapted for controlling the path of laser beams. The optical scanning device is adapted to further comprise an artificial intelligent system having an interface for data input and a database for storing genetics algorithm. …”
    Get full text
    Patent
  11. 11

    Crosstalk-Free Scheduling Algorithms for Routing in Optical Multistage Interconnection Networks by Raja Mohd Auzar, Tengku Dian Shahida

    Published 2009
    “…It is the objective of the research presented in this thesis to propose a solution that can further optimize and improve the performance of message scheduling for routing in the optical Omega network. Based on Zero algorithms, a Modified Zero algorithm is developed to achieve a crosstalk-free version of the algorithm. …”
    Get full text
    Get full text
    Thesis
  12. 12

    A real-time integrated fire detection and alarm (FDA) system for network based building automation by Anwar, Farhat, Islam, Rounakul, Hussain, Sabahat, Rashid, Muhammad Mahbubur, Shaikh, Zuhaib

    Published 2017
    “…Methods/Analysis: In this work, the shortest path algorithm was chosen for series of buildings connected by a fiber-optic network. …”
    Get full text
    Get full text
    Get full text
    Article
  13. 13
  14. 14

    Resource Efficient For Hybrid Fiber-Wireless Communications Links In Access Networks With Multi Response Optimization Algorithm by Wong, Adam Yoon Khang, Indra, Win Adiyansyah, Jamil Alsayaydeh, Jamil Abedalrahim, Mohamat Gani, Johar Akbar, M. Idrus, Sevia, Pusppanathan, Jaysuman

    Published 2021
    “…This work proposes a Multi response Optimization (MO) algorithm, named MO-LMMHOWAN that apply in Last Mile Mobile Hybrid Optical Wireless Access Network (LMMHOWAN). …”
    Get full text
    Get full text
    Get full text
    Article
  15. 15
  16. 16

    Bitwise-based Routing Algorithms in Optical Multistage Interconnection Network by Abed, Farzaneh

    Published 2007
    “…Finally Four Heuristic and Difference Increasing and Decreasing routing algorithms based on bitwise operation are established. …”
    Get full text
    Get full text
    Thesis
  17. 17

    A fast and efficient crosstalk-free algorithm for routing in optical multistage interconnection networks by Raja Mohd Auzar, Tengku Dian Shahida, Othman, Mohamed, Abdullah, Mohamad Khazani

    Published 2008
    “…The new Fast ZeroXY algorithm is designed based on the Zero algorithms, which uses the time dilation approach to eliminate the negative effect of crosstalk associated with optical switching in the optical Omega network. …”
    Get full text
    Get full text
    Conference or Workshop Item
  18. 18

    The Half-t adaptive error correction algorithm for SDH-based WDM optical networks by Cheah, Cheng Lai, Abdullah, Mohamad Khazani

    Published 2007
    “…This paper proposes an adaptive forward error correction (FEC) algorithm, referred to as the Half-t algorithm for synchronous digital hierarchy (SDH) based wavelength division multiplexing (WDM) optical networks. …”
    Get full text
    Get full text
    Conference or Workshop Item
  19. 19

    Integrating RLP and Fast Zero algorithm to improve routing performance in optical multistage interconnection networks by Raja Mohd Auzar, Tengku Dian Shahida, Othman, Mohamed, Abdullah, Mohamad Khazani

    Published 2008
    “…The new Fast Zero with RLP (FastRLP) algorithm is developed based on the time domain approach for solving optical crosstalk in the optical Omega network. …”
    Get full text
    Get full text
    Conference or Workshop Item
  20. 20