3919 search results - page 476 / 784 » Modelling Dynamic Forgetting in Distributed Information Syst... |
182
Voted
INFOCOM
2007
IEEE
16 years 1 months ago
2007
IEEE
— We propose a general family of MAC scheduling algorithms that achieve any rate-point on a uniform discretelattice within the throughput-region (i.e., lattice-throughputoptimal)...
174
click to vote
ICB
2007
Springer
16 years 26 days ago
2007
Springer
This paper investigates a new approach to formulate performance indices of biometric system using information theoretic models. The performance indices proposed here (unlike conven...
185
click to vote
PPOPP
2010
ACM
16 years 1 months ago
2010
ACM
In processors with several levels of hardware resource sharing, like CMPs in which each core is an SMT, the scheduling process becomes more complex than in processors with a singl...
174
click to vote
IPSN
2004
Springer
16 years 2 days ago
2004
Springer
We study network capacity limits and optimal routing algorithms for regular sensor networks, namely, square and torus grid sensor networks, in both, the static case (no node failu...
193
Voted
MIDDLEWARE
2004
Springer
16 years 2 days ago
2004
Springer
Emerging large scale utility computing systems like Grids promise computing and storage to be provided to end users as a utility. System management services deployed in the middle...