Search Results - (( java implication tree algorithm ) OR ( _ construct ((parallel algorithm) OR (path algorithm)) ))

Refine Results
  1. 1
  2. 2

    Algebraic Net Class Rewriting Systems, Syntax and Semantics for Knowledge Representation and Automated Problem Solving by Tirri, Seppo Ilari

    Published 2013
    “…New results are obtained within construction of problem solving systems where solution algorithms are derived parallel with other candidates applied to the same net classes. …”
    Get full text
    Get full text
    Journal
  3. 3

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

    CSC773 - Parallel Computing / College of Computing, Informatics And Media by UiTM, College of Computing, Informatics And Media

    Published 2023
    “…It emphasizes the decomposition and mapping techniques in constructing parallel algorithms. The parallel programming paradigms, namely, the shared address space and message passing are applied to implement parallel programs. …”
    Get full text
    Get full text
    Get full text
    Teaching Resource
  5. 5

    Speeding up index construction with GPU for DNA data sequences by Rahmaddiansyah, , Abdul Rashid, Nur’aini

    Published 2011
    “…Graphic processor unit (GPU) is used to parallelize a segment of an indexing algorithm. In this research, we used a GPU to parallelize the sorting part of suffix array construction algorithm.Our results show that the GPU is able to accelerate the process of building the index of the suffix array by 1.68 times faster than without GPU.…”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  6. 6

    On An Improved Parallel Construction Of Suffix Arrays For Low Bandwidth Pc-Cluster. by Kok, Jun Lee, Abdul Rashid, Nur'Aini, Abdullah, Rosni, Md. Ali, Norhashidah

    Published 2003
    “…An algorithm for the parallel construction of suffix arrays generation for any texts with larger alphabet size on distributed memory architecture is presented…”
    Get full text
    Get full text
    Conference or Workshop Item
  7. 7

    A generalized laser simulator algorithm for optimal path planning in constraints environment by Aisha, Muhammad

    Published 2022
    “…The suggested algorithm outperforms the competition in terms of improving path cost, smoothness, and search time. …”
    Get full text
    Thesis
  8. 8

    Communication in Chordal Ring Networks by Matroud, Atheer Abbas

    Published 2006
    “…Based on the existing results in [61] done by Narayanan and Opatrny, we propose a new algorithm for some families of chordal ring of degree six graphs. …”
    Get full text
    Get full text
    Thesis
  9. 9

    A hybrid sampling-based path planning algorithm for mobile robot navigation in unknown environments by Khaksar, Weria

    Published 2013
    “…Sampling-based motion planning is a class of randomized path planning algorithms with proven completeness. …”
    Get full text
    Get full text
    Thesis
  10. 10

    Route optimization using shortest path method / Muhamad Faisal Amin Shakri by Shakri, Muhamad Faisal Amin

    Published 2025
    “…This study investigated the implementation and comparison between well known shortest path method which are Dijkstra’s algorithm, Bellman-Ford, and A* algorithm. …”
    Get full text
    Get full text
    Thesis
  11. 11

    Performance comparison between genetic algorithm and ant colony optimization algorithm for mobile robot path planning in global static environment / Nohaidda Sariff by Sariff, Nohaidda

    Published 2011
    “…In the initial stage, the test environments were constructed. Subsequently, both algorithms were applied to the test environments. …”
    Get full text
    Get full text
    Thesis
  12. 12
  13. 13

    Wi-fi fingerprint database construction using Chebyshev wavelet functions by Narzullaev, Anvar, Nemadaliev, Azamjon, Selamat, Mohd Hasan, Othman, Mohamed, Sharif, Khaironi Yatim

    Published 2015
    “…Proposed algorithm combines the reference data collection procedure with path-loss prediction. …”
    Get full text
    Get full text
    Conference or Workshop Item
  14. 14
  15. 15

    An efficient algorithm to improve oil-gas pipelines path by Hasan Almaalei, Nabeel Naeem, Mohd Razali, Siti Noor Asyikin, Mohammed Alduais, Nayef Abdulwahab

    Published 2018
    “…Therefore, the aim of this study is to propose a new algorithm to obtain the shortest path connecting oil-gas wells and addressing obstacles that may appear on the path connecting any two wells. …”
    Get full text
    Article
  16. 16

    Fast Finite Difference Time Domain Algorithms for Solving Antenna Application Problem by Hasan, Mohammad Khatim

    Published 2008
    “…Results show that these new sequential and parallel algorithms run faster than the standard sequential and parallel FDTD algorithms. …”
    Get full text
    Get full text
    Thesis
  17. 17

    GIS mapping and shortest-path algorithm for drone-aided flood rescue operations by Schigdar, Ahmad, Zaman, Nafees, Hassan, Raini

    Published 2019
    “…This research aims to implement Geographic Information System (GIS) mapping to identify the major parts of an affected state that are more susceptible to floods and the construction of an optimal shortest path algorithm to conduct the rescue operation.…”
    Get full text
    Get full text
    Get full text
    Proceeding Paper
  18. 18
  19. 19

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