• No results found

Comparison with the T-Algorithm

Comparison of Clustering Algorithm

Comparison of Clustering Algorithm

... K-Means Algorithm K-means clustering is a process of vector quantization, initially from signal processing, that is well-liked for cluster analysis in data ...

6

Comparison of MD5 and Blowfish Algorithm

Comparison of MD5 and Blowfish Algorithm

... MD5 Algorithm” focused on security ...MD5 algorithm urged us to use it to cover the information which needs to be ...MD5 Algorithm” proposed the application of VHDL to implement and to computing MD5 ...

6

Comparison: KNN & SVM Algorithm

Comparison: KNN & SVM Algorithm

... V. CONCLUSION The results and observations show that SVMs are a more reliable more of classifiers. However, KNN is less computationally intensive than SVM. Since, KNN is easy to implement, the classification of ...

6

FFT and IFFT algorithm Comparison

FFT and IFFT algorithm Comparison

... Fourier Transform Tablet Results Figure2. Tablet FFT Results with time Notes and comments: I believe the fastest implementation for this test case is Mark’s algorithm found at ...

7

COMPARISON OF K-MEAN ALGORITHM & APRIORI ALGORITHM – AN ANALYSIS

COMPARISON OF K-MEAN ALGORITHM & APRIORI ALGORITHM – AN ANALYSIS

... the algorithm computes the centroid for each one of the ...the algorithm goes through each step, the value of each centroid is recomputed based on the mean of the values of each attribute of each pattern ...

7

Comparison of Different Scheduling Algorithm for LTE

Comparison of Different Scheduling Algorithm for LTE

... However, it is not simple to meet all of these requirements. The throughput of a UE depends on the different factor like scheduling algorithms, distance from eNodeB, multipath environment, multiple antenna techniques and ...

6

Comparison for selection technique in genetic algorithm

Comparison for selection technique in genetic algorithm

... The idea of Roulette Wheel Selection is the chromosomes with higher fitness value have more chances to be selected than chromosomes with lower fitness value.. The chromosomes with lowe[r] ...

24

Performance comparison of firefly algorithm i...

Performance comparison of firefly algorithm i...

... routing algorithm inspired from ...Prim‟s Algorithm is used to find the weight of the Steiner trees ...our algorithm for implementation in VLSI routing optimization and it also has the flexibility to ...

9

Comparison of FP tree and Apriori Algorithm

Comparison of FP tree and Apriori Algorithm

... growth algorithm and mentions the various drawbacks associated with ...better algorithm with respect to performance has been studied and implemented using the same dataset to give a better understanding of ...

5

Clustering Algorithm Comparison for Ellipsoidal Data

Clustering Algorithm Comparison for Ellipsoidal Data

... Which clustering algorithm is the best? Which clustering should you use if your data is Gaussian? These are both good questions to which there is no clear answer. There are many different uses of clustering ...

224

Effective Comparison of Enhanced DES Algorithm

Effective Comparison of Enhanced DES Algorithm

... Automated information resources are increased day by day and cryptography will continue to increase in importance as a security mechanism. Electronic networks for banking, shopping, inventory control, benefit and service ...

8

COMPARISON OF CARE AND PIGEON ALGORITHM- A REVIEW

COMPARISON OF CARE AND PIGEON ALGORITHM- A REVIEW

... The future work may include the more efficient page ranking concept with novel approach of the combination of two algorithms i.e. CARE and pigeon page rank algorithms. With the help of this novel approach the quality of ...

10

Comparison of SOM Algorithm and K Means Clustering Algorithm in Image Segmentation

Comparison of SOM Algorithm and K Means Clustering Algorithm in Image Segmentation

... The segmentation problem can be informally described as the task of partitioning an image into homogeneous regions. But in the textured images one of the main conceptual difficulties is the definition of a homogeneity ...

5

A localized fault detection algorithm for mobility management in the strongly t diagnosable wireless ad hoc network under the comparison model

A localized fault detection algorithm for mobility management in the strongly t diagnosable wireless ad hoc network under the comparison model

... communication range [3]. Every node is also responsi- ble for forwarding data packets from the other nodes. Therefore, any two individual nodes that are outside their allowable communication range can still communicate ...

11

Comparison of Dijkstra’s Shortest Path Algorithm with  Genetic Algorithm for Static and Dynamic Routing  Network

Comparison of Dijkstra’s Shortest Path Algorithm with Genetic Algorithm for Static and Dynamic Routing Network

... Genetic Algorithm one looks for the best solution among a number of possible solutions represented by one point in the search space ...The algorithm can recombine different solutions to get better ones and ...

10

Comparison of Performance of RR CPU Scheduling Algorithm with Different Dynamic CPU Scheduling Algorithm

Comparison of Performance of RR CPU Scheduling Algorithm with Different Dynamic CPU Scheduling Algorithm

... scheduling algorithm use fixed time quantum in timeshared ...scheduling algorithm is disadvantage for the CPU ...scheduling algorithm and discuss the selection of time quantum for better ...

6

Collaborative Clustering Selection Algorithm Based on T LEACH

Collaborative Clustering Selection Algorithm Based on T LEACH

... and T-LEACH from the energy saving comparison chart of one-hop reception at the same ...improved T-LEACH algorithm saves a lot of total energy consumption at the same time compared with the ...

6

GeomDiff — an algorithm for differential geospatial vector data comparison

GeomDiff — an algorithm for differential geospatial vector data comparison

... diffing algorithm tailored to geospatial vector ...an algorithm and storage format tailored to geospatial vector ...GeomDiff algorithm performs better than or on-par with the alternatives on ...

11

Performance comparison of several kinds of improved genetic algorithm

Performance comparison of several kinds of improved genetic algorithm

... annealing algorithm is used to solve the problem of genetic algorithm local ...genetic algorithm is better than the standard genetic algorithm to obtain the global ...

6

Comparison on the Performance of Genetic Algorithm and Ant Colony Optimization

Comparison on the Performance of Genetic Algorithm and Ant Colony Optimization

... of soft computing a branch of computer science that deals with exploring the search space and select the best solution. A. Working of GA 1. First step towards solving problem using genetic algorithm is the ...

5

Show all 10000 documents...

Related subjects