Lots of efforts in the last decades have been done to prove or disprove whether the set of polynomially bounded problems is equal to the set of polynomially verifiable problems. T...
Sina Jafarpour, Mohammad Ghodsi, Keyvan Sadri, Zuh...
— The paper is concerned with a novel adaptive game server protocol optimization to combat network latencies in the case of heterogeneous network environment. In this way, game p...
In defining large, complex access control policies, one would like to compose sub-policies, perhaps authored by different organizations, into a single global policy. Existing po...
This article presents a heap space analysis for (sequential) Java bytecode. The analysis generates heap space cost relations which define at compile-time the heap consumption of ...
In recent years, existing computing schemes and paradigms have evolved towards more flexible, ad-hoc scalable frameworks. Nowadays, exchanging interactions between entities often ...