6110 search results - page 946 / 1222 » Approximate Computing |
162
click to vote
WINE
2005
Springer
16 years 20 hour ago
2005
Springer
We study a model of path-vector routing in which nodes’ routing policies are based on subjective cost assessments of alternative routes. The routes are constrained by the requir...
182
click to vote
ESA
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. Classical network flow theory allows decomposition of flow into several chunks of arbitrary sizes traveling through the network on different paths. In the first part ...
163
click to vote
EWSN
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. In this paper, we consider the minimization of a relevant energy consumption related cost function in the context of sensor networks where correlated sources are generate...
185
click to vote
CF
2010
ACM
15 years 11 months ago
2010
ACM
We develop two simple interval-based models for dynamic superscalar processors. These models allow us to: i) predict with great accuracy performance and power consumption under va...
163
click to vote
SIGECOM
2010
ACM
15 years 11 months ago
2010
ACM
We design and analyze approximately revenue-maximizing auctions in general single-parameter settings. Bidders have publicly observable attributes, and we assume that the valuation...