11022 search results - page 214 / 2205 » Programming Systems for Autonomy |
147
click to vote
FPCA
1989
15 years 10 months ago
1989
One way to analyse programs is to to derive expressions for their computational behaviour. A time bound function (or worst-case complexity) gives an upper bound for the computatio...
171
click to vote
EUROPAR
2007
Springer
16 years 15 days ago
2007
Springer
Computer systems are increasingly parallel and heterogeneous, while programs are still largely written in sequential languages. The obvious suggestion that the compiler should auto...
164
click to vote
ISORC
2002
IEEE
15 years 11 months ago
2002
IEEE
Monitoring is a widely-used technique to check assumptions about the real-time behavior of a system, debug the code, or enforce the system to react if certain deadlines are passed...
146
click to vote
SIGCSE
2009
ACM
15 years 11 months ago
2009
ACM
This special session will proved information about the status of work related to Masters programs in Computing. Specifically, the session will describe work completed in the follo...
165
click to vote
ASIAN
1999
Springer
15 years 10 months ago
1999
Springer
Unfold/fold transformation systems for logic programs have been extensively investigated. Existing unfold/fold transformation systems for normal logic programs allow only Tamaki-Sa...