Sciweavers

163 search results - page 21 / 33
» Living machines
Sort
View
CORR
2007
Springer
88views Education» more  CORR 2007»
13 years 9 months ago
Decisive Markov Chains
We consider qualitative and quantitative verification problems for infinite-state Markov chains. We call a Markov chain decisive w.r.t. a given set of target states F if it almos...
Parosh Aziz Abdulla, Noomene Ben Henda, Richard Ma...
REPLICATION
2010
13 years 8 months ago
A History of the Virtual Synchrony Replication Model
In this chapter, we discuss a widely used fault-tolerant data replication model called virtual synchrony. The model responds to two kinds of needs. First, there is the practical qu...
Ken Birman
ICML
2007
IEEE
14 years 10 months ago
Recovering temporally rewiring networks: a model-based approach
A plausible representation of relational information among entities in dynamic systems such as a living cell or a social community is a stochastic network which is topologically r...
Fan Guo, Steve Hanneke, Wenjie Fu, Eric P. Xing
NEUROSCIENCE
2001
Springer
14 years 2 months ago
Finite-State Computation in Analog Neural Networks: Steps towards Biologically Plausible Models?
Abstract. Finite-state machines are the most pervasive models of computation, not only in theoretical computer science, but also in all of its applications to real-life problems, a...
Mikel L. Forcada, Rafael C. Carrasco
ICMLA
2009
13 years 7 months ago
Discovering Rules from Disk Events for Predicting Hard Drive Failures
Detecting impending failure of hard disks is an important prediction task which might help computer systems to prevent loss of data and performance degradation. Currently most of t...
Vipul Agarwal, Chiranjib Bhattacharyya, Thirumale ...