Sciweavers

188 search results - page 25 / 38
» Forgetting the Time in Timed Process Algebra
Sort
View
CONCUR
2009
Springer
14 years 3 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...
ICDE
1999
IEEE
106views Database» more  ICDE 1999»
14 years 10 months ago
Processing Operations with Restrictions in RDBMS without External Sorting: The Tetris Algorithm
Most operations of the relational algebra or SQL require a sorted stream of tuples for efficient processing. Therefore, processing complex relational queries relies on efficient a...
Volker Markl, Martin Zirkel, Rudolf Bayer
KI
2001
Springer
14 years 1 months ago
Extracting Situation Facts from Activation Value Histories in Behavior-Based Robots
The paper presents a new technique for extracting symbolic ground facts out of the sensor data stream in autonomous robots for use under hybrid control architectures, which compris...
Frank Schönherr, Mihaela Cistelecan, Joachim ...
FSEN
2007
Springer
14 years 2 months ago
Adapting the UPPAAL Model of a Distributed Lift System
Abstract. Groote, Pang and Wouters (2001) analyzed an existing distributed lift system using the process algebraic toolset µCRL. Pang, Karstens and Fokkink (2003) analyzed a redes...
Wan Fokkink, Allard Kakebeen, Jun Pang
ICMCS
2006
IEEE
142views Multimedia» more  ICMCS 2006»
14 years 2 months ago
Complexity Analysis of H.264 Decoder for FPGA Design
— A major challenge in the design of any real time system is the proper selection of implementation and platform alternatives. In this paper, a suitable FPGA-based design of the ...
Tuomas Lindroth, Nastooh Avessta, Jukka Teuhola, T...