Suchergebnisse - "Modular Algorithms"

Working on the Structural Components of Evolutionary Approaches

Autoren: Tzanetos, Alexandros Kůdela, Jakub

Quelle: Proceedings of the 16th International Joint Conference on Computational Intelligence ECTA - Volume 1. :375-382

Schlagwörter: Evolutionary Computation, Mechanisms, Modular Algorithms, Nature-Inspired Intelligence, Operators, Swarm Intelligence, Algorithmics, Automatic configuration, Automatic design, Evolutionary approach, Modular framework, Operator, Structural component, Work lists

Dateibeschreibung: print

Zugangs-URL: https://urn.kb.se/resolve?urn=urn:nbn:se:hj:diva-67187
https://doi.org/10.5220/0013083400003837

Optimalizace robotických trajektorií pomocí modulárních evolučních algoritmů

Autoren: Fiala, Jan Kůdela, Jakub Parák, Roman

Weitere Verfasser: Fiala, Jan Kůdela, Jakub Parák, Roman

Schlagwörter: modulární algoritmy, paralerizace, robotic trajectory planning, autotuning, containerization, parallelization, kon- tejnerizace, evoluční algoritmy, robotické plánování trajektorií, evolutionary algorithms, modular algorithms

Dateibeschreibung: application/pdf; text/html

Zugangs-URL: http://hdl.handle.net/11012/252113

From benchmarking optimization heuristics to dynamic algorithm configuration

Autoren: Vermetten, D.L. Bäck, T.H.W. Doerr, C. et al.

Weitere Verfasser: Vermetten, D.L. Bäck, T.H.W. Doerr, C. et al.

Schlagwörter: Optimization, Benchmarking, Dynamic algorithm selection, Modular Algorithms, Black-box, Evolutionary Algorithms, Algorithm configuration, Exploratory Landscape Analysis

Dateibeschreibung: application/pdf

Zugangs-URL: https://hdl.handle.net/1887/4180395

Speeding up polynomial GCD, a crucial operation in Maple

Autoren: Monagan, Michael

Quelle: Maple Transactions; Vol. 2 No. 1 (2022): Proceedings of the Maple Conference 2021 ; 2564-3029

Schlagwörter: Polynomial GCD computation, Sparse polynomial interpolation, Modular algorithms

Dateibeschreibung: application/pdf; video/mp4

Relation: https://mapletransactions.org/index.php/maple/article/view/14452/11895; https://mapletransactions.org/index.php/maple/article/view/14452/11896; https://mapletransactions.org/index.php/maple/article/view/14452

Verfügbarkeit: https://mapletransactions.org/index.php/maple/article/view/14452

Development of an integrated transportation and land use microsimulation model on a flexible modeling platform

Autoren: Habib, M. A. McCarthy, Stephen

Quelle: TRANSPORTATION RESEARCH RECORD. :355-369

Schlagwörter: Decision support systems, Housing, Integration testing, Land use, Building platforms, Flexible model, Integrated transportations, Land use modelling, Microsimulation, Microsimulation modeling, Modeling platforms, Modular algorithms, New approaches, Residential mobility, Population statistics

Dateibeschreibung: print

Zugangs-URL: https://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-313211

Modular algorithms for heterogeneous modal logics via multi-sorted coalgebra

Autoren: Schroder, Lutz Pattinson, Dirk

Quelle: Mathematical Structures in Computer Science. 21:235-266

Schlagwörter: Decision procedure, Modal logic, Building blockes, State-based systems, 0102 computer and information sciences, 02 engineering and technology, Formal logic, 01 natural sciences, Non-determinism, Modular algorithms, Coalgebras, 0202 electrical engineering, electronic engineering, information engineering, Polynomial space, Uncertain informations, Keywords: Basic building block, Algorithms

