76 search results - page 9 / 16 » On the Computational Complexity of Verifying One-Counter Pro... |
SKG
2006
IEEE
14 years 1 months ago
2006
IEEE
Upper bound constraints are often set when complex scientific or business processes are modelled as grid workflow specifications. However, many existing processes such as climate ...
ADHOCNOW
2005
Springer
14 years 1 months ago
2005
Springer
We present the Ad-hoc On-demand Secure Routing (AOSR) protocol, which uses pairwise shared keys between pairs of mobile nodes and hash values keyed with them to verify the validity...
CSCWD
2001
Springer
14 years 2 days ago
2001
Springer
Workflow management techniques are aiming at supporting business process across organization boundaries. Current techniques are lacking of the formalism tools to model and analyze...
RSP
2008
IEEE
14 years 1 months ago
2008
IEEE
Dataflow formalisms have provided designers of digital signal processing systems with optimizations and guarantees to arrive at quality prototypes quickly. As system complexity in...
VLSID
2005
IEEE
14 years 8 months ago
2005
IEEE
Polynomial expressions are used to approximate a wide variety of functions commonly found in signal processing and computer graphics applications. Computing these polynomial expre...