Sciweavers

3206 search results - page 456 / 642
» How minds can be computational systems
Sort
View
FORMATS
2009
Springer
15 years 10 months ago
Stochastic Games for Verification of Probabilistic Timed Automata
Probabilistic timed automata (PTAs) are used for formal modelling and verification of systems with probabilistic, nondeterministic and real-time behaviour. For non-probabilistic ti...
Marta Z. Kwiatkowska, Gethin Norman, David Parker
DSN
2004
IEEE
15 years 10 months ago
Model Checking Action- and State-Labelled Markov Chains
In this paper we introduce the logic asCSL, an extension of continuous stochastic logic (CSL), which provides powerful means to characterise execution paths of action- and state-l...
Christel Baier, Lucia Cloth, Boudewijn R. Haverkor...
AFRIGRAPH
2001
ACM
15 years 9 months ago
Realistic visualisation of the Pompeii frescoes
Three dimensional computer reconstruction provides us with a means of visualising past environments, allowing us a glimpse of the past that might otherwise be difficult to appreci...
Kate Devlin, Alan Chalmers
POPL
1995
ACM
15 years 9 months ago
Parametric Program Slicing
Program slicing is a technique for isolating computational threads in programs. In this paper, we show how to mechanically extract a family of practical algorithms for computing s...
John Field, G. Ramalingam, Frank Tip
CSE
2009
IEEE
15 years 9 months ago
Energy Consumption of Residential and Professional Switches
Abstract—Precise evaluation of network appliance energy consumption is necessary to accurately model or simulate the power consumption of distributed systems. In this paper we ev...
Helmut Hlavacs, Georges Da Costa, Jean-Marc Pierso...