Zugangs-URL: https://openresearch-repository.anu.edu.au/handle/1885/78863
https://doi.org/10.1017/S0960129510000563
https://dblp.uni-trier.de/db/journals/mscs/mscs21.html#SchroderP11
http://doi.org/10.1017/S0960129510000563
https://www.cambridge.org/core/journals/mathematical-structures-in-computer-science/article/modular-algorithms-for-heterogeneous-modal-logics-via-multisorted-coalgebra/78C62C52B423DE1D88746C51E1A60F96
https://www.cambridge.org/core/services/aop-cambridge-core/content/view/S0960129510000563

Algorithms for solving linear systems over cyclotomic fields

Autoren: Michael Monagan Liang Chen

Quelle: Journal of Symbolic Computation. 45:902-917

Schlagwörter: Modular algorithms, Computational Mathematics, Algebra and Number Theory, Cyclotomic fields, Cyclotomic polynomials, Linear systems, 0101 mathematics, 01 natural sciences

A modular algorithm for computing the exponential solutions of a linear differential operator

Autoren: Cluzeau, Thomas van Hoeij, Mark Vieceli, Yolande et al.

Weitere Verfasser: Cluzeau, Thomas van Hoeij, Mark Vieceli, Yolande et al.

Quelle: Journal of Symbolic Computation. 38:1043-1076

Schlagwörter: Modular algorithms, Differential equations, Computational Mathematics, Algebra and Number Theory, Exponential solutions, 0101 mathematics, 01 natural sciences

Zugangs-URL: https://hal.science/hal-00069198v1
https://dblp.uni-trier.de/db/journals/jsc/jsc38.html#CluzeauH04
https://www.sciencedirect.com/science/article/abs/pii/S0747717104000276
https://hal.archives-ouvertes.fr/hal-00069198
https://www.sciencedirect.com/science/article/pii/S0747717104000276
https://dialnet.unirioja.es/servlet/articulo?codigo=933368

Modular algorithms for computing Gröbner bases: Modular algorithms for computing Gröbner bases.

Autoren: Elizabeth A. Arnold

Quelle: Journal of Symbolic Computation. 35:403-419

Schlagwörter: Computational Mathematics, Algebra and Number Theory, Gröbner bases, other bases for ideals and modules (e.g., Janet and border bases), time improvements, 0101 mathematics, Symbolic computation and algebraic computation, modular algorithms, 01 natural sciences, unlucky primes

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/1967106
https://doi.org/10.1016/s0747-7171(02)00140-2
http://www.ricam.oeaw.ac.at/Groebner-Bases-Bibliography/gbbib_files/publication_355.pdf
http://www.risc.jku.at/Groebner-Bases-Bibliography/gbbib_files/publication_355.pdf
https://www.risc.jku.at/Groebner-Bases-Bibliography/gbbib_files/publication_355.pdf
https://dblp.uni-trier.de/db/journals/jsc/jsc35.html#Arnold03
https://www.sciencedirect.com/science/article/pii/S0747717102001402

On the Computation of Elementary Divisors of Integer Matrices: On the computation of elementary divisors of integer matrices

Autoren: Frank Lübeck

Quelle: Journal of Symbolic Computation. 33:57-65

Schlagwörter: numerical examples, Computational Mathematics, Algebra and Number Theory, Canonical forms, reductions, classification, Other matrix algorithms, elementary divisors, semi-modular algorithms, integer matrices, 0101 mathematics, Symbolic computation and algebraic computation, 01 natural sciences

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/1753638
https://doi.org/10.1006/jsco.2000.0430
https://dialnet.unirioja.es/servlet/articulo?codigo=315160
https://www.sciencedirect.com/science/article/pii/S0747717100904309
https://dl.acm.org/doi/10.1006/jsco.2000.0430
http://www.math.rwth-aachen.de/~Frank.Luebeck/preprints/eldiv.pdf
https://dblp.uni-trier.de/db/journals/jsc/jsc33.html#Lubeck02
https://www.sciencedirect.com/science/article/pii/S0747717100904309#!

Optimalizace robotických trajektorií pomocí modulárních evolučních algoritmů ; Robot trajectory optimization with modular evolutionary algorithms

Autoren: Fiala, Jan Kůdela, Jakub Parák, Roman

