394 search results - page 50 / 79 » Computing Minimal Polynomials of Matrices |
218
Voted
RTAS
2011
IEEE
14 years 4 months ago
2011
IEEE
— This paper presents the Fixed Priority until Zero Laxity (FPZL) scheduling algorithm for multiprocessor realtime systems. FPZL is similar to global fixed priority preemptive sc...
100
click to vote
ACSAC
2003
IEEE
15 years 5 months ago
2003
IEEE
In-depth analysis of network security vulnerability must consider attacker exploits not just in isolation, but also in combination. The general approach to this problem is to comp...
102
click to vote
SIGMETRICS
2008
ACM
15 years 12 days ago
2008
ACM
Enterprise customers are increasingly adopting MPLS (Multiprotocol Label Switching) VPN (Virtual Private Network) service that offers direct any-to-any reachability among the cust...
187
click to vote
ISCA
2002
IEEE
15 years 5 days ago
2002
IEEE
In this paper, we consider the tree task graphs which arise from many important programming paradigms such as divide and conquer, branch and bound etc., and the linear task-graphs...
ISSAC
2007
Springer
15 years 6 months ago
2007
Springer
It is classical that univariate algebraic functions satisfy linear differential equations with polynomial coefficients. Linear recurrences follow for the coefficients of their po...