Výsledky vyhledávání - "Dynamic Programming Algorithms"

On the I/O Complexity of the Cocke-Younger-Kasami Algorithm and of a Family of Related Dynamic Programming Algorithms

Autoři: De Stefani, Lorenzo Gupta, Vedant Lorenzo De Stefani and Vedant Gupta

Přispěvatelé: De Stefani, Lorenzo Gupta, Vedant Lorenzo De Stefani and Vedant Gupta

Témata: Lower Bounds, I/O complexity, ddc:004, Dynamic Programming Algorithms, Recomputation, Cocke-Younger-Kasami

Popis souboru: application/pdf

Přístupová URL adresa: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.WADS.2025.49

Scheduling Jobs Under a Variable Number of Processors ; Ordonnancement de tâches avec un nombre variable de processeurs

Autoři: Benoit, Anne Cendrier, Joachim Vivien, Frédéric a další

Přispěvatelé: Benoit, Anne Cendrier, Joachim Vivien, Frédéric a další

Zdroj: https://inria.hal.science/hal-05000632 ; RR-9582, Inria. 2025.

Témata: Job Scheduling, Variable Number of Processors, Variable Capacity Scheduling, Goodput, Yield, Dynamic Programming Algorithms, [INFO]Computer Science [cs]

Dostupnost: https://inria.hal.science/hal-05000632
https://inria.hal.science/hal-05000632v2/document
https://inria.hal.science/hal-05000632v2/file/RR-9582.pdf

Parameterized Problems Complete for Nondeterministic FPT time and Logarithmic Space

Autoři: Hans L. Bodlaender Carla Groenland Jesper Nederlof a další

Přispěvatelé: Hans L. Bodlaender Carla Groenland Jesper Nederlof a další

Zdroj: Proceedings-2021 IEEE 62nd Annual Symposium on Foundations of Computer Science, FOCS 2021
2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS)

Témata: FOS: Computer and information sciences, Dynamic-programming algorithms, General Computer Science, Whierarchy, Tractability, 0211 other engineering and technologies, Pathwidth, 0102 computer and information sciences, 02 engineering and technology, Computational Complexity (cs.CC), 01 natural sciences, Bandwidth minimization, Parameterized complexity, Computer Science - Computational Complexity, Bandwidth, Taverne, XNLP, Graphs

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/pdf/2105.14882
http://arxiv.org/abs/2105.14882
https://research-portal.uu.nl/en/publications/90a4ffbd-27aa-4b41-a8a8-f3ac8fe9dd99
https://doi.org/10.1016/j.ic.2024.105195
https://research-portal.uu.nl/en/publications/dbdb6578-acb0-42e7-9a26-b6e17e01ef2a
https://doi.org/10.1109/FOCS52979.2021.00027
https://dspace.library.uu.nl/handle/1874/420485

Optimally rescheduling jobs with a Last-In-First-Out buffer

Autoři: Gaia Nicosia Andrea Pacifici Ulrich Pferschy a další

Přispěvatelé: Gaia Nicosia Andrea Pacifici Ulrich Pferschy a další

Zdroj: Journal of Scheduling. 24:663-680

Témata: 0209 industrial biotechnology, Settore MAT/09 - RICERCA OPERATIVA, Dynamic programming algorithm, Scheduling, Complexity, Dynamic programming algorithms, Rescheduling, Sequence coordination, Supply chain sustainability, 0211 other engineering and technologies, 02 engineering and technology, Settore MATH-06/A - Ricerca operativa, Settore IINF-05/A - Sistemi di elaborazione delle informazioni

Popis souboru: application/pdf

Přístupová URL adresa: https://link.springer.com/content/pdf/10.1007/s10951-021-00707-5.pdf
https://dblp.uni-trier.de/db/journals/scheduling/scheduling24.html#NicosiaPPRR21
https://link.springer.com/article/10.1007%2Fs10951-021-00707-5
https://link.springer.com/content/pdf/10.1007/s10951-021-00707-5.pdf
https://hdl.handle.net/2434/870216
https://doi.org/10.1007/s10951-021-00707-5
https://hdl.handle.net/2108/304211
https://doi.org/10.1007/s10951-021-00707-5

