We present a (non-standard) probabilistic analysis of dynamic data structures whose sizes are considered as dynamic random walks. The basic operations (insertion, deletion, positi...
A deterministic algorithm for computing a minimum spanning tree of a connected graph is presented. Its running time is O(m (m, n)), where is the classical functional inverse of Ack...
The application of software agent technology to the management of communications' infrastructures is a challenging domain as it requires management on different time scales a...
Alex L. Hayzelden, John Bigham, Stefan Poslad, Phi...
We formulate a stopping problem for dynamic fuzzy systems concerning with fuzzy decision environment. It could be regarded as a natural fuzzification of non-fuzzy stopping problem...
Reminder tools allow users to associate information with time-based alarms. However, in many cases space rather than time may be appropriate to trigger reminders. We present a wear...