Výsledky vyhľadávania - Output polynomial algorithm

An output-polynomial time algorithm to determine all supported efficient solutions for multi-objective integer network flow problems.

Autori: Könen, David Stiglmayr, Michael

Zdroj: Discrete Applied Mathematics. Dec2025, Vol. 376, p1-14. 14p.

Predmety: *MULTI-objective optimization, *ALGORITHMS, *COMPUTATIONAL complexity, *OPTIMIZATION algorithms

Non-crossing Hamiltonian Paths and Cycles in Output-Polynomial Time

Autori: Eppstein, David

Zdroj: Algorithmica. 86(9)

Predmety: Applied Mathematics, Pure Mathematics, Mathematical Sciences, Polygonalization, Non-crossing Hamiltonian path, Output-sensitive enumeration, Approximate counting, Computation Theory & Mathematics

Prístupová URL adresa: https://escholarship.org/uc/item/3zw640xf

On detectability of labeled Petri nets and finite automata

Autori: Zhang, Kuize Giua, Alessandro

Zdroj: Discrete event dynamic systems. 30(3):465-497

Predmety: Complexity, Decidability, Eventual strong detectability, Finite automaton, Labeled Petri net, Weak approximate detectability, Computability and decidability, Finite automata, Petri nets, Polynomial approximation, Detectability, Deterministic finite automata, Output sequences, Output signal, Polynomial-time, PSPACE-complete, Verification algorithms, Discrete event simulation

Popis súboru: print

Prístupová URL adresa: https://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-274247
https://doi.org/10.1007/s10626-020-00311-3

Non-Crossing Hamiltonian Paths and Cycles in Output-Polynomial Time

Autori: Eppstein, D

Predmety: Information and computing sciences

Prístupová URL adresa: https://escholarship.org/uc/item/8g54s4qn

Efficient Heuristic Algorithms for Positive 0-1 Polynomial Programming Problems

Autori: Granot, Frieda

Zdroj: Management Science, 1982 Jul 01. 28(7), 829-836.

Prístupová URL adresa: https://www.jstor.org/stable/2631266

An Exact Correspondence of Linear Problems and Randomizing Linear Algorithms

Autori: Eaves, B. Curtis Rothblum, Uriel G.

Zdroj: Mathematics of Operations Research, 2014 Aug 01. 39(3), 607-623.

Prístupová URL adresa: http://www.jstor.org/stable/24540915

Fourth- and Fifth-Order, Scaled Runge-Kutta Algorithms for Treating Dense Output

Autori: Horn, M. K.

Zdroj: SIAM Journal on Numerical Analysis, 1983 Jun 01. 20(3), 558-568.

Prístupová URL adresa: https://www.jstor.org/stable/2157271

On Efficient Algorithms for Computing Near-Best Polynomial Approximations to High-Dimensional, Hilbert-Valued Functions From Limited Samples

Autori: Ben Adcock, Simone Brugiapaglia, Nick Dexter, Sebastian Moraga

Typ zdroja: eBook.

Predmet: Characteristic functions, Approximation theory, Polynomials

Kategórie: SCIENCE / Physics / Mathematical & Computational

Implicit Computation: an Output-Polynomial Algorithm for Evaluating Straight-Line Programs

Autori: Troy A. Shahoumian Hewlett Packard Laboratories At U. C. Berkeley a ďalší

Prispievatelia: Troy A. Shahoumian Hewlett Packard Laboratories At U. C. Berkeley a ďalší

Zdroj: http://fog.hpl.external.hp.com/techreports/1999/HPL-1999-25.ps.

Predmety: Theory of Computation, Randomized Algorithms, Straight-Line

Popis súboru: application/postscript

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.29.9351

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.29.9351
http://fog.hpl.external.hp.com/techreports/1999/HPL-1999-25.ps

The GMDH Algorithm of Ivakhnenko

Autori: Farlow, Stanley J.

Zdroj: The American Statistician, 1981 Nov 01. 35(4), 210-215.

Prístupová URL adresa: https://www.jstor.org/stable/2683292

Polynomial Time Algorithms to Minimize Total Travel Time in a Two-Depot Automated Storage/Retrieval System

Autori: Gharehgozli, Amir Hossein Yu, Yugang Zhang, Xiandong a ďalší

Zdroj: Transportation Science, 2017 Feb 01. 51(1), 19-33.

Prístupová URL adresa: http://www.jstor.org/stable/44282401

Extended Target Tracking Using Polynomials With Applications to Road-Map Estimation

Autori: Lundquist, Christian Orguner, Umut Gustafsson, Fredrik

Zdroj: IVSS - SEFS SSF - MOVIII IEEE Transactions on Signal Processing. 59(1):15-26

Predmety: Automotive radar, EIV, Data association, Errors in output, Errors in variables, Extended target tracking, Parabola, Polynomial, Road map, TECHNOLOGY, Information technology, Signal processing, TEKNIKVETENSKAP, Informationsteknik, Signalbehandling, Automatic control, Reglerteknik

Popis súboru: electronic

Prístupová URL adresa: https://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-63831