Comparing Two Clusterings Using Matchings between Clusters of Clusters

Autoři: Cazals, Frédéric Mazauric, Dorian Tetley, Romain a další

Přispěvatelé: Cazals, Frédéric Mazauric, Dorian Tetley, Romain a další

Zdroj: ACM Journal of Experimental Algorithmics. 24:1-41

Témata: NP-complétude, [INFO.INFO-CG] Computer Science [cs]/Computational Geometry [cs.CG], Stabilité du clustering, Clustering stability, Comparison of clusterings, Graph decomposition, Dynamic programming algorithms, Décompositions de graphes, Comparaison de clusterings, 0102 computer and information sciences, 01 natural sciences, NP-completeness, Programmation dynamique

Přístupová URL adresa: https://hal.inria.fr/hal-01514872/file/RR-9063-family-matching.pdf
https://inria.hal.science/hal-02425599v1
https://doi.org/10.1145/3345951
https://dblp.uni-trier.de/db/journals/jea/jea24.html#CazalsMTW19
https://hal-lara.archives-ouvertes.fr/hal-01514872v2
https://hal.inria.fr/hal-01514872/document
https://hal.archives-ouvertes.fr/hal-01514872v1
https://hal.inria.fr/hal-01514872v1
https://dl.acm.org/doi/abs/10.1145/3345951

b-Coloring is NP-Hard on Co-Bipartite Graphs and Polytime Solvable on Tree-Cographs

Autoři: Bonomo, Flavia Schaudt, Oliver Stein, Maya a další

Přispěvatelé: Bonomo, Flavia Schaudt, Oliver Stein, Maya a další

Zdroj: Lecture Notes in Computer Science ISBN: 9783319091730
Conicyt_qa
ANID
instacron:ANID
Algorithmica
Artículos CONICYT
CONICYT Chile
instacron:CONICYT
CONICET Digital (CONICET)
Consejo Nacional de Investigaciones Científicas y Técnicas
Articulos_ANID
Agencia Nacional de Investigación y Desarrollo

Témata: [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], FOS: Computer and information sciences, Discrete Mathematics (cs.DM), 0211 other engineering and technologies, [MATH] Mathematics [math], 0102 computer and information sciences, 02 engineering and technology, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [INFO] Computer Science [cs], Computational Complexity (cs.CC), Co-triangle-free graphs, 01 natural sciences, 7. Clean energy, Stability number two, Treecographs, Minimum Maxinal Matching, [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO], NP-hardness, FOS: Mathematics, Mathematics - Combinatorics, [INFO]Computer Science [cs], Polytime dynamic programming algorithms, [MATH]Mathematics [math], B-Coloring, Co-Bipartite Graphs, b-Coloring, 16. Peace & justice, Computer Science - Computational Complexity, Graphs with Stability Number Two, 13. Climate action, Combinatorics (math.CO), Computer Science - Discrete Mathematics

Popis souboru: application/pdf

Přístupová URL adresa: https://ri.conicet.gov.ar/bitstream/11336/18897/1/CONICET_Digital_Nro.22766.pdf
http://arxiv.org/abs/1310.8313
https://hal.science/hal-01102516v1
https://hal.science/hal-01102516v1/document
https://doi.org/10.1007/s00453-014-9921-5
https://dblp.uni-trier.de/db/journals/corr/corr1310.html#BonomoSSV13
https://hal.inria.fr/hal-00926924
https://lipn.univ-paris13.fr/~valenciapabon/papers/b-col-cobip.pdf
https://link.springer.com/content/pdf/10.1007%2Fs00453-014-9921-5.pdf
https://arxiv.org/pdf/1310.8313
https://hal.archives-ouvertes.fr/hal-01102516/document
https://128.84.21.199/abs/1310.8313?context=math.CO
https://arxiv.org/abs/1310.8313
https://arxiv.org/pdf/1310.8313
https://repositorio-qa.anid.cl/handle/10533/147921
http://hdl.handle.net/10533/147921
http://hdl.handle.net/11336/18897
https://hdl.handle.net/10533/147921

