Search Results - (( problem using network algorithm ) OR ( java application sensor algorithm ))

Refine Results
  1. 1

    Study and Implementation of Data Mining in Urban Gardening by Mohana, Muniandy, Lee, Eu Vern

    Published 2019
    “…The process begins through the monitoring of plants using sensors connected to the Arduino device. Attached sensors generate data and send these data to the Java Servlet application through a WIFI module. …”
    Get full text
    Get full text
    Get full text
    Article
  2. 2

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

    Published 2010
    “…The proposed solution to this problem is based on a general combinatorial optimization algorithm known as Genetic Algorithm, and the load flow equations in distribution network. …”
    Get full text
    Get full text
    Thesis
  3. 3

    Efficient radio resource management algorithms for downlink long term evolution networks by Mamman, Maharazu

    Published 2018
    “…Optimal priority algorithm uses minimum data rate to guarantees resource allocation to users but increases the average delay and deteriorate the network performance. …”
    Get full text
    Get full text
    Thesis
  4. 4
  5. 5

    Performance analysis of genetic algorithm (GA)-based multi-constrained path routing algorithm by Yussof S.

    Published 2023
    “…This paper proposed a solution to the MCP problem using genetic algorithm (GA). The effectiveness of the proposed algorithm is evaluated through simulation. …”
    Article
  6. 6

    A hybrid algorithm for finding shortest path in network routing. by Soltan Aghaei, Mohammad Reza, Ahmad Zulkarnain, Zuriati, Mamat, Ali, Zainuddin, Hishamuddin

    Published 2009
    “…Classical algorithms have been used to search over some space for finding the shortest paths problem between two points in a network and a minimal weight spanning tree for routing. …”
    Get full text
    Article
  7. 7

    A robust GA-based QoS routing algorithm for solving multi-constrained path problem by Yussof S., See O.H.

    Published 2023
    “…Multi-constrained path (MCP) problem refers to the problem of finding a path through a network subject to multiple additive constraints. …”
    Article
  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

    An improved simulated annealing algorithm to avoid crosstalk in optical omega network by Abdullah, Monir, Othman, Mohamed, Johari, Rozita

    Published 2006
    “…When Simulated Annealing (SA) algorithm was used to solve the problem, it gave good results. …”
    Get full text
    Get full text
    Conference or Workshop Item
  11. 11

    The Evolutionary Convergent Algorithm: A Guiding Path of Neural Network Advancement by Hosseini E., Al-Ghaili A.M., Kadir D.H., Daneshfar F., Gunasekaran S.S., Deveci M.

    Published 2025
    “…SGA is used in the process of solving optimization test problems by neural networks. …”
    Article
  12. 12

    Finding multi-constrained path using genetic algorithm by Yussof S., See O.H.

    Published 2023
    “…This paper presents a solution to the MCP problem using genetic algorithm (GA). Through simulation, this algorithm has been shown to give a high probability of finding a feasible path if such paths exist. �2007 IEEE.…”
    Conference paper
  13. 13

    Enhanced Adaptive Confidence-Based Q Routing Algorithms For Network Traffic by Yap, Soon Teck

    Published 2004
    “…In CQ Routing Algorithm, the confidence value (C value) can be used to improve the quality of exploration in Q Routing Algorithm. …”
    Get full text
    Get full text
    Thesis
  14. 14

    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
  15. 15

    Leader election algorithm in 2D torus networks with the presence of one link failure by Refai, M., Sharieh, A., Alshammari, F.

    Published 2010
    “…Leader election algorithms solve the instability problem in the network which is caused by leader failure. …”
    Get full text
    Article
  16. 16

    WCBP: A new water cycle based back propagation algorithm for data classification by Mohd. Nawi, Nazri, Khan, Abdullah, Firdaus, Naim, M. Z., Rehman, Siming, Insaf Ali

    Published 2016
    “…Therefore, this paper proposed the use of WC algorithm in combination with Back-Propagation neural network (BPNN) algorithm to solve the local minima problem in gradient descent trajectory. …”
    Get full text
    Get full text
    Article
  17. 17

    AntNet: a robust routing algorithm for data networks by Haseeb, Shariq, Sidek, Khairul Azami, Ismail, Ahmad Faris, Weng Kin, Lai, Yit Mei, Aw

    Published 2004
    “…Successful implementation and operation of a network largely depends on the routing algorithm in use. …”
    Get full text
    Get full text
    Get full text
    Article
  18. 18

    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
  19. 19

    Hybrib NSGA-II optimization for improving the three-term BP network for multiclass classification problems by Ibrahim, Ashraf Osman, Shamsuddin, Siti Mariyam, Qasem, Sultan Noman

    Published 2015
    “…This paper presents a hybrid of the multiobjective evolutionary algorithm to gain a better accuracy of the fi nal solutions.The aim of using the hybrid algorithm is to improve the multiobjective evolutionary algorithm performance in terms of the enhancement of all the individuals in the population and increase the quality of the Pareto optimal solutions.The multiobjective evolutionary algorithm used in this study is a nondominated sorting genetic algorithm-II (NSGA-II) together with its hybrid, the backpropagation algorithm (BP), which is used as a local search algorithm to optimize the accuracy and complexity of the three-term backpropagation (TBP) network. …”
    Get full text
    Get full text
    Get full text
    Article
  20. 20

    Hybrid NSGA-II Optimization for Improving the Three-Term BP Network for Multiclass Classification Problems by Ibrahim, Ashraf Osman, Shamsuddin, Siti Mariyam, Qasem, Sultan Noman

    Published 2015
    “…The multiobjective evolutionary algorithm used in this study is a nondominated sorting genetic algorithm-II (NSGA-II) together with its hybrid, the backpropagation algorithm (BP), which is used as a local search algorithm to optimize the accuracy and complexity of the three-term backpropagation (TBP) network. …”
    Get full text
    Get full text
    Get full text
    Article