Sciweavers

335 search results - page 39 / 67
» The Compositional Construction of Markov Processes
Sort
View
CRIWG
2001
13 years 11 months ago
Evolution in Use of Groupware: Facilitating Tailoring to the Extreme
Group work evolves, often leading to changing requirements on the technical support. To meet these new requirements groupware has to be modified. A system that allows end users to...
Robert Slagter, Margit Biemans, G. Henri ter Hofte
JOT
2007
193views more  JOT 2007»
13 years 9 months ago
Applying Triple Graph Grammars For Pattern-Based Workflow Model Transformations
Workflow and business process modeling approaches have become essential for designing service collaborations when developing SOA-based systems. To derive actual executable busines...
Carsten Lohmann, Joel Greenyer, Juanjuan Jiang, Ta...
QEST
2008
IEEE
14 years 4 months ago
Quasi-Birth-Death Processes, Tree-Like QBDs, Probabilistic 1-Counter Automata, and Pushdown Systems
We begin by observing that (discrete-time) QuasiBirth-Death Processes (QBDs) are equivalent, in a precise sense, to (discrete-time) probabilistic 1-Counter Automata (p1CAs), and b...
Kousha Etessami, Dominik Wojtczak, Mihalis Yannaka...
EMSOFT
2004
Springer
14 years 3 months ago
Reactive process networks
Data flow process networks are a good model of computation for streaming multimedia applications incorporating audio, video and/or graphics streams. Process networks are concurre...
Marc Geilen, Twan Basten
AAAI
2012
12 years 6 days ago
A Dynamic Rationalization of Distance Rationalizability
Distance rationalizability is an intuitive paradigm for developing and studying voting rules: given a notion of consensus and a distance function on preference profiles, a ration...
Craig Boutilier, Ariel D. Procaccia