Sciweavers

438 search results - page 31 / 88
» A Theory of Competitive Analysis for Distributed Algorithms
Sort
View
MOBIHOC
2008
ACM
14 years 7 months ago
Construction algorithms for k-connected m-dominating sets in wireless sensor networks
A Connected Dominating Set (CDS) working as a virtual backbone is an effective way to decrease the overhead of routing in a wireless sensor network. Furthermore, a kConnected m-Do...
Yiwei Wu, Yingshu Li
POPL
2009
ACM
14 years 8 months ago
Compositional shape analysis by means of bi-abduction
This paper describes a compositional shape analysis, where each procedure is analyzed independently of its callers. The analysis uses an abstract domain based on a restricted frag...
Cristiano Calcagno, Dino Distefano, Peter W. O'Hea...
INFOSCALE
2006
ACM
14 years 1 months ago
Scheduling divisible loads in the dynamic heterogeneous grid environment
According to the special features of the dynamic heterogeneous grid environment, a loose-coupled and scalable resource model is described by a hybrid multi-level tree reflecting a...
Tao Zhu, Yongwei Wu, Guangwen Yang
SIROCCO
2007
13 years 8 months ago
Data Aggregation in Sensor Networks: Balancing Communication and Delay Costs
In a sensor network the sensors, or nodes, obtain data and have to communicate these data to a central node. Because sensors are battery powered they are highly energy constrained....
Peter Korteweg, Alberto Marchetti-Spaccamela, Leen...
SIGECOM
2006
ACM
107views ECommerce» more  SIGECOM 2006»
14 years 1 months ago
Empirical mechanism design: methods, with application to a supply-chain scenario
Our proposed methods employ learning and search techniques to estimate outcome features of interest as a function of mechanism parameter settings. We illustrate our approach with ...
Yevgeniy Vorobeychik, Christopher Kiekintveld, Mic...