Article Categories
- All Categories
-
Data Structure
-
Networking
-
RDBMS
-
Operating System
-
Java
-
MS Excel
-
iOS
-
HTML
-
CSS
-
Android
-
Python
-
C Programming
-
C++
-
C#
-
MongoDB
-
MySQL
-
Javascript
-
PHP
Algorithms Articles
Page 10 of 39
Why does machine learning use GPUs?
The GPU (graphics processing unit) is now the backbone of AI. Originally developed to speed up graphics processing, GPUs can greatly expedite the computing operations needed in deep learning. Many modern applications failed because machine learning needed more active, accurate, or both. Large neural networks benefited significantly from the incorporation and use of GPUs. Autonomous vehicles and face recognition are two examples of how deep learning has revolutionized technology. In this article, we'll discuss why GPUs are so useful for machine learning applications − How do Graphics Processing Units Work? As with every neural network, the deep learning model's training ...
Read MoreUnlock the Secrets Behind Our Game-Changing Probabilistic Shortest Path Algorithm for Optical Networks
Discover the power of probabilistic shortest path routing algorithm for optical networks. Learn how this innovative approach could revolutionize network performance. Introduction In today's data-driven world, optical networks play a crucial role in ensuring fast and reliable communication. One key aspect of optimizing these networks is implementing effective routing algorithms to find the shortest paths between nodes. Enter the probabilistic shortest path routing algorithm for optical networks - an innovative solution designed to enhance network performance, latency and reliability. By leveraging cutting-edge techniques such as Dijkstra's algorithm, fuzzy logic, and graph theory, this approach offers promising results in improving throughput ...
Read MoreMinimum Bottleneck Spanning tree(MBST)
The Minimum Bottleneck Spanning tree is an undirected graph whose highest weight is considered as minimum as possible. Let’s take an example to understand the Minimum Bottleneck Spanning tree. In Figure I, we observe that there are three possible ways of spanning trees that have the common edge 2 and it means there is no other tree having a bottleneck value less than 2. Therefore, all these trees verify as Minimum Bottleneck Spanning trees. How we can say that the MST is MBST? There are the following points to understand the MST to be MBST − MBST ...
Read MoreDifference between Backtracking and Branch-N-Bound technique
The Backtracking technique is an algorithm used to solve the decision problem whereas the Branch-N-Bound technique is an algorithm used to solve the optimization problem. Both techniques follow the brute force method and are used to generate the State Space tree. A State Space tree is the tree that represents the nodes in all possible states of the problem from a root node to the terminal node.Let us learn both techniques one by one and understand the difference in detail. Backtracking Technique Backtracking is the modified process of the brute force approach where the technique efficiently searches for a solution ...
Read MoreWhat are different models in machine learning?
The program that trains the learning sequence of a machine is called the learning model of that machine. A machine learning model is a programmed pattern of training that makes conclusions from the dataset that is previously used in machine learning. There are different machine learning models which are divided into different factors, like the type of task given to the machine. Models in Machine Learning The process of algorithmic learning methods to find certain scenarios and give outputs is known as the machine learning model. A specific pattern or output is found from the dataset, while training is called ...
Read MoreBlock Cipher Design Principles
Block Cipher is an encryption algorithm that works with a symmetric key in a deterministic way. The plain text is divided into several blocks of equal size. If the length of the plain text does not allow block division of equal size, padding is done over the plain text. His type of encryption method can encrypt on blocks of 128 bits, the key can be 128, 192, or 256 bits. In block ciphers, the length of the plain text is equal to the length of the cipher text. This type of encryption process considered each block at a time and ...
Read MoreLongest Job First (LJF) CPU Scheduling Algorithm
Longest Job First (LJF) is a CPU scheduling algorithm that prioritizes processes based on their burst time. In LJF, the processes with the largest burst time are given priority over the shorter ones. This algorithm works on a non-preemptive basis, meaning once a process is started, it will continue to run until it completes, and no other process can preempt it. To implement the LJF algorithm, processes are sorted in the ready queue based on their burst times in descending order. The process with the largest burst time among all the processes that have arrived until that time is selected ...
Read MoreLinear Scheduling Method in Operating System
Introduction Linear Scheduling Method is a scheduling algorithm designed for real-time systems in which tasks must be completed within specific time frames to ensure the system's proper operation. It is a straightforward algorithm that assigns tasks based on their deadlines and provides them with fixed time slices to complete their execution. In this article, we will learn about the Linear Scheduling Method its various elements, its advantages and disadvantages of usage in an Operating System What is Linear Scheduling Method in Operating System? The tasks in LSM are arranged in a linear order, and the scheduler moves through the list, ...
Read MoreLeast Slack Time (LST) scheduling Algorithm in real-time systems
The Least Slack Time (LST) scheduling algorithm is a real-time scheduling algorithm that prioritizes tasks based on the amount of time remaining before a task's deadline. The LST algorithm's basic idea is to schedule the task with the least slack time first because it has the least amount of time before its deadline. Real-time systems are intended to handle tasks or jobs with strict time constraints. These tasks are frequently carried out in a periodic or ad hoc fashion, with each task having a specific deadline by which it must be completed. Real-time scheduling algorithms aid in the completion of ...
Read MoreLamportís Algorithm for Mutual Exclusion in Distributed System
Multiple processes that are running on various machines or nodes and interacting with one another to accomplish a single objective makeup distributed systems. In these systems, it's crucial to make sure that only one process is able to utilize a shared resource at once to prevent conflicts and data inconsistencies. One way to make sure that only one function is using a shared resource at once is through the use of mutual exclusion and Lamport's Algorithm is one of many accessible mutual exclusion algorithms. Lamportís Algorithm A centralized mutual exclusion algorithm called Lamport's Algorithm employs timestamps to determine the sequence ...
Read More