Suchergebnisse - "divide and conquer algorithm"

On Kemeny's constant and stochastic complement

Autoren: Bini Dario Andrea. Durastante F. Kim Sooyeong et al.

Quelle: Linear Algebra and its Applications. 703:137-162

Schlagwörter: Divide-and-conquer algorithm, Kemeny's constant, Markov chains, FOS: Mathematics, 60J22, 65C40, 65F15, Mathematics - Numerical Analysis, Numerical Analysis (math.NA), 0101 mathematics, 01 natural sciences

Dateibeschreibung: application/pdf

Zugangs-URL: http://arxiv.org/abs/2312.13201

A Case Study of a Transportation Company Modeled as a Scheduling Problem

Autoren: Cristina Tobar-Fernández Ana Dolores López-Sánchez Jesús Sánchez-Oro

Quelle: Mathematics, Vol 13, Iss 21, p 3547 (2025)

Schlagwörter: scheduling problem, commercial constraints, time windows, divide-and-conquer algorithm, Hexaly, Mathematics, QA1-939

Dateibeschreibung: electronic resource

Relation: https://www.mdpi.com/2227-7390/13/21/3547; https://doaj.org/toc/2227-7390

Zugangs-URL: https://doaj.org/article/ede02b3926d24c009d1f772de83424e9

Divide-and-Conquer Methods for Functions of Matrices with Banded or Hierarchical Low-Rank Structure

Autoren: Cortinovis, A Kressner, D Massei, S

Quelle: SIAM Journal on Matrix Analysis and Applications. 43:151-177

Schlagwörter: Key words, matrix function, banded matrix, hierarchically semiseparable matrix, Krylov sub, space method, divide-and-conquer algorithm, FOS: Mathematics, Mathematics - Numerical Analysis, Numerical Analysis (math.NA), 0101 mathematics, 01 natural sciences

Dateibeschreibung: application/pdf

Zugangs-URL: http://arxiv.org/pdf/2107.04337
http://arxiv.org/abs/2107.04337
https://epubs.siam.org/doi/10.1137/21M1432594
https://hdl.handle.net/11568/1154860
https://doi.org/10.1137/21M1432594

A Segmented Cross-Correlation Algorithm for Dynamic North Finding Using Fiber Optic Gyroscopes

Autoren: Shuwei Fang Shanjun Mao Yanjun Chen et al.

Quelle: Sensors, Vol 24, Iss 2, p 322 (2024)

Schlagwörter: north finding, fiber optic gyroscope, divide-and-conquer algorithm, jitter, Chemical technology, TP1-1185

Relation: https://www.mdpi.com/1424-8220/24/2/322; https://doaj.org/toc/1424-8220; https://doaj.org/article/bd729a904d3e4a6fb37c0a0d03956206

Verfügbarkeit: https://doi.org/10.3390/s24020322
https://doaj.org/article/bd729a904d3e4a6fb37c0a0d03956206

Linear expectile regression under massive data

Autoren: Shanshan Song Yuanyuan Lin Yong Zhou

Quelle: Fundamental Research, Vol 1, Iss 5, Pp 574-585 (2021)

Schlagwörter: Divide and conquer algorithm, Q1-390, Science (General), (Asymptotic) confidence distribution, Massive data, Expectile regression, 0502 economics and business, 05 social sciences, 0101 mathematics, 01 natural sciences

Zugangs-URL: https://doaj.org/article/17df0b69b65348a1a5a1e9022fac3bdf
https://www.sciencedirect.com/science/article/pii/S2667325821001588

A Versatile Unitary Transformation Framework for an Optimal Bath Construction in Density-Matrix Based Quantum Embedding Approaches

Autoren: Quentin Marécat Matthieu Saubanère

Quelle: Computation, Vol 11, Iss 203, p 203 (2023)

Schlagwörter: one-body reduced density matrix functional embedding, effective Hamiltonian, Hubbard model, unitary transformation, divide-and-conquer algorithm, density matrix embedding theory, Electronic computers. Computer science, QA75.5-76.95

Relation: https://www.mdpi.com/2079-3197/11/10/203; https://doaj.org/toc/2079-3197; https://doaj.org/article/8bec27f5a1d94b9c9ad8ca59c792d558

