Sciweavers

7195 search results - page 444 / 1439
» On Computing Power
Sort
View
ALGORITHMICA
2006
77views more  ALGORITHMICA 2006»
15 years 7 months ago
Scalable Parallel Algorithms for FPT Problems
Algorithmic methods based on the theory of fixed-parameter tractability are combined with powerful computational platforms to launch systematic attacks on combinatorial problems o...
Faisal N. Abu-Khzam, Michael A. Langston, Pushkar ...
SENSYS
2003
ACM
16 years 4 days ago
Practical lazy scheduling in sensor networks
Experience has shown that the power consumption of sensors and other wireless computational devices is often dominated by their communication patterns. We present a practical real...
Ramana Rao Kompella, Alex C. Snoeren
HIPC
2007
Springer
16 years 1 months ago
Self-optimization of Performance-per-Watt for Interleaved Memory Systems
- With the increased complexity of platforms coupled with data centers’ servers sprawl, power consumption is reaching unsustainable limits. Memory is an important target for plat...
Bithika Khargharia, Salim Hariri, Mazin S. Yousif
SPAA
2010
ACM
15 years 11 months ago
Online capacity maximization in wireless networks
In this paper we study a dynamic version of capacity maximization in the physical model of wireless communication. In our model, requests for connections between pairs of points i...
Alexander Fanghänel, Sascha Geulen, Martin Ho...
IDEAS
2003
IEEE
86views Database» more  IDEAS 2003»
16 years 5 days ago
A Medium Complexity Discrete Model for Uncertain Spatial Data
This paper presents a method for representing uncertainty in spatial data in a database. The model presented requires moderate amounts of storage space. To compute the probability...
Erlend Tøssebro, Mads Nygård