Imagine a town with two widget merchants. Customers prefer cheaper widgets, so the merchants must compete to set the lowest price. Unhappy with their meager profits, they meet one night in a ...
Abstract: Many online resource allocation algorithms have been recently proposed to handle optimization problems in dynamic scenarios. However, none of these algorithms have been designed to take into ...
Abstract: Nowadays, owing to the advancement of technology, plug-in electric vehicles (PEVs) enable microgrids (MGs) to balance local generation and demand through vehicle-to-grid technology and ...
This project provides a massively parallel implementation of a Minimum Spanning Tree (MST) graph algorithm using NVIDIA CUDA. The implementation is based on Borůvka's algorithm, which is highly ...
This is a compilation of basic to advanced data structures, graph theory algorithms, dynamic programming, recursion, sorting, searching, and even string algorithms ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results