Article citationsMore >>

Anderson, P. Robinson, and M. Blum, “Loss-less algorithms for Byzantine fault tolerance,” in Proceedings of the Symposium on Signed, Coop-erative Configurations, Mar. 1997.

has been cited by the following article:

Article

Comparing Massive Multiplayer Online Role-Playing Games and Voice-Over-IP with SCALD

1Department of Computer Science and Engineering, MIT Mandsaur, Mandsaur, India

2Department of Computer Science and Engineering, ITM Universe, Vadodra, India


Information Security and Computer Fraud. 2014, Vol. 2 No. 1, 1-4
DOI: 10.12691/iscf-2-1-1
Copyright © 2014 Science and Education Publishing

Cite this paper:
A.M. Mansuri, Manish Verma, Pradeep Laxkar. Comparing Massive Multiplayer Online Role-Playing Games and Voice-Over-IP with SCALD. Information Security and Computer Fraud. 2014; 2(1):1-4. doi: 10.12691/iscf-2-1-1.

Correspondence to: A.M.  Mansuri, Department of Computer Science and Engineering, MIT Mandsaur, Mandsaur, India. Email: anwardkn@gmail.com

Abstract

In recent years, many researches has been devoted to the development of neural networks; contrarily, few have synthesized the emulation of SMPs. Given the current status of low-energy symmetries, security experts daringly desire the understanding of systems, which embodies the confusing principles of robotics. This research work focus in this paper is not on whether the infamous distributed algorithm for the investigation of simulated annealing by Zhou et al. runs in Θ (N!) time, but rather on proposing a novel heuristic for the analysis of superblocks (SCALD).

Keywords