Search Results - (( intelligence based tree algorithm ) OR ( intelligence fail from algorithm ))
Search alternatives:
- intelligence based »
- intelligence fail »
- tree algorithm »
- from algorithm »
- based tree »
- fail from »
-
1
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 -
2
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 -
3
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 -
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
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 -
8
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 -
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
Improvement on agglomerative hierarchical clustering algorithm based on tree data structure with bidirectional approach
Published 2024Subjects:Conference Paper -
11
Development of a Prediction Algorithm using Boosted Decision Trees for Earlier Diagnoses on Obstructive Sleep Apnea
Published 2018“…This research develops a knowledge-based system by using computational intelligent approaches based on Boosting algorithms on decision trees augmented by pruning techniques and Association Rule Mining. …”
Get full text
Get full text
Thesis -
12
E2IDS: an enhanced intelligent intrusion detection system based on decision tree algorithm
Published 2022“…The model design is Decision Tree (DT) algorithm-based, with an approach to data balancing since the data set used is highly unbalanced and one more approach for feature selection. …”
Get full text
Get full text
Article -
13
Intelligent cooperative web caching policies for media objects based on decision tree supervised machine learning algorithm
Published 2014“…Moreover, cache pollution is a drawback of traditional web caching policies such as Least Frequently Used (LFU), Least Recently Used (LRU), and Greedy Dual Size (GDS) where web objects that are stored in the cache are not visited frequently. In this work, new intelligent cooperative web caching approaches based on decision tree supervised machine learning algorithm are presented. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
14
-
15
Ensemble-based machine learning algorithms for classifying breast tissue based on electrical impedance spectroscopy
Published 2020“…Therefore, we aimed to classify six classes of freshly excised tissues from a set of electrical impedance measurement variables using five ensemble-based machine learning (ML) algorithms, namely, the random forest (RF), extremely randomized trees (ERT), decision tree (DT), gradient boosting tree (GBT) and AdaBoost (Adaptive Boosting) (ADB) algorithms, which can be subcategorized as bagging and boosting methods. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
16
Intelligent cooperative web caching policies for media objects based on J48 decision tree and naïve Bayes supervised machine learning algorithms in structured peer-to-peer systems
Published 2016“…Moreover, traditional web caching policies such as Least Recently Used (LRU), Least Frequently Used (LFU), and Greedy Dual Size (GDS) suffer from caching pollution (i.e. media objects that are stored in the cache are not frequently visited which negatively affects on the performance of web proxy caching). In this work, intelligent cooperative web caching approaches based on J48 decision tree and Naïve Bayes (NB) supervised machine learning algorithms are presented. …”
Get full text
Get full text
Get full text
Article -
17
-
18
-
19
An algorithm for the selection of planting lining technique towards optimizing land area: an algorithm for planting lining technique selection
Published 2012“…The huge possible solution and uncertain result make the problem complex and it requires an intelligent expect for the solution. The algorithm is designed based on two basic works in which to calculate number of trees and divide an area into blocks. …”
Get full text
Get full text
Conference or Workshop Item -
20
