2239 search results - page 68 / 448 » Computing with abstract matrix structures |
180
click to vote
PE
2011
Springer
14 years 6 months ago
2011
Springer
In this paper we identify a class of Quasi-Birth-and-Death (QBD) processes where the transitions to higher (resp. lower) levels are restricted to occur only from (resp. to) a subs...
SAC
2006
ACM
15 years 5 months ago
2006
ACM
In this paper, we present an efficient procedure for building a piecewise linear function approximation of the speed function of a processor with hierarchical memory structure. Th...
123
click to vote
ERSHOV
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. We address model checking problem for combination of Computation Tree Logic (CTL) and Propositional Logic of Knowledge (PLK) in finite systems with the perfect recall syn...
101
click to vote
BIRTHDAY
2010
Springer
15 years 28 days ago
2010
Springer
Many natural problems in computer science concern structures like graphs where elements are not inherently ordered. In contrast, Turing machines and other common models of computa...
IJHPCA
2010
14 years 10 months ago
2010
Sparse matrix operations achieve only small fractions of peak CPU speeds because of the use of specialized, indexbased matrix representations, which degrade cache utilization by i...