ABSTRACT: Microservices have revolutionized traditional software architecture. While monolithic designs continue to be common, particularly in legacy applications, there is a growing trend towards the ...

Abstract: The Hungarian algorithm is a fundamental approach for a number of matching problems that find corresponding elements in two sets. For instance, the optimal alignment of proteins. Due its ...

Abstract: Here we propose for the first time a temporal intuitionistic fuzzy extension of the Hungarian method for solving the Travelling Salesman Problem (TIFHA-TSP) based on intuitionistic fuzzy ...

Z- algorithm for pattern matching, Trie-Aho-Corasick Automaton(FGREP), Hungarian Algorithm for the Munkres Assignment Problem, Binary Lifting, Eulerian Tour for Least Common Ancestor(LCA) using Sparse ...

Matches JSON-keys and values best effort using translations, synonyms and Levenshtein distance. Also provides value and unit conversion of the associated JSON-values. Part of a Seminar Thesis at the ...