Sciweavers

1478 search results - page 74 / 296
» Modular Complexity Analysis via Relative Complexity
Sort
View
SIGMETRICS
2006
ACM
156views Hardware» more  SIGMETRICS 2006»
14 years 3 months ago
Maximizing throughput in wireless networks via gossiping
A major challenge in the design of wireless networks is the need for distributed scheduling algorithms that will efficiently share the common spectrum. Recently, a few distributed...
Eytan Modiano, Devavrat Shah, Gil Zussman
AMAI
2004
Springer
14 years 2 months ago
Bayesian Model Averaging Across Model Spaces via Compact Encoding
Bayesian Model Averaging (BMA) is well known for improving predictive accuracy by averaging inferences over all models in the model space. However, Markov chain Monte Carlo (MCMC)...
Ke Yin, Ian Davidson
WMCSA
2002
IEEE
14 years 1 months ago
Extensible Adaptation via Constraint Solving
Applications running on a mobile and wireless devices must be able to adapt gracefully to limited and fluctuating network resources. The variety of applications, platforms upon w...
Yuri Dotsenko, Eyal de Lara, Dan S. Wallach, Willy...
CF
2007
ACM
14 years 1 months ago
Identifying potential parallelism via loop-centric profiling
The transition to multithreaded, multi-core designs places a greater responsibility on programmers and software for improving performance; thread-level parallelism (TLP) will be i...
Tipp Moseley, Daniel A. Connors, Dirk Grunwald, Ra...
WINET
2010
128views more  WINET 2010»
13 years 7 months ago
Distributed algorithms for lifetime maximization in sensor networks via Min-Max spanning subgraphs
We consider the problem of static transmission-power assignment for lifetime maximization of a wireless sensor network with stationary nodes operating in a data-gathering scenario...
Harri Haanpää, André Schumacher, ...