127
click to vote
LICS
1995
IEEE
15 years 8 months ago
1995
IEEE
We prove that tree isomorphism is not expressible in the language (FO + TC + COUNT). This is surprising since in the presence of ordering the language captures NL, whereas tree is...
131
click to vote
LCTRTS
1995
Springer
15 years 8 months ago
1995
Springer
In this paper, we present a preemptive joint scheduling of hard deadline periodic and hard deadline aperiodic tasks on a uniprocessor real-time system. The scheduling has extended...
LCTRTS
1995
Springer
15 years 8 months ago
1995
Springer
155
click to vote
LCPC
1995
Springer
15 years 8 months ago
1995
Springer
Abstract. The technique of flattening nested data parallelism combines all the independent operations in nested apply-to-all constructs and generates large amounts of potential pa...