Search Results - (( java implementation based algorithm ) OR ( problem based graph algorithm ))

Refine Results
  1. 1

    Graph processing hardware accelerator for shortest path algorithms in nanometer very large-scale integration interconnect routing by Ch'ng, Heng Sun

    Published 2007
    “…It has been shown that the performance of a graph-based shortest path algorithm can severely be affected by the performance of its priority queue. …”
    Get full text
    Get full text
    Get full text
    Thesis
  2. 2

    Solving the minimum dominating set problem of partitioned graphs using a hybrid bat algorithm by Abed, S.A., Rais, H.M.

    Published 2020
    “…This paper investigates the swarm intelligence behaviour represented by a population-based approach called the bat algorithm (BA) to find the smallest set of nodes that dominate the graph. …”
    Get full text
    Get full text
    Article
  3. 3
  4. 4

    RSA Encryption & Decryption using JAVA by Ramli, Marliyana

    Published 2006
    “…Today, with online marketing, banking, healthcare and other services, even the average householder is aware of encryption. The implementation of this project will be based on Rapid Application Design Methodology (RAD) and will be more focusing on research and finding, ideas and the implementation of the algorithm, and finally running and testing the algorithm. …”
    Get full text
    Get full text
    Final Year Project
  5. 5
  6. 6

    Direct approach for mining association rules from structured XML data by Abazeed, Ashraf Riad

    Published 2012
    “…The thesis also provides a two different implementation of the modified FLEX algorithm using a java based parsers and XQuery implementation. …”
    Get full text
    Get full text
    Thesis
  7. 7

    Max degree around (MDA) algorithm: a smart and efficient approximate algorithm for Vertex cover and independent set problems by Fayaz, Muhammad, Arshad, S, Shah, A.S, Shah, Asadullah

    Published 2016
    “…Mostly the state of art approximation algorithms for the MVC problem are based on greedy approaches, or inspired from MIS approaches. …”
    Get full text
    Get full text
    Get full text
    Article
  8. 8

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

    Published 2011
    “…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
  9. 9

    Predicting future sales using genetic algorithm: data mining sales / Siti Hajar Yaacob by Yaacob, Siti Hajar

    Published 2014
    “…This problem can cause the imbalance in sales. Based on the problem statement, Genetic Algorithm was applied to test whether it is compatible to predict the future sales. …”
    Get full text
    Get full text
    Thesis
  10. 10

    Hybrid bat algorithm for minimum dominating set problem by Abed, S.A., Rais, H.M.

    Published 2017
    “…Graph domination is one of the NP-Complete problems that cannot be solved exactly in polynomial time. …”
    Get full text
    Get full text
    Article
  11. 11
  12. 12

    Automatic Number Plate Recognition on android platform: With some Java code excerpts by ., Abdul Mutholib, Gunawan, Teddy Surya, Kartiwi, Mira

    Published 2016
    “…The main challenges of implementing ANPR algorithm on mobile phone are how to produce a higher coding efficiency, lower computational complexity, and higher scalability. …”
    Get full text
    Get full text
    Get full text
    Book
  13. 13

    Evolutionary cost-cognizant regression test case prioritization for object-oriented programs by Bello, AbdulKarim

    Published 2019
    “…Afterward evolutionary algorithm (EA) was employed to prioritize test cases based on the rate severity of fault detection per unit test cost. …”
    Get full text
    Get full text
    Thesis
  14. 14

    Heuristic factors in ant system algorithm for course timetabling problem by Djamarus, Djasli, Ku-Mahamud, Ku Ruhana

    Published 2009
    “…This paper presents an algorithm that is based on ant system to solve the course timetabling problem.The problem is modeled using the bipartite graph.Four heuristic factors are derived from the graph characteristic, are used to direct ants as the agent in finding course timetable elements The concept of negative pheromone was also applied to ensure that paths leading to dead ends are not chosen.The performance of this proposed algorithm is promising when comparison of performance was made with the original ant system algorithm. …”
    Get full text
    Get full text
    Conference or Workshop Item
  15. 15

    Synthesis of transistor-chaining algorithm for CMOS cell layout using bipartite graph / Azizi Misnan by Misnan, Azizi

    Published 1997
    “…This project implement a algorithm for the optimal transistor chaining problem in CMOS functional cell layout based on Uehara and vanCleemput's layout style [1] which assumed that the height of each logic module layout is constant and performed the optimisation by decomposing the graph module into a minimum number of sub graph having a dual Euler (d-Euler) trail.. …”
    Get full text
    Get full text
    Thesis
  16. 16

    African Buffalo Optimization (ABO): A New Metaheuristic Algorithm by Odili, Julius Beneoluchi, M. N. M., Kahar

    Published 2015
    “…The African Buffalo Optimization (A.B.0) algorithm simulates the African buffalos' behaviour by encapsulation in a mathematical model; which solves a number of discrete optimization problems using graph-based route planning, job scheduling and it extends Swarm Intelligence paradigms. …”
    Get full text
    Get full text
    Get full text
    Article
  17. 17

    Frequent itemset mining using graph theory / Mohammad Arsyad Mohd Yakop by Mohd Yakop, Mohammad Arsyad

    Published 2017
    “…The Directed Acyclic Graph in High Dimensional Dataset Mining (DAGHDDM) is a graph-based mining algorithm that represents itemsets in complete graph before FIM takes place. …”
    Get full text
    Get full text
    Thesis
  18. 18

    Audio Streaming System Using Real-Time Transport Protocol Based on Java Media Framework by Asaad Aref, Ibrahim

    Published 2004
    “…A design proposal was outlined to provide an adaptive client/server approach to stream audio contents using Real-Time Transport Protocol (RTP) involving architecture based on the Java Media Framework (JMF) Application Programmable Interfaces (API).RTP protocol is the Internet-standard protocol for the transport of real-time data, including audio and video and can be implemented by using Java Media Framework (JMF). …”
    Get full text
    Get full text
    Thesis
  19. 19

    An Improved-Time Polynomial-Space Exact Algorithm For TSP In Degree-5 Graphs by Md Yunos, Norhazwani, Shurbevski, Aleksandar, Nagamochi, Hiroshi

    Published 2017
    “…While the base of the exponent in the running time bound of our algorithm is greater than 2, it still outperforms Gurevich and Shelah’s O∗(4nnlog n) polynomial-space exact algorithm for the TSP in general graphs (SIAM Journal of Computation, Vol.16, No.3, pp.486–502, 1987). …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  20. 20

    Image matching using relational graph representation by Lai, Chui Yen

    Published 2005
    “…Various image matching techniques using image features have been known in literature. Feature-based matching algorithm cannot tackle the problem of matching ambiguities easily. …”
    Get full text
    Get full text
    Thesis