Sciweavers

738 search results - page 20 / 148
» Behavioral Systems Theory: A Survey
Sort
View
CALCO
2009
Springer
150views Mathematics» more  CALCO 2009»
16 years 22 days ago
Approximating Labelled Markov Processes Again!
Abstract. Labelled Markov processes are continuous-state fully probabilistic labelled transition systems. They can be seen as co-algebras of a suitable monad on the category of mea...
Philippe Chaput, Vincent Danos, Prakash Panangaden...
DFG
1992
Springer
15 years 10 months ago
Complexity of Boolean Functions on PRAMs - Lower Bound Techniques
Determining time necessary for computing important functions on parallel machines is one of the most important problems in complexity theory for parallel algorithms. Recently, a s...
Miroslaw Kutylowski
ISM
2008
IEEE
127views Multimedia» more  ISM 2008»
16 years 17 days ago
To Be or Not to Be a Behaviorist? Facial Recognition Systems and Critical Knowledge
In this paper, we assess the possibility of a critical knowledge of technology. In the case of facial recognition systems, ‘FRS’, we argue that behaviorism underlies this tech...
Mathieu Cornélis, Nathalie Grandjean, Clair...
ACMDIS
2008
ACM
15 years 8 months ago
Reflecting human behavior to motivate desirable lifestyle
Ambient lifestyle feedback systems are embedded computer systems designed to motivate changes in a person's lifestyle by reflecting an interpretation of targeted behavior bac...
Tatsuo Nakajima, Vili Lehdonvirta, Eiji Tokunaga, ...
FSTTCS
2005
Springer
15 years 11 months ago
The MSO Theory of Connectedly Communicating Processes
Abstract. We identify a network of sequential processes that communicate by synchronizing frequently on common actions. More precisely, we demand that there is a bound k such that ...
P. Madhusudan, P. S. Thiagarajan, Shaofa Yang