Weitere Verfasser: Fiala, Jan Kůdela, Jakub Parák, Roman

Schlagwörter: robotické plánování trajektorií, evoluční algoritmy, modulární algoritmy, autotuning, kon- tejnerizace, paralerizace, robotic trajectory planning, evolutionary algorithms, modular algorithms, containerization, parallelization

Dateibeschreibung: application/pdf; text/html

Relation: FIALA, J. Optimalizace robotických trajektorií pomocí modulárních evolučních algoritmů [online]. Brno: Vysoké učení technické v Brně. Fakulta strojního inženýrství. 2025.; 165706; https://hdl.handle.net/11012/252113

Verfügbarkeit: https://hdl.handle.net/11012/252113

Reduced-complexity verification for initial-state opacity in modular discrete event systems

Autoren: Saboori, A. Hadjicostis, Christoforos N. Hadjicostis, Christoforos N. [0000-0002-1706-708X]

Weitere Verfasser: Saboori, A. Hadjicostis, Christoforos N. Hadjicostis, Christoforos N. [0000-0002-1706-708X]

Quelle: IFAC Proceedings Volumes (IFAC-PapersOnline)

Schlagwörter: Opacity, Manganese compounds, Discrete event systems, Initial state, Verification method, Modular methods, Synchronous products, Monolithic systems, Automata, Modular algorithms, Time complexity, Natural projections, System models, Nondeterministic finite automaton, Reduced-complexity, Finite automata

Zugangs-URL: http://gnosis.library.ucy.ac.cy/handle/7/44829

Probabilistic Algorithms for Computing Resultants

Autoren: Michael Monagan The Pennsylvania State University CiteSeerX Archives

Weitere Verfasser: Michael Monagan The Pennsylvania State University CiteSeerX Archives

Quelle: http://www.cecm.sfu.ca/~mmonagan/papers/resultant.pdf.

