Sciweavers

5409 search results - page 95 / 1082
» Basic Observables for Processes
Sort
View
CONCUR
2009
Springer
15 years 7 months ago
Partially-Commutative Context-Free Processes
Bisimulation equivalence is decidable in polynomial time for both sequential and commutative normed context-free processes, known as BPA and BPP, respectively. Despite apparent sim...
Wojciech Czerwinski, Sibylle B. Fröschle, Sla...
AAAI
1990
15 years 1 months ago
The Design of a Marker Passing Architecture for Knowledge Processing
Knowledge processing is very demanding on computer architectures. Knowledge processing generates subcomputation paths at an exponential rate. It is memory intensive and has high c...
Wing Lee, Dan I. Moldovan
JSSPP
2004
Springer
15 years 6 months ago
Enhancements to the Decision Process of the Self-Tuning dynP Scheduler
The self-tuning dynP scheduler for modern cluster resource management systems switches between different basic scheduling policies dynamically during run time. This allows to reac...
Achim Streit
TSP
2008
154views more  TSP 2008»
15 years 4 days ago
Algebraic Signal Processing Theory: 1-D Space
In our paper titled "Algebraic Signal Processing Theory: Foundation and 1-D Time" appearing in this issue of the IEEE TRANSACTIONS ON SIGNAL PROCESSING, we presented the ...
Markus Püschel, José M. F. Moura
FCT
2007
Springer
15 years 4 months ago
Local Testing of Message Sequence Charts Is Difficult
Abstract. Message sequence charts are an attractive formalism for specifying communicating systems. One way to test such a system is to substitute a component by a test process and...
Puneet Bhateja, Paul Gastin, Madhavan Mukund, K. N...