Planning algorithms have traditionally been geared toward achievement goals in single-agent environments. Such algorithms essentially produce plans to reach one of a specified se...
We present an effective dynamic analysis for finding a broad class of deadlocks, including the well-studied lock-only deadlocks as well as the less-studied, but no less widespread...
In the geometric data model [6], spatio-temporal data are modelled as a finite collection of triangles that are transformed by time-dependent affinities. To facilitate querying an...
In the real world, lots of objects with changing position can be found. Some of them repeat the same movement several times, called periodic movements. Examples include airplanes,...
With the recent and continuing advances in areas such as wireless communications and positioning technologies, mobile, locationbased services are becoming possible. Such services ...
Christian S. Jensen, Augustas Kligys, Torben Bach ...