Sciweavers

10493 search results - page 336 / 2099
» Dynamic Word Problems
Sort
View
STOC
2007
ACM
109views Algorithms» more  STOC 2007»
16 years 7 months ago
Stability of the max-weight routing and scheduling protocol in dynamic networks and at critical loads
We study the stability of the Max-Weight protocol for combined routing and scheduling in communication networks. Previous work has shown that this protocol is stable for adversari...
Matthew Andrews, Kyomin Jung, Alexander L. Stolyar
STOC
2003
ACM
193views Algorithms» more  STOC 2003»
16 years 7 months ago
Space efficient dynamic stabbing with fast queries
In dynamic stabbing, we operate on a dynamic set of intervals. A stabbing query asks for an interval containing a given point. This basic problem encodes problems such as method l...
Mikkel Thorup
SODA
2010
ACM
181views Algorithms» more  SODA 2010»
16 years 4 months ago
On the Cell Probe Complexity of Dynamic Membership
We study the dynamic membership problem, one of the most fundamental data structure problems, in the cell probe model with an arbitrary cell size. We consider a cell probe model e...
KE YI, QIN ZHANG
ICC
2007
IEEE
119views Communications» more  ICC 2007»
16 years 29 days ago
Spatio-Temporal Dynamic Spectrum Allocation with Interference Handling
— As for today, radio spectrum resource is rigidly partitioned for dedicated purposes. The exclusive license of fixed size spectrum blocks separated by guard bands easily solves...
László Kovacs, Attila Vidács,...
203
Voted
PKDD
2009
Springer
146views Data Mining» more  PKDD 2009»
15 years 11 months ago
Parallel Subspace Sampling for Particle Filtering in Dynamic Bayesian Networks
Monitoring the variables of real world dynamic systems is a difficult task due to their inherent complexity and uncertainty. Particle Filters (PF) perform that task, yielding prob...
Eva Besada-Portas, Sergey M. Plis, Jesús Ma...