Sciweavers

3307 search results - page 386 / 662
» The meaning of concurrent programs
Sort
View
DSD
2007
IEEE
120views Hardware» more  DSD 2007»
16 years 1 months ago
Latency Minimization for Synchronous Data Flow Graphs
Synchronous Data Flow Graphs (SDFGs) are a very useful means for modeling and analyzing streaming applications. Some performance indicators, such as throughput, have been studied b...
Amir Hossein Ghamarian, Sander Stuijk, Twan Basten...
COORDINATION
2007
Springer
16 years 1 months ago
Component Connectors with QoS Guarantees
Connectors have emerged as a powerful concept for composition and coordination of concurrent activities encapsulated as components and services. Compositional coordination models a...
Farhad Arbab, Tom Chothia, Sun Meng, Young-Joo Moo...
ICTCS
2007
Springer
16 years 1 months ago
Weak Markovian Bisimilarity: Abstracting from Prioritized/Weighted Internal Immediate Actions
ing from Prioritized/Weighted Internal Immediate Actions Marco Bernardo and Alessandro Aldini Universit`a di Urbino “Carlo Bo” – Italy Markovian process calculi constitute a ...
Marco Bernardo, Alessandro Aldini
ACSD
2006
IEEE
105views Hardware» more  ACSD 2006»
16 years 29 days ago
Throughput Analysis of Synchronous Data Flow Graphs
Synchronous Data Flow Graphs (SDFGs) are a useful tool for modeling and analyzing embedded data flow applications, both in a single processor and a multiprocessing context or for...
Amir Hossein Ghamarian, Marc Geilen, Sander Stuijk...
ICRA
2006
IEEE
183views Robotics» more  ICRA 2006»
16 years 27 days ago
Anytime Dynamic Path-planning with Flexible Probabilistic Roadmaps
Abstract— Probabilistic roadmaps (PRM) have been demonstrated to be very promising for planning paths for robots with high degrees of freedom in complex 3D workspaces. In this pa...
Khaled Belghith, Froduald Kabanza, Leo Hartman, Ro...