Minimizing Convex Functions with Rational Minimizers.

Autori: JIANG, HAOTIAN¹ jhtdavid@cs.washington.edu

Zdroj: Journal of the ACM. Feb2023, Vol. 70 Issue 1, p1-27. 27p.

Predmety: SUBMODULAR functions, CONVEX functions, POLYNOMIAL time algorithms, RIESZ spaces, LATTICE theory, CONVEX geometry

An Incremental Algorithm for Computing n-Dimensional Concepts

Autori: Bazin, Alexandre Kahn, Giacomo Raynaud, Olivier a ďalší

Prispievatelia: Bazin, Alexandre Kahn, Giacomo Raynaud, Olivier a ďalší

Zdroj: https://hal.archives-ouvertes.fr/hal-01653717 ; 2017.

Predmety: Polyadic Concept Analysis, Incremental Algorithm, Output-polynomial Algorithm, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]

Relation: hal-01653717; https://hal.archives-ouvertes.fr/hal-01653717; https://hal.archives-ouvertes.fr/hal-01653717/document; https://hal.archives-ouvertes.fr/hal-01653717/file/NCremental.pdf

Dostupnosť: https://hal.archives-ouvertes.fr/hal-01653717
https://hal.archives-ouvertes.fr/hal-01653717/document
https://hal.archives-ouvertes.fr/hal-01653717/file/NCremental.pdf

An Output-Sensitive Algorithm for All-Pairs Shortest Paths in Directed Acyclic Graphs

Autori: Lingas, Andrzej Persson, Mia Sledneu, Dzmitry

Zdroj: CALDAM 2022 Lecture Notes in Computer Science. :140-151

Predmety: Directed graphs, Forestry, Graphic methods, Trees (mathematics), All pairs shortest paths, Directed paths, Integer parameters, Output-sensitive algorithm, Parameter T, Positive integers, Real edge weights, Shortest path problem, Single source shortest path problems, Weighted directed graph, Parameter estimation

Popis súboru: print

Prístupová URL adresa: https://urn.kb.se/resolve?urn=urn:nbn:se:mau:diva-54295

Intractability and the use of heuristics in psychological explanations

Autori: van Rooij, Iris Wright, Cory D. Wareham, Todd

Zdroj: Synthese, 2012 Jul 01. 187(2), 471-487.

Prístupová URL adresa: https://www.jstor.org/stable/41681586

Nonlinear Model Inversion-Based Output Tracking Control for Battery Fast Charging

Autori: Li, Yang Wik, Torsten Huang, Yicun a ďalší

Zdroj: Batteristyrning via adaptiv modellering och prediktiv reglering Litiumjonbatterikontroll för snabbare laddning och längre livslängd IEEE Transactions on Control Systems Technology. 32(1):225-240

Predmety: Electrolytes, Computational modeling, Electrochemical–thermal model, Optimization, Electrodes, Resistance, inversion-based control, fast charging, Lithium-ion batteries, lithium plating (LiP), lithium-ion batteries, Integrated circuit modeling

Popis súboru: electronic

Prístupová URL adresa: https://research.chalmers.se/publication/536933
https://research.chalmers.se/publication/537449
https://research.chalmers.se/publication/537449/file/537449_Fulltext.pdf

A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal Graphs

Autori: Kanté, Mamadou Moustapha Limouzy, Vincent Mary, Arnaud a ďalší

Prispievatelia: Kanté, Mamadou Moustapha Limouzy, Vincent Mary, Arnaud a ďalší

Zdroj: Lecture Notes in Computer Science ISBN: 9783662531730

Predmety: FOS: Computer and information sciences, Discrete Mathematics (cs.DM), 0211 other engineering and technologies, [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], G.2.2, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, E.1, F.0, 3. Good health, 68P05, 68R10, 05C69, 05C85, 05C30, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), Computer Science - Discrete Mathematics

Prístupová URL adresa: http://arxiv.org/pdf/1407.2036.pdf
http://arxiv.org/abs/1407.2036
https://link.springer.com/chapter/10.1007/978-3-662-53174-7_11/fulltext.html
https://rd.springer.com/chapter/10.1007/978-3-662-53174-7_11
https://doi.org/10.1007/978-3-662-53174-7_11
https://dblp.uni-trier.de/db/journals/corr/corr1407.html#KanteLMNU14a
https://hal.uca.fr/hal-02082337
https://core.ac.uk/display/104491084

A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal Graphs

Autori: Kanté, Mamadou Moustapha Limouzy, Vincent Mary, Arnaud a ďalší

Témy: Computer Science - Data Structures and Algorithms, Computer Science - Discrete Mathematics, 68P05, 68R10, 05C69, 05C85, 05C30, E.1, F.0, G.2.2, text

URL: http://arxiv.org/abs/1407.2036

Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy

Autori: Bremner, Michael J. Jozsa, Richard Shepherd, Dan J.

Zdroj: Proceedings: Mathematical, Physical and Engineering Sciences, 2011 Feb 01. 467(2126), 459-472.

Prístupová URL adresa: https://www.jstor.org/stable/41059588