614 search results - page 64 / 123 » Computational Complexity of Multi-way, Dataflow Constraint P... |
DSD
2007
IEEE
14 years 2 months ago
2007
IEEE
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...
CHARME
2003
Springer
14 years 1 months ago
2003
Springer
We present a non-operational approach to specifying and analyzing shared memory consistency models. The method uses higher order logic to capture a complete set of ordering constra...
EURODAC
1995
IEEE
13 years 11 months ago
1995
IEEE
Distributed systems are becoming a popular way of implementing many embedded computing applications, automotive control being a common and important example. Such embedded systems...
CLUSTER
2007
IEEE
14 years 2 months ago
2007
IEEE
— The service-oriented architecture has come a long way in solving the problem of reusability of existing software resources. Grid applications today are composed of a large numb...
KR
1989
Springer
13 years 12 months ago
1989
Springer
In this work we extend the work of Dean, Kaelbling, Kirman and Nicholson on planning under time constraints in stochastic domains to handle more complicated scheduling problems. I...