Sciweavers

5981 search results - page 292 / 1197
» time 2006
Sort
View
RSA
2006
144views more  RSA 2006»
15 years 7 months ago
Data structures with dynamical random transitions
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...
Clément Dombry, Nadine Guillotin-Plantard, ...
JACM
2000
119views more  JACM 2000»
15 years 7 months ago
A minimum spanning tree algorithm with Inverse-Ackermann type complexity
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...
Bernard Chazelle
JNSM
2000
122views more  JNSM 2000»
15 years 7 months ago
Communications Systems Driven by Software Agent Technology
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...
FSS
2002
96views more  FSS 2002»
15 years 7 months ago
An approach to stopping problems of a dynamic fuzzy system
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...
Masami Kurano, Masami Yasuda, Jun-ichi Nakagami, Y...
PUC
2000
92views more  PUC 2000»
15 years 7 months ago
MemoClip: A Location-Based Remembrance Appliance
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...
Michael Beigl