Výsledky vyhledávání - "reordering algorithm"
-
1
Autoři:
Přispěvatelé:
Témata: FRFCFS, Planificación de peticiones de memoria, Memory Requests Scheduling, Algoritmo de reordenado, BLISS, Simulador, Simulator, STFM, Reordering algorithm, Coyote
Přístupová URL adresa: https://hdl.handle.net/10902/37822
-
2
Autoři: a další
Zdroj: Energies, Vol 17, Iss 6, p 1499 (2024)
Témata: preconditioning, JFNK, coloring algorithm, reordering algorithm, incomplete LU factorization, Technology
Relation: https://www.mdpi.com/1996-1073/17/6/1499; https://doaj.org/toc/1996-1073; https://doaj.org/article/4e075d27f2474547bcaf3f851040e811
-
3
Autoři:
Přispěvatelé:
Témata: Simulador, Coyote, FRFCFS, BLISS, STFM, Algoritmo de reordenado, Planificación de peticiones de memoria, Simulator, Reordering algorithm, Memory Requests Scheduling
Relation: https://hdl.handle.net/10902/37822
Dostupnost: https://hdl.handle.net/10902/37822
-
4
Autoři: a další
Zdroj: Energies, Vol 17, Iss 6, p 1499 (2024)
Témata: incomplete LU factorization, Technology, preconditioning, coloring algorithm, JFNK, 0211 other engineering and technologies, 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology, 7. Clean energy, reordering algorithm
Přístupová URL adresa: https://doaj.org/article/4e075d27f2474547bcaf3f851040e811
-
5
Autoři:
Přispěvatelé:
Témata: Dependence modeling, Copulas, Hierarchical risk aggregation model, Reordering algorithm, Danish fire insurance data
Popis souboru: application/pdf
Dostupnost: http://hdl.handle.net/10400.5/9239
-
6
Autoři: a další
Zdroj: Computing. 54:39-67
Témata: Computational methods for sparse matrices, coarse-grain parallel solver, sparse matrices, Gaussian elimination, Parallel numerical computation, 0101 mathematics, Direct numerical methods for linear systems and matrix inversion, numerical experiments, 01 natural sciences, reordering algorithm
Popis souboru: application/xml
-
7
Autoři:
Zdroj: SIAM Journal on Scientific and Statistical Computing. 13:645-653
Témata: massively parallel computers, sparse Cholesky factorization, 0211 other engineering and technologies, elimination tree, Parallel numerical computation, 02 engineering and technology, Direct numerical methods for linear systems and matrix inversion, 01 natural sciences, reordering algorithm, transitive reduction, Computational methods for sparse matrices, sparse triangular systems, Graph theory (including graph drawing) in computer science, directed acyclic graph, 0101 mathematics
Popis souboru: application/xml
-
8
Autoři:
Zdroj: International Journal of Circuit Theory and Applications. 13:173-178
Témata: Computational methods for sparse matrices, Graphs and linear algebra (matrices, eigenvalues, etc.), bipartite graph, Other matrix algorithms, 0202 electrical engineering, electronic engineering, information engineering, sparse blocked form, LSI circuits, 02 engineering and technology, reordering a sparse matrix, VLSI circuits, computational effort, reordering algorithm
Popis souboru: application/xml
-
9
Autoři:
Zdroj: International Journal for Numerical Methods in Engineering. 19:1153-1181
Témata: element reordering algorithm, Finite element methods applied to problems in solid mechanics, modified version of King algorithm, minimize number of nodal numbering schemes, 0211 other engineering and technologies, starting nodes selected automatically using concepts from graph theory, 02 engineering and technology, 01 natural sciences, Computer aspects of numerical algorithms, elimination order preserved as closely as possible, Numerical and other methods in solid mechanics, Software, source code, etc. for problems pertaining to mechanics of deformable solids, frontal solution package, generate efficient element numberings, 0101 mathematics, FORTRAN IV
Popis souboru: application/xml
-
10
Autoři: Joseph W. H. Liu
Zdroj: Parallel Computing. 11:73-91
Témata: Computational methods for sparse matrices, sparse symmetric positive-definite matrix, fill-reducing ordering, Numerical examples, parallel Gaussian elimination, elimination tree, Parallel numerical computation, 0102 computer and information sciences, 0101 mathematics, Direct numerical methods for linear systems and matrix inversion, 01 natural sciences, reordering algorithm
Popis souboru: application/xml
-
11
Autoři: John R. Doyle
Zdroj: Applied Mathematical Modelling. 12:86-94
Témata: sparse matrix, 0301 basic medicine, Classification and discrimination, cluster analysis (statistical aspects), Applied Mathematics, subsystems, travelling salesman, 01 natural sciences, Operations research and management science, reordering algorithm, 0104 chemical sciences, 03 medical and health sciences, identifying subsystem structure, classification, Modelling and Simulation, simulated annealing, similarity/interaction data, circularly connected matrices
Popis souboru: application/xml
-
12
Autoři:
Zdroj: ACM Transactions on Mathematical Software. 14:117-138
Témata: Iterative numerical methods for linear systems, Computational methods for sparse matrices, conjugate gradient method, vectorization, multicolor reordering algorithm, large sparse matrices, large linear systems, 0102 computer and information sciences, Numerical solution of discretized equations for boundary value problems involving PDEs, 0101 mathematics, 01 natural sciences
Popis souboru: application/xml
-
13
Autoři:
Přispěvatelé:
Témata: serijsko drevo urinega signala, sinteza z izklapljanjem ure, matrika sosednosti, razporeditveni algoritem, genetski algoritem, latenčni register, karakterizacija digitalnih celic, serial clock tree, gated clock synthesis, adjacency matrix, reordering algorithm, genetic algorithm, shadowed register, logic cell characterization
Popis souboru: application/pdf
-
14
Přispěvatelé: The Pennsylvania State University CiteSeerX Archives
Témata: Index Terms — ATPG, Hamming Distance, Power Consumption, Reordering Algorithm, Switching Activity
Popis souboru: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.148.7604; http://www.engineeringletters.com/issues_v14/issue_1/EL_14_1_15.pdf
Nájsť tento článok vo Web of Science 
Full Text Finder