@article {10.3844/jcssp.2018.747.752,
article_type = {journal},
title = {Highly-Available, Collaborative, Trainable Communication – a Policy – Neutral Approach},
author = {Schreibaumer, Christian and Stein, Isabella and Dobermann, Eberhard},
volume = {14},
number = {6},
year = {2018},
month = {Apr},
pages = {747-752},
doi = {10.3844/jcssp.2018.747.752},
url = {https://thescipub.com/abstract/jcssp.2018.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.},
journal = {Journal of Computer Science},
publisher = {Science Publications}
}