Sciweavers

2252 search results - page 67 / 451
» Lower Bounds for Dynamic Algorithms
Sort
View
ATAL
2008
Springer
13 years 9 months ago
On k-optimal distributed constraint optimization algorithms: new bounds and algorithms
Distributed constraint optimization (DCOP) is a promising approach to coordination, scheduling and task allocation in multi agent networks. In large-scale or low-bandwidth network...
Emma Bowring, Jonathan P. Pearce, Christopher Port...
INFOCOM
2009
IEEE
14 years 2 months ago
Dynamic Power Allocation Under Arbitrary Varying Channels - An Online Approach
—A major problem in wireless networks is coping with limited resources, such as bandwidth and energy. These issues become a major algorithmic challenge in view of the dynamic nat...
Niv Buchbinder, Liane Lewin-Eytan, Ishai Menache, ...
AMC
2008
82views more  AMC 2008»
13 years 7 months ago
Parameter estimation error bounds for Hammerstein nonlinear finite impulsive response models
This paper presents a parameter estimation algorithm for a class of Hammerstein nonlinear systems
Li Yu, Jiabo Zhang, Yuwu Liao, Jie Ding
PODS
2004
ACM
137views Database» more  PODS 2004»
14 years 7 months ago
On the Memory Requirements of XPath Evaluation over XML Streams
The important challenge of evaluating XPath queries over XML streams has sparked much interest in the past few years. A number of algorithms have been proposed, supporting wider f...
Ziv Bar-Yossef, Marcus Fontoura, Vanja Josifovski
APPROX
2009
Springer
80views Algorithms» more  APPROX 2009»
14 years 2 months ago
The Glauber Dynamics for Colourings of Bounded Degree Trees
Brendan Lucier, Michael Molloy, Yuval Peres