Search Results - (( storage optimization path algorithm ) OR ( parallel distribution mining algorithm ))
Search alternatives:
- parallel distribution »
- storage optimization »
- distribution mining »
- optimization path »
- mining algorithm »
- path algorithm »
-
1
Robotic indoor path planning using dijkstra's algorithm with multi-layer dictionaries
Published 2016“…The adjacency matrix is the naive storage structure of the algorithm. This storage structure has limited the use of the algorithm as it expands large storage space. …”
Get full text
Get full text
Conference or Workshop Item -
2
-
3
Modeling and multi-objective optimal sizing of standalone photovoltaic system based on evolutionary algorithms
Published 2020“…The IEM algorithm uses the attraction-repulsion mechanism to change the positions of solutions towards the optimality. …”
Get full text
Get full text
Thesis -
4
Comprehensive review of drones collision avoidance schemes: challenges and open issues
Published 2024“…We explore collision avoidance methods for UAVs from various perspectives, categorizing them into four main groups: obstacle detection and avoidance, collision avoidance algorithms, drone swarm, and path optimization. Additionally, our analysis delves into machine learning techniques, discusses metrics and simulation tools to validate collision avoidance systems, and delineates local and global algorithmic perspectives. …”
Get full text
Get full text
Get full text
Article -
5
Random sampling method of large-scale graph data classification
Published 2024“…Mining a large number of graphs becomes a challenging task because state-of-the-art methods are not scalable due to the memory limit. …”
Get full text
Get full text
Get full text
Article -
6
K Nearest Neighbor Joins And Mapreduce Process Enforcement For The Cluster Of Data Sets In Bigdata
Published 2018“…K Nearest Neighbor Joins (KNN join) are regarded as highly primitive and expensive operations in the data mining.The efficient use of KNN join has proven good results in finding the objects from two data sets prevailed in the huge databases.This has been achieved with the combination of K-Nearest Neighbor query and join operation to find the distinct objects from different data sets.MapReduce is a newly introduced program with the combination of Map Procedure method and Reduce Method widely used in BigData.MapReduce is enriched with parallel distributed algorithm to find the results on a cluster of data sets in BigData.In this paper,the combination of KNN join and MapReduce methods are utilized on the cluster of data sets in BigData for knowledge discovery.Exploring the pinpoint data from huge data sets stored in Big Data demands the distributed large scale data processing.The present research paper is focusing on generic steps for KNN joins exploration operations on MapReduce.The operations of KNN Join are targeted to perform the data partitioning and data pre-processing and necessary calculations.By utilizing the combination of KNN joins with MapReduce methods on BigData data sets will demonstrate a solution for complex computational analysis. …”
Get full text
Get full text
Get full text
Article -
7