Schlagwörter: Categories and Descriptors, I.1.2 [Symbolic and Algebraic Manipulation, Algorithms – Algebraic algorithms. General Terms, Algorithms Keywords, Sylvester’s resultant, polynomial resultants, modular algorithms, probabilistic algorithms

Dateibeschreibung: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.91.5440; http://www.cecm.sfu.ca/~mmonagan/papers/resultant.pdf

Verfügbarkeit: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.91.5440
http://www.cecm.sfu.ca/~mmonagan/papers/resultant.pdf

Maximal Quotient Rational Reconstruction: An Almost Optimal Algorithm for Rational Reconstruction

Autoren: Michael Monagan The Pennsylvania State University CiteSeerX Archives

Weitere Verfasser: Michael Monagan The Pennsylvania State University CiteSeerX Archives

Quelle: http://www.cecm.sfu.ca/CAG/papers/MQRR.pdf.

Schlagwörter: Categories and Descriptors, I.1.2 [Symbolic and Alge- braic Manipulation, Algorithms – Algebraic algorithms, F.2.1 [Analysis of Algorithms and Problem Complexity, Numerical algorithms and problems – Number-theoretic com- putations. General Terms, Algorithms Keywords, Euclidean Algorithm, Modular Algorithms, Ra- tional Reconstruction

Dateibeschreibung: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.642.3734; http://www.cecm.sfu.ca/CAG/papers/MQRR.pdf

Verfügbarkeit: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.642.3734
http://www.cecm.sfu.ca/CAG/papers/MQRR.pdf

Algorithms for Polynomial GCD Computation over Algebraic Function Fields

Autoren: Mark Van Hoeij Michael Monagan The Pennsylvania State University CiteSeerX Archives

Weitere Verfasser: Mark Van Hoeij Michael Monagan The Pennsylvania State University CiteSeerX Archives

Quelle: http://www.cecm.sfu.ca/~mmonagan/papers/AFGCD.pdf.

Schlagwörter: Modular algorithms

Dateibeschreibung: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.163.6664; http://www.cecm.sfu.ca/~mmonagan/papers/AFGCD.pdf

Verfügbarkeit: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.163.6664
http://www.cecm.sfu.ca/~mmonagan/papers/AFGCD.pdf

A modular system of algorithms for unconstrained minimization

Autoren: Robert B. Schnabel Barry E. Weiss John E. Koonatz

Quelle: ACM Transactions on Mathematical Software. 11:419-440

Schlagwörter: software package, Numerical mathematical programming methods, Software, source code, etc. for problems pertaining to operations research and mathematical programming, Nonlinear programming, reverse communication, 0101 mathematics, modular algorithms, 01 natural sciences, unconstrained minimization

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/3949610
https://doi.org/10.1145/6187.6192
http://dblp.uni-trier.de/db/journals/toms/toms11.html#SchnabelKW85
https://dl.acm.org/doi/10.1145/6187.6192
https://dblp.uni-trier.de/db/journals/toms/toms11.html#SchnabelKW85
https://doi.acm.org/10.1145/6187.6192
http://doi.org/10.1145/6187.6192
https://dl.acm.org/citation.cfm?doid=6187.6192

Algorithmsfor the Non-monic Case ofthe Sparse Modular GCD Algorithm ∗ ABSTRACT

Autoren: Jennifer De Kleine The Pennsylvania State University CiteSeerX Archives

Weitere Verfasser: Jennifer De Kleine The Pennsylvania State University CiteSeerX Archives

Quelle: http://www.cecm.sfu.ca/personal/monaganm/papers/LINZIP.pdf.

Schlagwörter: General Terms, Algorithms. Keywords, Zippel’s Algorithm, Polynomial Greatest Common Divisors, Sparse Multivariate Polynomials, Modular Algorithms, Probabilistic Algorithms

Dateibeschreibung: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.91.2594; http://www.cecm.sfu.ca/personal/monaganm/papers/LINZIP.pdf

Verfügbarkeit: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.91.2594
http://www.cecm.sfu.ca/personal/monaganm/papers/LINZIP.pdf

Classification of Partial Differential Modules in Positive Characteristic

Autoren: M. A. Barkatou T. Cluzeau J. -a. Weil et al.

Weitere Verfasser: M. A. Barkatou T. Cluzeau J. -a. Weil et al.

Quelle: http://perso.ensil.unilim.fr/~cluzeau/BCW.pdf.

Schlagwörter: Linear Differential Equations, Partial Differential Equations, D-Finite Systems, Modular Algorithms, p-Curvature, Factorization, Simultaneous Reduction of Commuting Matrices

Dateibeschreibung: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.403.1353; http://perso.ensil.unilim.fr/~cluzeau/BCW.pdf

Verfügbarkeit: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.403.1353
http://perso.ensil.unilim.fr/~cluzeau/BCW.pdf

ABSTRACT Algorithms for Polynomial GCD Computation over Algebraic Function Fields

Autoren: Mark Van Hoeij The Pennsylvania State University CiteSeerX Archives

Weitere Verfasser: Mark Van Hoeij The Pennsylvania State University CiteSeerX Archives

Quelle: http://www.cecm.sfu.ca/~pborwein/MITACS/papers/monagan.pdf.

Schlagwörter: Modular algorithms

Dateibeschreibung: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.130.6759; http://www.cecm.sfu.ca/~pborwein/MITACS/papers/monagan.pdf

Verfügbarkeit: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.130.6759
http://www.cecm.sfu.ca/~pborwein/MITACS/papers/monagan.pdf

Resolving Zero-Divisors of Radical Triangular Sets Using Hensel Lifting and Applications

Autoren: Kluesner, John Charles

Schlagwörter: Computer Algebra, Modular Algorithms, Triangular Sets, Radical Ideals, Inversion, Greatest Common Divisors, Maple

Relation: https://summit.sfu.ca/_flysystem/fedora/sfu_migrate/17508/etd10318_JKluesner.pdf

Verfügbarkeit: https://summit.sfu.ca/_flysystem/fedora/sfu_migrate/17508/etd10318_JKluesner.pdf