Verfügbarkeit: https://doi.org/10.3390/computation11100203
https://doaj.org/article/8bec27f5a1d94b9c9ad8ca59c792d558

On the Contraction Method with Degenerate Limit Equation

Autoren: Neininger, Ralph Rüschendorf, Ludger

Quelle: The Annals of Probability, 2004 Jul 01. 32(3), 2838-2856.

Zugangs-URL: https://www.jstor.org/stable/3481649

A General Limit Theorem for Recursive Algorithms and Combinatorial Structures

Autoren: Neininger, Ralph Rüschendorf, Ludger

Quelle: The Annals of Applied Probability, 2004 Feb 01. 14(1), 378-418.

Zugangs-URL: https://www.jstor.org/stable/4140499

Computation of Gauss-Kronrod Quadrature Rules

Autoren: Calvetti, D. Golub, G. H. Gragg, W. B. et al.

Quelle: Mathematics of Computation, 2000 Jul 01. 69(231), 1035-1052.

Zugangs-URL: https://www.jstor.org/stable/2585013

An adaptive lack of fit test for big data

Autoren: Zhaojun Wang Changliang Zou Yanyan Zhao

Quelle: Statistical Theory and Related Fields, Vol 1, Iss 1, Pp 59-68 (2017)

Schlagwörter: adaptive test, massive dataset, model specification test, asymptotic distribution, 0101 mathematics, Probabilities. Mathematical statistics, 01 natural sciences, QA273-280, divide-and-conquer algorithm

Zugangs-URL: https://doaj.org/article/328bea8e4c2e4158a2e370271579e9d0
https://www.tandfonline.com/doi/full/10.1080/24754269.2017.1339373

Application of theory for regular sequences on divide and conquer algorithms

Autoren: Lechner, Tobias Heuberger, Clemens Universitätsbibliothek

Weitere Verfasser: Lechner, Tobias Heuberger, Clemens Universitätsbibliothek

Schlagwörter: divide and conquer algorithm, asymptotic expansion, regular sequence

Zugangs-URL: https://resolver.obvsg.at/urn:nbn:at:at-ubk:1-52067
https://netlibrary.aau.at/id/9796930

A Robust Divide and Conquer Algorithm for Progressive Medial Axes of Planar Shapes

Autoren: Liu, Yongjin Yu, Chengchi Yu, Minjing et al.

Quelle: IEEE Transactions on Visualization and Computer Graphics. 22:2522-2536

Schlagwörter: Divide and conquer algorithm, Progressive medial axes, Topology-oriented algorithm, 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, Shape hierarchy and evolution, 01 natural sciences

Zugangs-URL: https://pubmed.ncbi.nlm.nih.gov/28055880
https://ieeexplore.ieee.org/document/7364294/
http://dblp.uni-trier.de/db/journals/tvcg/tvcg22.html#LiuYYTK16
https://repository.ust.hk/ir/Record/1783.1-81475
http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=7364294
https://dblp.uni-trier.de/db/journals/tvcg/tvcg22.html#LiuYYTK16
https://hanyang.elsevierpure.com/en/publications/a-robust-divide-and-conquer-algorithm-for-progressive-medial-axes

Sürücü yorgunluk evrelerinin EEG işaretleri ile tespiti ve analizi

Autoren: DEMİR, Ahmet BEKİRYAZICI, Şule ÇOŞKUN, Oğuzhan et al.

Quelle: Volume: 28, Issue: 5 643-651
Pamukkale University Journal of Engineering Sciences
Pamukkale Üniversitesi Mühendislik Bilimleri Dergisi

Schlagwörter: Engineering, Sürücü yorgunluğu, Elektroensefolografi, Temel bileşen analizi, Sınıflandırma, Böl ve fethet algoritması, Mühendislik, Driver fatigue, Electroencephalography, Principalcomponent analysis, Classification, Divide and conquer algorithm

Dateibeschreibung: application/pdf

Zugangs-URL: https://dergipark.org.tr/tr/pub/pajes/issue/73258/1196349

A Divide and Conquer Algorithm for the Superfast Solution of Toeplitz-like Systems

Autoren: Favati Paola Lotti Grazia Menchi Ornella et al.

Weitere Verfasser: Favati Paola Lotti Grazia Menchi Ornella et al.

