19320 search results - page 5 / 3864 » On the complexity of computing determinants |
LICS
2000
IEEE
14 years 2 months ago
2000
IEEE
We prove that several problems concerning congruences on algebras are complete for nondeterministic log-space. These problems are: determining the congruence on a given algebra gen...
OPODIS
2007
13 years 11 months ago
2007
This report describes a necessary and sufficient test for the schedulability of a set of sporadic harddeadline tasks on a multiprocessor platform, using any of a variety of schedu...
ICC
2007
IEEE
14 years 4 months ago
2007
IEEE
— In this paper, we present an analytic model and methodology to determine optimal scheduling policy that involves two dimension space allocation: time and code, in High Speed Do...
ISORC
2009
IEEE
14 years 4 months ago
2009
IEEE
Complex real-time embedded systems should be compositional and deterministic in the resource, time, and value domains. Determinism eases the engineering of correct systems and com...
LICS
2006
IEEE
14 years 3 months ago
2006
IEEE
Automata on infinite objects are extensively used in system specification, verification, and synthesis. While some applications of the automata-theoretic approach have been wel...