170 search results - page 25 / 34 » A Bounding Quantifier |
100
click to vote
SPAA
2006
ACM
15 years 5 months ago
2006
ACM
Suppose we have a parallel or distributed system whose nodes have limited capacities, such as processing speed, bandwidth, memory, or disk space. How does the performance of the s...
118
click to vote
ISPD
2005
ACM
15 years 5 months ago
2005
ACM
In this paper we introduce the concept of zero-change transformations to quantify the suboptimality of existing placers. Given a netlist and its placement from a placer, we formal...
PODC
2010
ACM
15 years 3 months ago
2010
ACM
We quantify the effect of Bayesian ignorance by comparing the social cost obtained in a Bayesian game by agents with local views to the expected social cost of agents having glob...
104
click to vote
SUTC
2010
IEEE
15 years 3 months ago
2010
IEEE
—In distributed sensor networks, computational and energy resources are in general limited. Therefore, an intelligent selection of sensors for measurements is of great importance...
115
click to vote
ICCCN
2007
IEEE
15 years 3 months ago
2007
IEEE
Wireless sensor networks (WSNs) introduce new challenges to topology control due to the prevalence of lossy links. We propose a new topology control formulation for lossy WSNs that...