Sciweavers

321 search results - page 11 / 65
» Approximate Models for General Cache Networks
Sort
View
INFOCOM
2007
IEEE
14 years 2 months ago
The Cache Inference Problem and its Application to Content and Request Routing
— In many networked applications, independent caching agents cooperate by servicing each other’s miss streams, without revealing the operational details of the caching mechanis...
Nikolaos Laoutaris, Georgios Zervas, Azer Bestavro...
NIPS
1997
13 years 9 months ago
Generalized Prioritized Sweeping
Prioritized sweeping is a model-based reinforcement learning method that attempts to focus an agent’s limited computational resources to achieve a good estimate of the value of ...
David Andre, Nir Friedman, Ronald Parr
JCM
2008
94views more  JCM 2008»
13 years 8 months ago
Cell Site Power Characterization for Multi-rate Wireless CDMA Data Networks Using Lognormal Approximation
An analytical model is developed to solve the power-rate assignment problem for multi-rate CDMA systems and calculate the probability density function (PDF) for the downlink traffi...
Ashraf S. Hasan Mahmoud
MOBIHOC
2008
ACM
14 years 8 months ago
An approximation algorithm for conflict-aware broadcast scheduling in wireless ad hoc networks
Broadcast scheduling is a fundamental problem in wireless ad hoc networks. The objective of a broadcast schedule is to deliver a message from a given source to all other nodes in ...
Reza Mahjourian, Feng Chen, Ravi Tiwari, My T. Tha...
EMSOFT
2007
Springer
14 years 2 months ago
Optimal task placement to improve cache performance
Most recent embedded systems use caches to improve their average performance. Current timing analyses are able to compute safe timing guarantees for these systems, if tasks are ru...
Gernot Gebhard, Sebastian Altmeyer