We study the complexity of solving succinct zero-sum games, i.e., the games whose payoff matrix M is given implicitly by a Boolean circuit C such that M(i, j) = C(i, j). We comple...
Lance Fortnow, Russell Impagliazzo, Valentine Kaba...
Abstract. In this paper, we consider whether traditional index structures are effective in processing unstable nearest neighbors workloads. It is known that under broad conditions...
This work-in-progress report subsumes our ongoing research to develop a Topic Maps centric, modularised system which supports collaborative software development by combining the me...
In this paper, we present an approach to provide Quality of Service (QoS) for networked mobile gaming. In order to examine the QoS requirements of mobile games, we ported a simple...
Marcel Busse, Bernd Lamparter, Martin Mauve, Wolfg...
Web-based parameterized quizzes provide teachers and students with several advantages as the technology for self-assessment. However, the effect of these advantages is strongly red...