Sciweavers

279 search results - page 3 / 56
» Approximating Average Parameters of Graphs
Sort
View
PROPERTYTESTING
2010
13 years 3 months ago
On Constant Time Approximation of Parameters of Bounded Degree Graphs
How well can the maximum size of an independent set, or the minimum size of a dominating set of a graph in which all degrees are at most d be approximated by a randomized constant...
Noga Alon
APPROX
2006
Springer
124views Algorithms» more  APPROX 2006»
13 years 9 months ago
Combinatorial Algorithms for Data Migration to Minimize Average Completion Time
The data migration problem is to compute an efficient plan for moving data stored on devices in a network from one configuration to another. It is modeled by a transfer graph, wher...
Rajiv Gandhi, Julián Mestre
AUTOMATICA
2005
145views more  AUTOMATICA 2005»
13 years 5 months ago
Averaging analysis of periodically forced fluid networks
For a lumped parameter model of a flow network driven by a periodic generator, we apply averaging to find an approximate solution and analyze its stability. The approximate soluti...
Olga I. Koroleva, Miroslav Krstic
CORR
2008
Springer
114views Education» more  CORR 2008»
13 years 5 months ago
Network-based consensus averaging with general noisy channels
This paper focuses on the consensus averaging problem on graphs under general noisy channels. We study a particular class of distributed consensus algorithms based on damped updat...
Ram Rajagopal, Martin J. Wainwright
JC
2008
128views more  JC 2008»
13 years 5 months ago
Lattice rule algorithms for multivariate approximation in the average case setting
We study multivariate approximation for continuous functions in the average case setting. The space of d variate continuous functions is equipped with the zero mean Gaussian measu...
Frances Y. Kuo, Ian H. Sloan, Henryk Wozniakowski