Journal of Computer Science

Highly-Available, Collaborative, Trainable Communication – a Policy – Neutral Approach

Christian Schreibaumer, Isabella Stein and Eberhard Dobermann

DOI : 10.3844/jcssp.2018.747.752

Journal of Computer Science

Volume 14, Issue 6

Pages 747-752

Abstract

Scalable theory have led to many advances. Data flow is constantly growing and systems are expanding. Theoretical principles of red-black trees can help to build a scalable system, where data easily can expand and in the end energy is saved. We propose a novel solution, an organizational platform, an algorithm for the analysis of agents, which we call Mop. With experimental results we show, that Mop is faster than the Apriori or any other algorithm concerning scalable theory. Mop is even faster than the ADFD-growth algorithm, especially when tested in a very low key RAM environment.

Copyright

© 2018 Christian Schreibaumer, Isabella Stein and Eberhard Dobermann. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.