"It takes considerable knowledge just to realize the extent of your own ignorance."
The previous article discussed transferring knowledge from one completed problem to a new problem. However, such sequential transfer of knowledge requires that there exist completed problems. But there could be times when we have to…
Memetic automatons leverage knowledge gained from solving previous problems to solve new optimization problems faster and more effectively. …
This article discusses how we can use data to automatically select the best meme from a pool of memes, thereby negating the need for human intervention. …
Memetic computation is an extension of evolutionary computation that combines the use of memes and genes to produce better solutions. In this article, we discuss what memes are, and how they make evolutionary algorithms better,…
Evolutionary algorithms are heuristic search and optimization algorithms that imitate the natural evolutionary process. This article puts evolutionary algorithms into context and explains their basic functionality. Consequently, we first examine why we prefer heuristic algorithms…
Mininet is a popular network emulator that allows us to create virtual networks using virtual hosts, switches, and controllers. Recently, I faced the need to run multiple Docker containers within virtual hosts in Mininet. This…
Service Function Chaining (SFC) leverages Network Function Virtualization (NFV) and Software Defined Networking (SDN) to create a programmable and dynamic network paradigm that allows networks to keep up with modern demands. This article briefly discusses…
Network Function Virtualization (NFV) is the latest chapter in computer networks that tries to solve some of the pressing concerns with traditional networks. What is NFV and why is it all the rage? How does…
Tournament selection is one of the many selection strategies we use in Genetic Algorithms (GAs) to select individuals for crossover. In this article, we will take a quick look at GAs, selection strategies, and finally…
Non-Dominated Sorting Genetic Algorithm II (NSGA II) is an evolutionary algorithm, which we use in multi-objective optimization scenarios. This article dwells on the nuts and bolts of the NSGA II algorithm while providing a brief…
We make ChatGPT, Bard and Bing write a simple yet tricky React app and see who wins this battle of the chatbots.…
In this article, let’s try to find how many blocks a recipient should wait for before accepting a transaction. …
In the previous article, we found the probability of double-spending. In this article, let’s look at the probability of an attacker mining a certain number of blocks with a hash rate of less than 50%.…
We tried to understand the 51% attack through the gambler’s ruin problem and the probability of a gambler winning T dollars in the last article. Let’s look at how we can apply the equation we…
This article discusses the solution to the gambler’s ruin problem as a precursor to understanding the probability of double spending. …
So far, we have briefly touched upon the idea of the 51% attack and how it actually allows double spending to happen. In this article, we will start to look at the theoretical basis of the 51% attack.…