Search Results - "Dynamic programming algorithms"
-
1
Authors:
Contributors:
Subject Terms: Lower Bounds, I/O complexity, ddc:004, Dynamic Programming Algorithms, Recomputation, Cocke-Younger-Kasami
File Description: application/pdf
-
2
Authors: et al.
Contributors: et al.
Source: https://inria.hal.science/hal-05000632 ; RR-9582, Inria. 2025.
Subject Terms: Job Scheduling, Variable Number of Processors, Variable Capacity Scheduling, Goodput, Yield, Dynamic Programming Algorithms, [INFO]Computer Science [cs]
-
3
Authors: et al.
Contributors: et al.
Source: Proceedings-2021 IEEE 62nd Annual Symposium on Foundations of Computer Science, FOCS 2021
2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS)Subject Terms: 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
File Description: application/pdf
Access URL: 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 -
4
Authors: et al.
Contributors: et al.
Source: Journal of Scheduling. 24:663-680
Subject Terms: 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
File Description: application/pdf
Access URL: 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 -
5
Authors: et al.
Contributors: et al.
Source: ACM Journal of Experimental Algorithmics. 24:1-41
Subject Terms: 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
Access URL: 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 -
6
Authors: et al.
Contributors: et al.
Source: 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 DesarrolloSubject Terms: [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
File Description: application/pdf
Access URL: 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 -
7
Authors:
Source: Operations Research Letters. 21:69-76
Subject Terms: 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
File Description: application/xml
-
8
Authors: et al.
Contributors: et al.
Source: Annals of Operations Research. 69:1-31
Subject Terms: 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
File Description: application/xml; STAMPA
Access URL: 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 -
9
Authors: et al.
Contributors: et al.
Source: https://inria.hal.science/hal-01514872 ; [Research Report] RR-9063, INRIA Sophia Antipolis - Méditerranée; Universite Cote d'Azur. 2017, pp.1-45.
Subject Terms: comparison of clusterings, Clustering stability, NP-completeness, graph decomposition, dynamic programming algorithms, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]
-
10
Authors: et al.
Subject Terms: 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
-
11
Authors: et al.
Subject Terms: b-Coloring, Stability number two, Co-triangle-free graphs, NP-hardness, Treecographs, Polytime dynamic programming algorithms
File Description: application/pdf
Relation: Algorithmica Volumen: 73 Número: 2 oct 2015; https://repositorio.uchile.cl/handle/2250/135495
-
12
Authors: Prakash Ramanan
Source: SIAM Journal on Computing. 25:874-893
Subject Terms: 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
File Description: application/xml
Access URL: 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 -
13
Authors:
Source: Computers & Mathematics with Applications. 27:121-127
Subject Terms: 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
File Description: application/xml
-
14
Authors: et al.
Contributors: et al.
Source: https://inria.hal.science/hal-01410396 ; [Research Report] RR-8992, Inria Sophia Antipolis; Université Côte d'Azur. 2016, pp.51.
Subject Terms: 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]
-
15
Authors:
Source: 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:3Subject Terms: 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
File Description: application/pdf
-
16
Authors: et al.
Subject Terms: 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
-
17
Authors:
Contributors:
Subject Terms: 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
File Description: application/pdf
Access URL: https://inria.hal.science/hal-01410396v1
-
18
Authors: et al.
Contributors: et al.
Source: https://inria.hal.science/inria-00524691 ; 2010.
Subject Terms: 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]
-
19
Authors: F. Frances Yao
Source: SIAM Journal on Algebraic Discrete Methods. 3:532-540
Subject Terms: 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
File Description: application/xml
-
20
Authors: Wojciech Rytter
Source: Theoretical Computer Science. 59:297-307
Subject Terms: 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)
File Description: application/xml
Nájsť tento článok vo Web of Science 
Full Text Finder