Quelle: SIAM journal on matrix analysis and applications
33 (2012): 1039–1056. doi:10.1137/110851407
info:cnr-pdr/source/autori:Favati Paola, Lotti Grazia, Menchi Ornella/titolo:A Divide and Conquer Algorithm for the Superfast solution of Toeplitz-like Systems/doi:10.1137%2F110851407/rivista:SIAM journal on matrix analysis and applications (Print)/anno:2012/pagina_da:1039/pagina_a:1056/intervallo_pagine:1039–1056/volume:33

Schlagwörter: divide and conquer algorithm, Divide and conquer algorithm, divide and conquer algo, superfast algorithm, Toeplitz-like matrices, 0101 mathematics, 01 natural sciences

Zugangs-URL: https://epubs.siam.org/doi/abs/10.1137/110851407
https://locus.siam.org/doi/abs/10.1137/110851407
https://arpi.unipi.it/handle/11568/156200
https://doi.org/10.1137/110851407
https://dblp.uni-trier.de/db/journals/siammax/siammax33.html#FavatiLM12

A New Structural Model of Apolipoprotein B100 Based on Computational Modeling and Cross Linking

Autoren: Kianoush Jeiran Scott M. Gordon Denis O. Sviridov et al.

Quelle: Int J Mol Sci
International Journal of Molecular Sciences; Volume 23; Issue 19; Pages: 11480

Schlagwörter: 0301 basic medicine, Lipoproteins, VLDL, Ligands, Article, Lipoproteins, LDL, Models, Structural, 03 medical and health sciences, Sulfoxides, Apolipoprotein B-100, Computer Simulation, Cysteine, Disulfides, apolipoprotein B100, very low-density lipoprotein, LDL receptor ligand, lipovitellin, homology modeling, DSSO cross-linker, cardiovascular disease, ITASSER, divide and conquer algorithm, Apolipoproteins B

Dateibeschreibung: application/pdf

Zugangs-URL: https://pubmed.ncbi.nlm.nih.gov/36232786

Divide and Conquer Roadmap for Algebraic Sets

Autoren: Basu, Saugata Roy, Marie-Françoise Roy, Marie-Francoise et al.

Weitere Verfasser: Basu, Saugata Roy, Marie-Françoise Roy, Marie-Francoise et al.

Quelle: Discrete & Computational Geometry. 52:278-343

Schlagwörter: [MATH.MATH-AG] Mathematics [math]/Algebraic Geometry [math.AG], 16. Peace & justice, Primary 14Q20, Secondary 14P05, 68W05, 14P05, 68W05, divide and conquer algorithm, Mathematics - Algebraic Geometry, Real algebraic varieties, 13. Climate action, FOS: Mathematics, 14Q20, [MATH.MATH-AG]Mathematics [math]/Algebraic Geometry [math.AG], F.2.2, Algebraic Geometry (math.AG), Roadmaps

Dateibeschreibung: application/pdf

Zugangs-URL: https://link.springer.com/content/pdf/10.1007%2Fs00454-014-9610-9.pdf
http://arxiv.org/abs/1305.3211
https://ui.adsabs.harvard.edu/abs/2013arXiv1305.3211B/abstract
https://arxiv.org/pdf/1305.3211.pdf
https://arxiv.org/abs/1305.3211
https://link.springer.com/content/pdf/10.1007%2Fs00454-014-9610-9.pdf
https://hal.archives-ouvertes.fr/hal-00833308
https://doi.org/10.1007/s00454-014-9610-9
https://link.springer.com/article/10.1007/s00454-014-9610-9?view=classic
https://rd.springer.com/article/10.1007/s00454-014-9610-9
https://link.springer.com/article/10.1007/s00454-014-9610-9/fulltext.html
https://hal.science/hal-00833308v1/document
https://doi.org/10.1007/s00454-014-9610-9
https://hal.science/hal-00833308v1

Fast construction of assembly trees for molecular graphs

Autoren: Artemova, Svetlana Grudinin, Sergei Redon, Stephane et al.

Weitere Verfasser: Artemova, Svetlana Grudinin, Sergei Redon, Stephane et al.

Quelle: Journal of Computational Chemistry. 32:1589-1598

Schlagwörter: molecular graphs, adaptive algorithm, internal coordinates, [INFO.INFO-MO] Computer Science [cs]/Modeling and Simulation, 0102 computer and information sciences, molecular simulations, [INFO.INFO-MO]Computer Science [cs]/Modeling and Simulation, assembly tree, 01 natural sciences, divide-and-conquer algorithm