Single machine scheduling with discretely controllable processing times

Autoři: Zhi-Long Chen Qing Lu Guochun Tang

Zdroj: Operations Research Letters. 21:69-76

Témata: total completion time, controllable processing times, Deterministic scheduling theory in operations research, single machine, maximum tardiness, 0211 other engineering and technologies, makespan, 02 engineering and technology, Abstract computational complexity for mathematical programming problems, Dynamic programming, sum of the total processing cost, pseudo-polynomial dynamic programming algorithms

Popis souboru: application/xml

Přístupová URL adresa: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.158.7806
https://dblp.uni-trier.de/db/journals/orl/orl21.html#ChenLT97
https://www.sciencedirect.com/science/article/pii/S0167637797000102

Concurrent operations assignment and sequencing for particular assembly problems in flow lines

Autoři: AGNETIS A. ARBIB, CLAUDIO Agnetis, Alessandro a další

Přispěvatelé: AGNETIS A. ARBIB, CLAUDIO Agnetis, Alessandro a další

Zdroj: Annals of Operations Research. 69:1-31

Témata: polynomial-time dynamic programming algorithms, Deterministic scheduling theory in operations research, flow shop scheduling, dynamic programming, makespan, sequencing, assigning, Abstract computational complexity for mathematical programming problems, flow line, precedence constraints

Popis souboru: application/xml; STAMPA

Přístupová URL adresa: https://econpapers.repec.org/article/sprannopr/v_3a69_3ay_3a1997_3ai_3a0_3ap_3a1-31_3a10.1023_2fa_3a1018916608787.htm
https://usiena-air.unisi.it/handle/11365/29446
https://link.springer.com/article/10.1023/A:1018916608787
https://dblp.uni-trier.de/db/journals/anor/anor69.html#AgnetisA97
https://ideas.repec.org/a/spr/annopr/v69y1997i0p1-3110.1023-a1018916608787.html
https://hdl.handle.net/11697/23406
https://doi.org/10.1023/A:1018916608787
http://link.springer.com/article/10.1023/A:1018916608787

Comparing two clusterings using matchings between clusters of clusters

Autoři: Cazals, Frédéric Mazauric, Dorian Tetley, Romain a další

Přispěvatelé: Cazals, Frédéric Mazauric, Dorian Tetley, Romain a další

Zdroj: https://inria.hal.science/hal-01514872 ; [Research Report] RR-9063, INRIA Sophia Antipolis - Méditerranée; Universite Cote d'Azur. 2017, pp.1-45.

Témata: comparison of clusterings, Clustering stability, NP-completeness, graph decomposition, dynamic programming algorithms, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]

Dostupnost: https://inria.hal.science/hal-01514872
https://inria.hal.science/hal-01514872v4/document
https://inria.hal.science/hal-01514872v4/file/RR-9063-family-matching.pdf

Genome-wide Association Analysis Reveals Loci Associated With Resistance Against Piscirickettsia Salmonis In Two Atlantic Salmon (salmo Salar L.) ChRomosomes ; Bmc Genomics

Autoři: Correa, K. Lhorente, JP Lopez, ME a další

Témata: Ciencias Biológicas, Computer Science, Software Engineering, Mathematics, Applied, resistance, salmon, were, salmonis, atlantic, genetic, genome, Ciencias Naturales, B-coloring, Stability Number Two, Co-triangle-free Graphs, Np-hardness, Treecographs, Polytime Dynamic Programming Algorithms

Relation: instname: ANID; reponame: Repositorio Digital RI2.0; https://doi.org/10.1186/s12864-015-2038-7; PFB03; WOS:000360668100003; https://hdl.handle.net/10533/87816

