Search Results - (( initial solving tree algorithm ) OR ( using codification based algorithm ))
Search alternatives:
- using codification »
- codification based »
- initial solving »
- tree algorithm »
- solving tree »
-
1
Hybrid tabu search – strawberry algorithm for multidimensional knapsack problem
Published 2022“…In 2011, a new metaheuristic known as Strawberry algorithm (SBA) was initiated. Since then, it has been vastly applied to solve engineering problems. …”
Get full text
Get full text
Get full text
Thesis -
2
Guidance system based on Dijkstra-ant colony algorithm with binary search tree for indoor parking system
Published 2021“…A common algorithm to solve the single-source shortest path (SSSP) is the Dijkstra algorithm. …”
Get full text
Get full text
Get full text
Article -
3
An Integrated RRT*SMART-A* Algorithm for solving the Global Path Planning Problem in a Static Environment
Published 2023“…The use of sampling-based algorithms such as Rapidly-Exploring Random Tree Star (RRT*) has been widely applied in robot path planning. …”
Get full text
Get full text
Get full text
Article -
4
AN INTEGRATED RRT*SMART-A* ALGORITHM FOR SOLVING THE GLOBAL PATH PLANNING PROBLEM IN A STATIC ENVIRONMENT
Published 2023“…The use o = sampling-based algorithms such as Rapidly-Exploring Random Tree Star (RRT*) has been widely applied in robot path planning. …”
Get full text
Get full text
Get full text
Article -
5
AN INTEGRATED RRT*SMART-A* ALGORITHM FOR SOLVING THE GLOBAL PATH PLANNING PROBLEM IN A STATIC ENVIRONMENT
Published 2023“…The use o = sampling-based algorithms such as Rapidly-Exploring Random Tree Star (RRT*) has been widely applied in robot path planning. …”
Get full text
Get full text
Get full text
Article -
6
AN INTEGRATED RRT*SMART-A* ALGORITHM FOR SOLVING THE GLOBAL PATH PLANNING PROBLEM IN A STATIC ENVIRONMENT
Published 2023“…The use o = sampling-based algorithms such as Rapidly-Exploring Random Tree Star (RRT*) has been widely applied in robot path planning. …”
Get full text
Get full text
Get full text
Article -
7
-
8
Disparity map algorithm using hierarchical of bitwise pixel differences and segment-tree from stereo image
Published 2024“…This stage utilizes XOR gate to produce the initial disparity map. The next stage involves the utilization of Segment Tree (ST) to eliminate the noise at aggregation step. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
9
AN INTEGRATED RRT*SMART-A* ALGORITHM FOR SOLVING THE GLOBAL PATH PLANNING PROBLEM IN A STATIC ENVIRONMENT
Published 2023“…The use o = sampling-based algorithms such as Rapidly-Exploring Random Tree Star (RRT*) has been widely applied in robot path planning. …”
Get full text
Get full text
Get full text
Article -
10
AN INTEGRATED RRT*SMART-A* ALGORITHM FOR SOLVING THE GLOBAL PATH PLANNING PROBLEM IN A STATIC ENVIRONMENT
Published 2023“…The use o = sampling-based algorithms such as Rapidly-Exploring Random Tree Star (RRT*) has been widely applied in robot path planning. …”
Get full text
Get full text
Get full text
Article -
11
AN INTEGRATED RRT*SMART-A* ALGORITHM FOR SOLVING THE GLOBAL PATH PLANNING PROBLEM IN A STATIC ENVIRONMENT
Published 2023“…The use o = sampling-based algorithms such as Rapidly-Exploring Random Tree Star (RRT*) has been widely applied in robot path planning. …”
Get full text
Get full text
Get full text
Article -
12
AN INTEGRATED RRT*SMART-A* ALGORITHM FOR SOLVING THE GLOBAL PATH PLANNING PROBLEM IN A STATIC ENVIRONMENT
Published 2023“…The use o = sampling-based algorithms such as Rapidly-Exploring Random Tree Star (RRT*) has been widely applied in robot path planning. …”
Get full text
Get full text
Get full text
Article -
13
AN INTEGRATED RRT*SMART-A* ALGORITHM FOR SOLVING THE GLOBAL PATH PLANNING PROBLEM IN A STATIC ENVIRONMENT
Published 2023“…The use o = sampling-based algorithms such as Rapidly-Exploring Random Tree Star (RRT*) has been widely applied in robot path planning. …”
Get full text
Get full text
Get full text
Article -
14
Using predictive analytics to solve a newsvendor problem / S. Sarifah Radiah Shariff and Hady Hud
Published 2023“…Secondly, in solving every Machine Learning problem, there is no one algorithm superior to other algorithms. …”
Get full text
Get full text
Book Section -
15
Multivalue-multistage method for second-order ODEs
Published 2016“…A general approach to study the order conditions of the methods for solving second-order initial value problems is investigated. …”
Get full text
Get full text
Conference or Workshop Item -
16
Rule extraction from multi-layer perceptron neural network using decision tree for currency exchange rates forecasting
Published 2015“…The results on decision tree induction show that C4.5 algorithm induction produced a significant result in term of accuracy 84.07% - 86.34%, precision and recall 93.17% and 81.97% respectively. …”
Get full text
Get full text
Thesis -
17
Disparity map algorithm for stereo matching process using local based method
Published 2022“…At this stage, the proposed work uses the combination of Absolute Difference (AD) and Gradient Matching (GM) to produce the initial disparity map. Second stage, the Minimum Spanning Tree (MST) is utilised to remove noise from the initial disparity map. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
18
-
19
Design Of Feature Selection Methods For Hand Movement Classification Based On Electromyography Signals
Published 2020“…The first method is the Binary Tree Growth Algorithm (BTGA), which implements a hyperbolic tangent function to convert the Tree Growth Algorithm into the binary version. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
20
Energy-aware task scheduling for streaming applications on NoC-based MPSoCs
Published 2024“…We propose a novel unified approach that integrates task-level software pipelining with Dynamic Voltage and Frequency Scaling (DVFS) to solve the problem. Our approach is supported by a set of novel techniques, which include constructing an initial schedule based on a list scheduling where the priority of each task is its approximate successor-tree-consistent deadline such that the workload across all the processors is balanced, a retiming heuristic to transform intraperiod dependencies into inter-period dependencies for enhancing parallelism, assigning an optimal discrete frequency for each task and each message using a Non-Linear Programming (NLP)-based algorithm and an Integer-Linear Programming (ILP)-based algorithm, and an incremental approach to reduce the memory usage of the retimed schedule in case of memory size violations. …”
Get full text
Get full text
Get full text
Article