Zugangs-URL: https://pubmed.ncbi.nlm.nih.gov/21328401

An evolutionary game algorithm for grid resource allocation under bounded rationality

Autoren: Haglin, D. J. Mayes, Kenneth Manning, Anna et al.

Quelle: Haglin, D J, Mayes, K, Manning, A, Feo, J, Gurd, J R, Elliot, M & Keane, J A 2009, 'Factors affecting the performance of parallel mining of minimal unique itemsets on diverse architectures', Concurrency and Computation: Practice & Experience, vol. 21, no. 9, pp. 1131-1158. https://doi.org/10.1002/cpe.1379

Schlagwörter: 0301 basic medicine, 03 medical and health sciences, Itemset mining, Performance, 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology, 0101 mathematics, Divide-and-conquer algorithm, Load balancing, 01 natural sciences, Parallel architecture

Zugangs-URL: http://www.ida.liu.se/~rtslab/publications/2008/AsplundNZ08cpe.pdf
https://infoscience.epfl.ch/record/165583/files/parreord.pdf
https://research.manchester.ac.uk/en/publications/ab2fc09b-f657-483d-9391-b428257f8872
https://doi.org/10.1002/cpe.1379
https://dblp.uni-trier.de/db/journals/concurrency/concurrency21.html#LiC09
https://doi.org/10.1002/cpe.1388
http://dblp.uni-trier.de/db/journals/concurrency/concurrency21.html#LiC09
https://onlinelibrary.wiley.com/doi/abs/10.1002/cpe.1388
https://www.onlinelibrary.wiley.com/doi/10.1002/cpe.1382
http://dblp.uni-trier.de/db/journals/concurrency/concurrency21.html#GortonCN09
https://dblp.uni-trier.de/db/journals/concurrency/concurrency21.html#GortonCN09
http://www.osti.gov/scitech/biblio/974477-design-implementation-high-performance-cca-event-service
https://research.manchester.ac.uk/en/publications/ab2fc09b-f657-483d-9391-b428257f8872
http://www3.interscience.wiley.com/cgi-bin/fulltext/122197444/PDFSTART
https://doi.org/10.1002/cpe.1379

Applications of the complexity space to the General Probabilistic Divide and Conquer Algorithms

Autoren: Luis M. García-Raffi Michel Schellekens Salvador Romaguera

Quelle: Journal of Mathematical Analysis and Applications. 348:346-355

Schlagwörter: Improver, Recurrence, Complexity quasi-metric space, Probabilistic Divide and Conquer Algorithm, Applied Mathematics, Smyth complete, Fixed point, 0101 mathematics, 16. Peace & justice, 01 natural sciences, Analysis

Zugangs-URL: https://www.sciencedirect.com/science/article/pii/S0022247X0800735X
https://ui.adsabs.harvard.edu/abs/2008JMAA..348..346G/abstract
https://core.ac.uk/display/82486035
https://www.sciencedirect.com/science/article/abs/pii/S0022247X0800735X

Competitive graph searches

Autoren: Bui-Xuan, Binh-Minh Habib, Michel Paul, Christophe

Weitere Verfasser: Bui-Xuan, Binh-Minh Habib, Michel Paul, Christophe

Quelle: Theoretical Computer Science. 393:72-80

Schlagwörter: [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], Common connected graph component, 0211 other engineering and technologies, Sandwich graph problem, 0102 computer and information sciences, 02 engineering and technology, Graph search, Divide-and-conquer algorithm, 01 natural sciences, Theoretical Computer Science, Computer Science(all)

Zugangs-URL: https://hal-lirmm.ccsd.cnrs.fr/lirmm-00132103/document
https://dblp.uni-trier.de/db/journals/tcs/tcs393.html#Bui-XuanHP08
https://hal-lirmm.ccsd.cnrs.fr/lirmm-00132103v3
https://www.sciencedirect.com/science/article/pii/S030439750700850X
https://hal.archives-ouvertes.fr/lirmm-00132103
https://hal-lirmm.ccsd.cnrs.fr/lirmm-00324565v1
https://doi.org/10.1016/j.tcs.2007.10.048