8132 search results - page 185 / 1627 » Dependability, Abstraction, and Programming |
242
click to vote
AOSD
2011
ACM
14 years 10 months ago
2011
ACM
Dynamic platforms where components can be loaded at runtime can introduce risks to applications stability if components are not previously known before deployment. It may be neede...
199
click to vote
WSOM
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We show how the “Online Sparse Coding Neural Gas” algorithm can be applied to a more realistic model of the “Cocktail Party Problem”. We consider a setting where ...
155
click to vote
CDC
2008
IEEE
16 years 1 months ago
2008
IEEE
Abstract— The paper deals with decentralized Bayesian detection with M hypotheses, and N sensors making conditionally correlated measurements regarding these hypotheses. Each sen...
166
click to vote
PDCAT
2005
Springer
16 years 1 days ago
2005
Springer
Fault tolerant algorithms are often designed under the t-out-of-n assumption, which is based on the assumption that all processes or components fail independently with equal proba...
159
click to vote
INFOCOM
2003
IEEE
15 years 12 months ago
2003
IEEE
Abstract— We investigate a widely popular Least-RecentlyUsed (LRU) cache replacement algorithm with semi-Markov modulated requests. Semi-Markov processes provide the flexibility...