Sciweavers

920 search results - page 71 / 184
» Computing the Frequency of Partial Orders
Sort
View
APN
2006
Springer
15 years 1 months ago
Complete Finite Prefixes of Symbolic Unfoldings of Safe Time Petri Nets
Abstract. Time Petri nets have proved their interest in modeling realtime concurrent systems. Their usual semantics is defined in term of firing sequences, which can be coded in a ...
Thomas Chatain, Claude Jard
GI
2005
Springer
15 years 3 months ago
RFID middleware design - addressing both application needs and RFID constraints
: Radio Frequency Identification (RFID) technology has a lot of potential to bridge the gap between the virtual world of enterprise IT systems and the real world of products and l...
Christian Floerkemeier, Matthias Lampe
IPPS
1998
IEEE
15 years 2 months ago
PACE: Processor Architectures for Circuit Emulation
We describe a family of reconfigurable parallel architectures for logic emulation. They are supposed to be applicable like conventional FPGAs, while covering a larger range of circ...
Reiner Kolla, Oliver Springauf
SIGMOD
2008
ACM
125views Database» more  SIGMOD 2008»
15 years 10 months ago
Categorical skylines for streaming data
The problem of skyline computation has attracted considerable research attention. In the categorical domain the problem becomes more complicated, primarily due to the partially-or...
Nikos Sarkas, Gautam Das, Nick Koudas, Anthony K. ...
RTSS
2007
IEEE
15 years 4 months ago
Robust Priority Assignment for Fixed Priority Real-Time Systems
This paper focuses on priority assignment for realtime systems using fixed priority scheduling. It introduces and defines the concept of a “robust” priority ordering: the most...
Robert I. Davis, Alan Burns