In this paper we show how model identifiability is an issue for student modeling: observed student performance corresponds to an infinite family of possible model parameter estimat...
This paper applies a new traffic model, iterated function systems (IFS) for network traffic modelling, to explore computer network behaviour and analyse network performance. IFS mo...
In this paper we introduce a dynamical model for wireless sensor networks. We obtain a convergent martingale for the broadcast process in such networks. To our knowledge, such mart...
Abstract. In the design of behavior-based control architectures for robots it is common to use biology as inspiration, and often the observed functionalities of insect behaviors ar...
Bounded Model Checking (BMC) is one of the most paradigmatic practical applications of Boolean Satisfiability (SAT). The utilization of SAT in model checking has allowed signifi...