102 search results - page 11 / 21 » A reading algorithm for constraint diagrams |
ATVA
2006
Springer
13 years 11 months ago
2006
Springer
Whereas partial order methods have proved their efficiency for the analysis of discrete-event systems, their application to timed systems remains a challenging research topic. Here...
MSWIM
2006
ACM
14 years 1 months ago
2006
ACM
We present an efficient algorithm to compute the coverage map of a given set of transmitters under interference constraints. That is, we compute the set of points that lie within ...
IEEEPACT
2009
IEEE
14 years 2 months ago
2009
IEEE
Abstract—Load elimination is a classical compiler transformation that is increasing in importance for multi-core and many-core architectures. The effect of the transformation is ...
AI
2011
Springer
13 years 2 months ago
2011
Springer
This paper describes our methodology for building conformant planners, which is based on recent advances in the theory of action and change and answer set programming. The develop...
CASCON
1997
13 years 9 months ago
1997
Understanding distributed applications is a tedious and di cult task. Visualizations based on process-time diagrams are often used to obtain a better understanding of the executio...