Výsledky vyhľadávania - F.2.1 Numerical Algorithms and Problems
-
1
Autori: a ďalší
Prispievatelia: a ďalší
Zdroj: Theory of Computing Systems. 63:1089-1130
Predmety: FOS: Computer and information sciences, Policy iteration, F.2.1 Numerical Algorithms and Problems, [MATH.MATH-OC] Mathematics [math]/Optimization and Control [math.OC], Shapley operators, policy iteration, 1991 Mathematics Subject Classification. G.2.1 Combinatorial algorithms, Perron eigenvalues, 91A15, 47H05, 93E20, Computer Science - Computer Science and Game Theory, Optimization and Control (math.OC), FOS: Mathematics, [MATH.MATH-OC]Mathematics [math]/Optimization and Control [math.OC], ddc:004, Stochastic games, Mathematics - Optimization and Control, Risk sensitive control, Computer Science and Game Theory (cs.GT)
Popis súboru: application/pdf
Prístupová URL adresa: https://drops.dagstuhl.de/opus/volltexte/2017/7026/pdf/LIPIcs-STACS-2017-6.pdf
http://arxiv.org/abs/1904.05151
https://inria.hal.science/hal-01676695v1
https://hal.science/hal-02143807v1
https://doi.org/10.1007/s00224-019-09925-z
https://link.springer.com/article/10.1007%2Fs00224-019-09925-z
https://hal.archives-ouvertes.fr/hal-02143807
https://dblp.uni-trier.de/db/journals/corr/corr1904.html#abs-1904-05151
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2017.6 -
2
Autori: a ďalší
Prispievatelia: a ďalší
Zdroj: IEEE Transactions on Parallel and Distributed Systems. 25:478-487
Predmety: [INFO.INFO-DC]Computer Science [cs]/Distributed, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], 02 engineering and technology, E.0.a Data communications aspects < E.0 General < E Data, Parallel, Divergence, and Cluster Computing [cs.DC], Data stream, Randomized approximation algorithm, [INFO.INFO-DC] Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], 0202 electrical engineering, electronic engineering, information engineering, F.2.1 Numerical Algorithms and Problems < F.2 Analysis of Algorithms and Problem Complexity < F Theory of Computation
Popis súboru: application/pdf
Prístupová URL adresa: https://hal.archives-ouvertes.fr/hal-00998708/file/ankle-tpds2013.pdf
https://hal.science/hal-00998708v1/document
https://hal.science/hal-00998708v1
https://doi.org/10.1109/tpds.2013.101
https://dblp.uni-trier.de/db/journals/tpds/tpds25.html#AnceaumeB14
https://hal.archives-ouvertes.fr/hal-00998708
https://ieeexplore.ieee.org/document/6494567
https://hal.inria.fr/hal-00804437
https://hal.archives-ouvertes.fr/hal-00998708/document
http://dblp.uni-trier.de/db/journals/tpds/tpds25.html#AnceaumeB14 -
3
Autori: a ďalší
Zdroj: 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS). :1426-1439
Predmety: FOS: Computer and information sciences, Discrete Mathematics (cs.DM), Computer Science - Data Structures and Algorithms, F.2.1, I.1.2, 68W30, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, 0101 mathematics, 01 natural sciences, Computer Science - Discrete Mathematics
Prístupová URL adresa: http://arxiv.org/abs/2304.01191
-
4
Autori: a ďalší
Prispievatelia: a ďalší
Zdroj: Hupp, P, Heene, M, Jacob, R & Pflüger, D 2016, 'Global communication schemes for the numerical solution of high-dimensional PDEs', Parallel Computing, vol. 52, pp. 78-105. https://doi.org/10.1016/j.parco.2015.12.006
Predmety: Global Communication, Global communication, Experimental evaluation, Operating Systems (CR D.4), 0102 computer and information sciences, Communication performance analysis, Communication Performance Analysis, 01 natural sciences, Numerical Analysis General (CR G.1.0), Partial Differential Equations (CR G.1.8), High-Performance Computing, Experimental Evaluation, Sparse Grid Combination Technique, Concurrent Programming (CR D.1.3), 0101 mathematics, Communication model, High-performance computing, Sparse grid combination technique, Numerical Algorithms and Problems (CR F.2.1), Communication Model
Popis súboru: application/pdf
Prístupová URL adresa: https://dblp.uni-trier.de/db/journals/pc/pc52.html#HuppHJP16
https://www.sciencedirect.com/science/article/pii/S0167819115001623
https://core.ac.uk/display/50528976
https://doi.org/10.1016/j.parco.2015.12.006
https://dl.acm.org/doi/abs/10.1016/j.parco.2015.12.006
http://www.sciencedirect.com/science/article/pii/S0167819115001623
https://pure.itu.dk/ws/files/82527236/parcoCommSchemesSubmitted.pdf -
5
Autori:
Prispievatelia:
-
6
Autori:
Prispievatelia:
Zdroj: ftp://ftp-sop.inria.fr/saga/emiris/publis/CEjacm.ps.gz
Predmety: Categories and Subject Descriptors, I.1.2 Algorithms (Algebraic algorithms, Analysis of algorithms). F.2.1 Numerical Algorithms and Problems (Computations on matrices, Computations on polynomials). F.2.2 Nonnumerical Algorithms and Problems (Computations on discrete s, Geometrical problems and computations) General Terms, Algorithms, Theory. Additional Key Words and Phrases, Sparse elimination theory, multivariate resultant, Newton polytope, mixed volume, polyhedral subdivision, eoeective Nullstellensatz, asymptotic complexity
Popis súboru: application/postscript
-
7
Autori:
Zdroj: Numerical Algorithms. 10:225-244
Predmety: \(QR\) factorization, Numerical solutions to overdetermined systems, pseudoinverses, weak stability, semi-normal equations, QR factorization, Hankel matrix, least squares problem, Numerical Analysis (math.NA), stability, Toeplitz matrix, Direct numerical methods for linear systems and matrix inversion, 01 natural sciences, Toeplitz or Hankel matrix, 65F05 (Primary) 15B05, 65G50 (Secondary), least squares, normal equations, orthogonal factorization, fast algorithm, FOS: Mathematics, Mathematics - Numerical Analysis, F.2.1, 0101 mathematics, error analysis, Cholesky factorization
Popis súboru: application/xml; 263461 bytes; 356 bytes; application/pdf; application/octet-stream
Prístupová URL adresa: http://arxiv.org/pdf/1005.0503
http://arxiv.org/abs/1005.0503
http://maths.anu.edu.au/~brent/pd/rpb143-final.pdf
https://maths-people.anu.edu.au/~brent/pd/rpb143-final.pdf
https://link.springer.com/content/pdf/10.1007/BF02140770.pdf
https://dblp.uni-trier.de/db/journals/na/na10.html#BojanczykBH95
http://ui.adsabs.harvard.edu/abs/1995NuAlg..10..225B/abstract
https://link.springer.com/article/10.1007/BF02140770
https://openresearch-repository.anu.edu.au/bitstream/1885/40785/3/TR-CS-93-15.pdf
https://arxiv.org/pdf/1005.0503.pdf
https://maths-people.anu.edu.au/~brent/pd/rpb143tr.pdf
http://maths.anu.edu.au/~brent/pd/rpb143tr.pdf
https://dblp.uni-trier.de/db/journals/corr/corr1005.html#abs-1005-0503
https://openresearch-repository.anu.edu.au/handle/1885/40785 -
8
Autori: a ďalší
Prispievatelia: a ďalší
Predmety: Categories and Subject Descriptors F.2.1 [Numerical Algorithms and Problems, Computations in finite fields, F.1.3 [Complexity Measures and Classes, Reducibility and completeness Keywords Solvability, sparse polynomial, finite fields, NP-hardness, gcd, square-free, discriminant, resultant
Popis súboru: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.298.3034; http://www.math.tamu.edu/~rojas/q.pdf
-
9
Autori: a ďalší
Prispievatelia: a ďalší
Zdroj: ISSN: 1433-7541.
Predmety: Polygonal Approximation, Dynamic programming, Multiresolution, F.2.1 Numerical Algorithms and Problems, G.1.2 Approximation, [INFO.INFO-CG]Computer Science [cs]/Computational Geometry [cs.CG], [INFO.INFO-IR]Computer Science [cs]/Information Retrieval [cs.IR]
Relation: info:eu-repo/semantics/altIdentifier/arxiv/0709.1941; hal-00171706; https://hal.archives-ouvertes.fr/hal-00171706; https://hal.archives-ouvertes.fr/hal-00171706v3/document; https://hal.archives-ouvertes.fr/hal-00171706v3/file/MRShort_v5.pdf; ARXIV: 0709.1941
-
10
Autori: a ďalší
Prispievatelia: a ďalší
Predmety: Categories and Subject Descriptors B.2.4 [Arithmetic and Logic Structures, High-Speed Arithmetic, C.1.3 [Other Architecture Style, Adaptable architectures, F.2.1 [Numerical Algorithms and Problems, Computations on matrices General Terms Algorithms, Design, Performance Keywords Matrix multiplication, Floating-point, FPGA
Popis súboru: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.108.9463; http://www.openhard.org/data/openhard/user/a4e7aa1374588b0f52e95e76961c3162.pdf
-
11
Autori:
Prispievatelia:
Predmety: F.2.1 [Numerical Algorithms and Problems, Computations in finite fields, G.4 [Mathematical Software, Algorithm design and analysis, I.1.2 [Algorithms, Algebraic algorithms, Analysis of algorithms General Terms Algorithms, Design, Performance Keywords Deterministic algorithms, Equation solving, Finite fields
Popis súboru: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.167.8750; http://www.opt.math.tugraz.at/%7Ecvdwoest/maths/issac2005.pdf
-
12
Autori:
Prispievatelia:
Predmety: E.1 [Data Structures, Arrays, D.1.0[Programming Techniques, General, F.2.1[Numerical Algorithms and Problems, Computations on matrices, E.2[Data Storage Representations, contiguous representations. General Terms, Algorithms, Performance Keywords, dilated integers, Morton order, quadtrees, compilers, index arithmetic
Popis súboru: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.86.1801; http://www.cs.indiana.edu/~dswise/Arcee/Papers/compressedIndices.pdf
-
13
Autori:
Prispievatelia:
Predmety: Categories and Subject Descriptors, E.3 [Data Encryption, Public Key Cryptosystems, F.2.1 [Numerical Algorithms and Problems, Number-theoretic computations General Terms, Security, Theory Additional Key Words and Phrases, Cryptography, complexity, RSA-encryption, bit-security, discrete
Popis súboru: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.185.487; http://www.nada.kth.se/%7Ejohanh/hnrsaacm.pdf
-
14
Autori: a ďalší
Prispievatelia: a ďalší
Predmety: Categories and Subject Descriptors F.2.1 [Numerical Algorithms and Problems, Computations on matrices, D.3.2 [Language Classifications, Specialized applica- tion languages, D.3.4 [Processors, Compilers and Optimization, F.2.3 [Tradeoffs between Complexity Measures, J.2 [Physical Sciences and Engineering, Chemistry General Terms Algorithms Keywords Loop fusion, loop transformation, tile size selection
Popis súboru: application/pdf
-
15
Autori:
Prispievatelia:
Predmety: ACM CCS Categories and Subject Descriptors, F.2.1 Numerical Algorithms and Problems Key words, Design of Algorithms, Data Streams, Time Series, Latency, Monotonicity
Popis súboru: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.342.1902; http://arxiv.org/pdf/cs/0610046v4.pdf
-
16
Autori: Kerber, Michael1 (AUTHOR) mkerber@mpi-inf.mpg.de
Zdroj: International Journal of Computer Mathematics. Dec2009, Vol. 86 Issue 12, p2186-2200. 15p. 2 Charts.
-
17
Autori:
Prispievatelia:
Predmety: ACM CCS Categories and Subject Descriptors, F.2.1 Numerical Algorithms and Problems Key words, Design of Algorithms, Data Streams, Time Series, Latency, Monotonicity
Popis súboru: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.85.6173; http://www.archipel.uqam.ca/309/01/webmaximinalgo.pdf
-
18
Autori:
Prispievatelia:
Predmety: zero-one matrices, lower bounds, matrix equations ACM Classification Keywords, F.2.1 Numerical Algorithms and Problems
Popis súboru: application/pdf
-
19
Autori:
Zdroj: ACM Transactions on Mathematical Software. 2013, Vol. 39 Issue 3, p18-18:19. 2p. 2 Charts.
Predmety: *MATHEMATICAL models, *ALGORITHM research, *EIGENVALUES, *NUMERICAL analysis, *MATHEMATICS software, *COMPUTER software
-
20
Autori:
Prispievatelia:
Predmety: Zahlentheorie, Arthur-Merlin-Protokolle, Polynome, Komplexitätstheorie, Ringe, Automorphismen, Faktorisieren, Algebra, Complexity Measures and Classes (CR F.1.3), Kommutativer Ring , Algebra , Isomorphismus , Komplexitätstheorie , Algebraische Zahlentheorie , Algorithmische Zahlentheorie , Automorphismus, Arthur-Merlin protocol, Isomorphismen, Numerical Algorithms and Problems (CR F.2.1), Graph-Isomorphie
Popis súboru: application/pdf; 1041025 Bytes
Prístupová URL adresa: http://elib.uni-stuttgart.de/opus/volltexte/2006/2537/pdf/Diplomarbeit.pdf
Full Text Finder 
Nájsť tento článok vo Web of Science