Dostupnost: https://hdl.handle.net/10533/87816
https://doi.org/10.1186/s12864-015-2038-7

b-Coloring is NP-hard on Co-bipartite Graphs and Polytime Solvable on Tree-Cographs

Autoři: Bonomo, Flavia Schaudt, Oliver Stein, Maya a další

Témata: b-Coloring, Stability number two, Co-triangle-free graphs, NP-hardness, Treecographs, Polytime dynamic programming algorithms

Popis souboru: application/pdf

Relation: Algorithmica Volumen: 73 Número: 2 oct 2015; https://repositorio.uchile.cl/handle/2250/135495

Dostupnost: https://doi.org/10.1007/s00453-014-9921-5
https://repositorio.uchile.cl/handle/2250/135495

An Efficient Parallel Algorithm for the Matrix-Chain-Product Problem: An efficient parallel algorithm for the matrix-chain-product problem

Autoři: Prakash Ramanan

Zdroj: SIAM Journal on Computing. 25:874-893

Témata: Analysis of algorithms and problem complexity, 0202 electrical engineering, electronic engineering, information engineering, Distributed algorithms, matrix-chain product, Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.), parallel random-access machine, 0102 computer and information sciences, 02 engineering and technology, Parallel algorithms in computer science, dynamic-programming algorithms, 01 natural sciences

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/936220
https://doi.org/10.1137/0225039
https://epubs.siam.org/doi/abs/10.1137/0225039
https://dblp.uni-trier.de/db/journals/siamcomp/siamcomp25.html#Ramanan96
https://doi.org/10.1137/0225039
https://dl.acm.org/doi/10.1137/0225039
https://locus.siam.org/doi/abs/10.1137/0225039

Dynamic programming, decision tables, and the Hawaii Parallel Computer: Dynamic programming, decision tables, and the Hawaii parallel computer

Autoři: R. Halverson Art Lew

Zdroj: Computers & Mathematics with Applications. 27:121-127

Témata: dynamic programming algorithms, Computational Mathematics, decision table programs, Computational Theory and Mathematics, Modelling and Simulation, 0103 physical sciences, 0202 electrical engineering, electronic engineering, information engineering, Hawaii parallel computer, Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.), concurrent algorithms, 02 engineering and technology, 01 natural sciences, Performance evaluation, queueing, and scheduling in the context of computer systems

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/590175
https://doi.org/10.1016/0898-1221(94)90130-9
https://core.ac.uk/display/81992830
https://www.sciencedirect.com/science/article/pii/0898122194901309

Clustering stability revealed by matchings between clusters of clusters ; La stabilité de clusterings révélée par des correspondances entre clusters de clusters

Autoři: Cazals, Frédéric Mazauric, Dorian Tetley, Romain a další

Přispěvatelé: Cazals, Frédéric Mazauric, Dorian Tetley, Romain a další

Zdroj: https://inria.hal.science/hal-01410396 ; [Research Report] RR-8992, Inria Sophia Antipolis; Université Côte d'Azur. 2016, pp.51.

Témata: Clustering stability, comparison of clusterings, NP-completeness, graph decomposition, dynamic programming algorithms, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], [INFO]Computer Science [cs]

Dostupnost: https://inria.hal.science/hal-01410396
https://inria.hal.science/hal-01410396v1/document
https://inria.hal.science/hal-01410396v1/file/RR-8992-partition-matching.pdf

A Perspective on the Algorithms Predicting and Evaluating the RNA Secondary Structure

Autoři: Fiscon G Iannello G Paci P

Zdroj: Journal of Genetics and Genome Research 3 (2016).
info:cnr-pdr/source/autori:Giulia Fiscon, Giulio Iannello and Paola Paci/titolo:A perspective on the algorithms predicting and evaluating the RNA secondary structure/doi:/rivista:Journal of Genetics and Genome Research/anno:2016/pagina_da:/pagina_a:/intervallo_pagine:/volume:3

