Search Results - (( integer implementation function algorithm ) OR ( java implementation path algorithm ))*
Search alternatives:
- implementation function »
- integer implementation »
- java implementation »
- implementation path »
- function algorithm »
- path algorithm »
-
1
Projecting image on non-planar surface with zero-th order geometric continuity using simple dual-linear function and manipulation of strict integer implementation in programming la...
Published 2015“…Usage of a projection system to display large screen images is still relevant in the midst of LED-based display increasing popularity.This is due to that the system itself is a mature technology, reliable and cheaper than the LED counterpart.While various methods had addressed the projection problems on curve surface, projecting image on jagged like surface (zero order geometric continuity) has yet to be studied in depth.This paper proposes a method for projecting image on non-planar surface with zero-order geometric continuity property using parametric modeling.The method manipulate linear function by combining two functions into one by taking advantage of computer programs strict implementation of integer variables.The method was applied to grid-based texturing algorithm in order to create the desired zero-continuity effect on the surface.The method was compared with texturing that implement existing curve algorithm to project image on the screen.Visual evaluation results showed that the proposed method fared better compared to existing curve-based projection algorithm.…”
Get full text
Get full text
Get full text
Conference or Workshop Item -
2
Heavy Transportation Shortest Route using Dijkstra’s algorithm (HETRO) / Nurul Aqilah Ahmad Nezer
Published 2017“…The development tools used in developing this project is NetBeans by using Java for the implementation of the coding. The methodology that used for developing this system is the Dijkstra’s algorithm. …”
Get full text
Get full text
Thesis -
3
Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization
Published 2019“…BST inserts the nodes in the way that the Dijkstra’s can find the empty parking in fastest way. Dijkstra’s algorithm initials the paths to finding the shortest path while ACO optimizes the paths. …”
Get full text
Get full text
Thesis -
4
Path planning for unmanned aerial vehicle (UAV) using rotated accelerated method in static outdoor environment
Published 2021“…In this study, a fast iterative method known as Rotated Successive Over-Relaxation (RSOR) is introduced. The algorithm is implemented in a self-developed 2D Java tool, UAV Planner. …”
Get full text
Get full text
Get full text
Get full text
Article -
5
Smart appointment organizer for mobile application / Mohd Syafiq Adam
Published 2009“…The main component of this prototype is the use of Dijkstra algorithm to compute the shortest path from source of appointment to the 6 points of destinations within UiTM Shah Alam. …”
Get full text
Get full text
Thesis -
6
Approximation techniques
Published 2020“…This chapter will focus on practical realization or equivalent circuit implementation of the fractional-order systems and controllers in a finite-dimensional integer-order system. …”
Get full text
Get full text
Article -
7
Development of symbolic algorithms for certain algebraic processes
Published 2007“…For more definitive conclusions, the computing time functions of the algorithms that are presented in this report have been worked out. …”
Get full text
Get full text
Get full text
Monograph -
8
Development of symbolic algorithms for certain algebraic processes
Published 2007“…For more definitive conclusions, the computing time functions of the algorithms that are presented in this report have been worked out. …”
Get full text
Get full text
Get full text
Monograph -
9
Investigation on pattern based Algorithm for division by a constant number using Verilog code for optimization on the Nelust results
Published 2015“…The result is rounded to the nearest integer for divisors of 3, 5, 6, 7 and 9. The methodology of this research are involving design specification, high level design using C++, RTL level description using Verilog, functional verification and logic synthesis using two different technology library. …”
Get full text
Get full text
Research Report -
10
Modified ant colony optimization algorithms for deterministic and stochastic inventory routing problems / Lily Wong
Published 2018“…The computational results show that the algorithms which implement this new formulation are able to produce better solutions. …”
Get full text
Get full text
Get full text
Thesis -
11
-
12
-
13
-
14
Hardware Acceleration of Window Big-Digit (Wbd) Multiplication for Embedded Applications
Published 2015“…The test programs are The hardware-accelerated 256-bits multiplication is found that to be 340 fold faster than pure software implementation of classical multiplication. This shows that wBD algorithm can be optimally implemented in hardware and demonstrates excellent speed gain over pure software implementation. …”
Get full text
Get full text
Thesis -
15
Efficient genetic partitioning-around-medoid algorithm for clustering
Published 2019“…Besides, these algorithms more frequently implemented with the lengthy and redundant fixed N length integer encoding. …”
Get full text
Get full text
Thesis -
16
-
17
Optimization of Upstream Offshore Oilfield Production Planning under Uncertainty and Downstream Crude Oil Scheduling at Refinery Front-End
Published 2012“…A continuous time model based on transfer events is used to represent the scheduling problem and this model is a nonconvex MINLP model which presents multiple local optima. We implement a branch-and-contract algorithm that aims at reducing the size of the search region. …”
Get full text
Get full text
Final Year Project -
18
Optimization of Upstream Offshore Oilfield Production Planning under Uncertainty and Downstream Crude Oil Scheduling at Refinery Front-End
Published 2009“…Acontinuous time model based on transfer events is used to represent the scheduling problem and this model is a nonconvex MINLP model which presents multiple local optima. We implement a branch-and-contract algorithm that aims at reducing the size of the search region. …”
Get full text
Get full text
Final Year Project -
19
Rational methods for solving first order ordinary differential equation
Published 2019“…The formulation of the methods are based on two distinct rational functions that are proposed in thesis, where the first class of methods are derived based on rational function with denominator of degree one, as the degree of the numerator increases. …”
Get full text
Get full text
Thesis -
20