321 search results - page 30 / 65 » Approximate Models for General Cache Networks |
ECAI
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. There is currently a large interest in relational probabilistic models. While the concept of context-specific independence (CSI) has been well-studied for models such as ...
INFOCOM
2003
IEEE
14 years 1 months ago
2003
IEEE
— In this paper, we develop, analyze and implement a congestion control scheme obtained in a noncooperative game framework where each user’s cost function is composed of a pric...
PODC
2010
ACM
14 years 11 days ago
2010
ACM
An edge dominating set for a graph G is a set D of edges such that each edge of G is in D or adjacent to at least one edge in D. This work studies deterministic distributed approx...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
We present a numerical approximation technique for the analysis of continuous-time Markov chains that describe networks of biochemical reactions and play an important role in the ...
SIGMETRICS
2002
ACM
13 years 8 months ago
2002
ACM
Being able to model contention for software resources (e.g., a critical section or database lock) is paramount to building performance models that capture all aspects of the delay...