Generally speaking, in the e-learning systems, a course is modeled as a graph, where each node represents a knowledge node (KU) and two nodes are connected to form a semantic netw...
Abstract— In this paper, we present an incremental, multiresolution motion planning algorithm designed for systems with differential constraints. Planning for these sytems is mor...
Signal Transition Graphs (STGs) are a version of Petri nets for the specification of asynchronous circuit behaviour. It has been suggested to decompose such a specification as a...
A weighted undirected network is ∆ growth-bounded if the number of nodes at distance 2r around any given node is at most ∆ times the number of nodes at distance r around the n...
The distributed data storage on unreliable devices, connected by a short-range radio network is analyzed. Failing devices incur loss of data. To prevent the loss, the data is spli...