Témata: 0301 basic medicine, 0303 health sciences, 03 medical and health sciences, COMPUTATIONAL AND SYSTEMS BIOLOGY, RNA secondary structures, Long non-coding RNA secondary structures, RNA structure prediction tools, Dynamic programming algorithms

Popis souboru: application/pdf

Přístupová URL adresa: http://www.cnr.it/prodotto/i/358694
https://publications.cnr.it/doc/358694
https://clinmedjournals.org/articles/jggr/journal-of-genetics-and-genome-research-jggr-3-023.php?jid=jggr
https://hdl.handle.net/20.500.14243/322642

Predicting the Minimum Free Energy RNA Secondary Structures using Harmony Search Algorithm

Autoři: Abdulqader M. Mohsen Ahamad Tajudin Khader Dhanesh Ramachandram a další

Témata: Metaheuristic algorithms, dynamic programming algorithms, harmony search optimization, RNA folding, Minimum free energy

Relation: https://zenodo.org/communities/waset/; https://zenodo.org/records/1078655; oai:zenodo.org:1078655; https://doi.org/10.5281/zenodo.1078655

Dostupnost: https://doi.org/10.5281/zenodo.1078655
https://zenodo.org/records/1078655

Clustering stability revealed by matchings between clusters of clusters

Autoři: Cazals, Frédéric Mazauric, Dorian Tetley, Romain

Přispěvatelé: Cazals, Frédéric Mazauric, Dorian Tetley, Romain

Témata: dynamic programming algorithms, comparison of clusterings, Clustering stability, [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], [INFO] Computer Science [cs], graph decomposition, NP-completeness

Popis souboru: application/pdf

Přístupová URL adresa: https://inria.hal.science/hal-01410396v1

Power-aware replica placement and update strategies in tree networks

Autoři: Benoit, Anne Renaud-Goud, Paul Robert, Yves a další

Přispěvatelé: Benoit, Anne Renaud-Goud, Paul Robert, Yves a další

Zdroj: https://inria.hal.science/inria-00524691 ; 2010.

Témata: dynamic programming algorithms, Replica placement, tree networks, power consumption, update strategies, complexity results, [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC]

Dostupnost: https://inria.hal.science/inria-00524691
https://inria.hal.science/inria-00524691v1/document
https://inria.hal.science/inria-00524691v1/file/RR-LIP-2010-29.pdf

Speed-Up in Dynamic Programming: Speed-up in dynamic programming

Autoři: F. Frances Yao

Zdroj: SIAM Journal on Algebraic Discrete Methods. 3:532-540

Témata: Numerical mathematical programming methods, Analysis of algorithms and problem complexity, 0202 electrical engineering, electronic engineering, information engineering, design of efficient dynamic programming algorithms, optimal order of multiplying a sequence of matrices, 0102 computer and information sciences, 02 engineering and technology, Dynamic programming, Direct numerical methods for linear systems and matrix inversion, Algorithms in computer science, 01 natural sciences, general speed-up technique

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/3779126
https://doi.org/10.1137/0603055

On efficient parallel computations for some dynamic programming problems

Autoři: Wojciech Rytter

Zdroj: Theoretical Computer Science. 59:297-307

Témata: generalized parsing, Analysis of algorithms and problem complexity, 0102 computer and information sciences, 02 engineering and technology, Dynamic programming, 01 natural sciences, optimal triangulation of polygons, Theoretical Computer Science, Numerical mathematical programming methods, optimal order of matrix multiplications, 0202 electrical engineering, electronic engineering, information engineering, optimal binary search tree, parallelization of some dynamic programming algorithms, Computer Science(all)

Popis souboru: application/xml

Přístupová URL adresa: https://core.ac.uk/display/82137131
https://dblp.uni-trier.de/db/journals/tcs/tcs59.html#Rytter88
https://wrap.warwick.ac.uk/60800/
https://doi.org/10.1016/0304-3975(88)90147-8
https://www.sciencedirect.com/science/article/pii/0304397588901478