Sciweavers

2061 search results - page 349 / 413
» Tiling with limited resources
Sort
View
ESOP
2009
Springer
15 years 6 months ago
Amortised Memory Analysis Using the Depth of Data Structures
Hofmann and Jost have presented a heap space analysis [1] that finds linear space bounds for many functional programs. It uses an amortised analysis: assigning hypothetical amount...
Brian Campbell
STACS
2009
Springer
15 years 6 months ago
Economical Caching
Abstract. We study the management of buffers and storages in environments with unpredictably varying prices in a competitive analysis. In the economical caching problem, there is ...
Matthias Englert, Heiko Röglin, Jacob Spö...
IAT
2009
IEEE
15 years 6 months ago
Cluster-Swap: A Distributed K-median Algorithm for Sensor Networks
In building practical sensor networks, it is often beneficial to use only a subset of sensors to take measurements because of computational, communication, and power limitations....
Yoonheui Kim, Victor R. Lesser, Deepak Ganesan, Ra...
INFOCOM
2009
IEEE
15 years 6 months ago
Dynamic Power Allocation Under Arbitrary Varying Channels - An Online Approach
—A major problem in wireless networks is coping with limited resources, such as bandwidth and energy. These issues become a major algorithmic challenge in view of the dynamic nat...
Niv Buchbinder, Liane Lewin-Eytan, Ishai Menache, ...
ATAL
2009
Springer
15 years 6 months ago
Emergent service provisioning and demand estimation through self-organizing agent communities
A major challenge within open markets is the ability to satisfy service demand with an adequate supply of service providers, especially when such demand may be volatile due to cha...
Mariusz Jacyno, Seth Bullock, Michael Luck, Terry ...