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

Upresniť hľadanie
  1. 1

    An output-polynomial time algorithm to determine all supported efficient solutions for multi-objective integer network flow problems Autor Könen, David, Stiglmayr, Michael

    ISSN: 0166-218X
    Vydavateľské údaje: Elsevier B.V 15.12.2025
    Vydané v Discrete Applied Mathematics (15.12.2025)
    “…). It derives an output-polynomial time algorithm to determine all supported efficient solutions for MOIMCF problems…”
    Získať plný text
    Journal Article
  2. 2

    An iterative algorithm for simulation error based identification of polynomial input-output models using multi-step prediction Autor Farina, Marcello, Piroddi, Luigi

    ISSN: 0020-7179, 1366-5820
    Vydavateľské údaje: Abingdon Taylor & Francis Group 01.07.2010
    Vydané v International journal of control (01.07.2010)
    “…Effective identification of polynomial input-output models for applications requiring long-range prediction or simulation performance relies on both careful model selection and accurate parameter estimation…”
    Získať plný text
    Journal Article
  3. 3

    Estimation of Solar PV Plant output using Polynomial Regression and ANN Algorithm Autor Kulkarni, Rohan, Kakade, Suhas, Mawande, Shamli, Sadakale, Ranjit

    ISSN: 1742-6588, 1742-6596
    Vydavateľské údaje: Bristol IOP Publishing 01.09.2023
    Vydané v Journal of physics. Conference series (01.09.2023)
    “…) algorithms for estimating the output of a Solar Photovoltaic (PV) Plant. The study compares the performance of these two methods, using a dataset of weather parameters and PV Plant output…”
    Získať plný text
    Journal Article
  4. 4

    Enumerating minimal dominating sets in chordal bipartite graphs Autor Golovach, Petr A., Heggernes, Pinar, Kanté, Mamadou M., Kratsch, Dieter, Villanger, Yngve

    ISSN: 0166-218X, 1872-6771
    Vydavateľské údaje: Elsevier B.V 30.01.2016
    Vydané v Discrete Applied Mathematics (30.01.2016)
    “…We show that all minimal dominating sets of a chordal bipartite graph can be generated in incremental polynomial, hence output polynomial, time…”
    Získať plný text
    Journal Article
  5. 5

    Computational aspects of monotone dualization: A brief survey Autor Eiter, Thomas, Makino, Kazuhisa, Gottlob, Georg

    ISSN: 0166-218X, 1872-6771
    Vydavateľské údaje: Lausanne Elsevier B.V 06.06.2008
    Vydané v Discrete Applied Mathematics (06.06.2008)
    “… [On the complexity of dualization of monotone disjunctive normal forms, J. Algorithms 21 (1996) 618–628], which showed that the problem is solvable in quasi-polynomial time…”
    Získať plný text
    Journal Article
  6. 6

    On the Enumeration of Minimal Dominating Sets and Related Notions Autor Kanté, Mamadou Moustapha, Limouzy, Vincent, Mary, Arnaud, Nourine, Lhouari

    ISSN: 0895-4801, 1095-7146
    Vydavateľské údaje: Society for Industrial and Applied Mathematics 01.01.2014
    Vydané v SIAM journal on discrete mathematics (01.01.2014)
    “… As a consequence there exists an output-polynomial time algorithm for the Trans-Enum problem if and only…”
    Získať plný text
    Journal Article
  7. 7

    An output-polynomial time algorithm to determine all supported efficient solutions for multi-objective integer network flow problems Autor Könen, David, Stiglmayr, Michael

    ISSN: 2331-8422
    Vydavateľské údaje: Ithaca Cornell University Library, arXiv.org 17.10.2024
    Vydané v arXiv.org (17.10.2024)
    “…This paper addresses the problem of enumerating all supported efficient solutions for a linear multi-objective integer minimum cost flow problem (MOIMCF)…”
    Získať plný text
    Paper
  8. 8

    New Results on Monotone Dualization and Generating Hypergraph Transversals Autor Eiter, Thomas, Gottlob, Georg, Makino, Kazuhisa

    ISSN: 0097-5397, 1095-7111
    Vydavateľské údaje: Philadelphia, PA Society for Industrial and Applied Mathematics 01.01.2003
    Vydané v SIAM journal on computing (01.01.2003)
    “…) whose associated decision problem is a prominent open problem in NP-completeness. We present a number of new polynomial time, respectively, output-polynomial time…”
    Získať plný text
    Journal Article
  9. 9

    Decentralized output feedback polynomial control of seismically excited structures using genetic algorithm Autor Cha, Young-Jin, Agrawal, Anil K.

    ISSN: 1545-2255, 1545-2263
    Vydavateľské údaje: Blackwell Publishing Ltd 01.03.2013
    “… An advanced implicit redundant representation genetic algorithm is utilized to determine optimal coefficients of the two polynomial equations by minimizing the sum of three evaluation criteria…”
    Získať plný text
    Journal Article
  10. 10

    Output-sensitive modular algorithms for polynomial matrix normal forms Autor Cheng, Howard, Labahn, George

    ISSN: 0747-7171, 1095-855X
    Vydavateľské údaje: Elsevier Ltd 01.07.2007
    Vydané v Journal of symbolic computation (01.07.2007)
    “…We give modular algorithms to compute row-reduced forms, weak Popov forms, and Popov forms of polynomial matrices, as well as the corresponding unimodular transformation matrices…”
    Získať plný text
    Journal Article
  11. 11

    Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width Autor Golovach, Petr A., Heggernes, Pinar, Kanté, Mamadou Moustapha, Kratsch, Dieter, Sæther, Sigve H., Villanger, Yngve

    ISSN: 0178-4617, 1432-0541
    Vydavateľské údaje: New York Springer US 01.02.2018
    Vydané v Algorithmica (01.02.2018)
    “… In this paper we study output-polynomial enumeration algorithms on graphs of bounded LMIM-width and graphs of bounded local LMIM-width…”
    Získať plný text
    Journal Article
  12. 12

    Output Selection and Observer Design for Boolean Control Networks: A Sub-Optimal Polynomial-Complexity Algorithm Autor Weiss, Eyal, Margaliot, Michael

    ISSN: 2475-1456, 2475-1456
    Vydavateľské údaje: IEEE 01.01.2019
    Vydané v IEEE control systems letters (01.01.2019)
    “… We discuss how these results can be used to provide a sub-optimal yet polynomial-complexity algorithm for the minimal observability problem in BCNs. Some of the theoretical results are demonstrated using BCN models of mammalian cell cycle control, and T-cell receptor kinetics…”
    Získať plný text
    Journal Article
  13. 13

    An approximation algorithm for a general class of parametric optimization problems Autor Bazgan, Cristina, Herzel, Arne, Ruzika, Stefan, Thielen, Clemens, Vanderpooten, Daniel

    ISSN: 1382-6905, 1573-2886
    Vydavateľské údaje: New York Springer US 01.07.2022
    Vydané v Journal of combinatorial optimization (01.07.2022)
    “…). This implies that any optimal algorithm for such a problem must output a super-polynomial number of solutions…”
    Získať plný text
    Journal Article
  14. 14

    Implicitisation and Parameterisation in Polynomial Functors Autor Blatter, Andreas, Draisma, Jan, Ventura, Emanuele

    ISSN: 1615-3375, 1615-3383
    Vydavateľské údaje: New York Springer US 01.10.2024
    “… In this paper, we show that both results can be made algorithmic: there exists an algorithm implicitise that takes as input a morphism into a polynomial functor and outputs finitely many equations defining the closure of the image…”
    Získať plný text
    Journal Article
  15. 15
  16. 16

    Preprocessing for Outerplanar Vertex Deletion: An Elementary Kernel of Quartic Size Autor Donkers, Huib, Jansen, Bart M. P., Włodarczyk, Michał

    ISSN: 0178-4617, 1432-0541
    Vydavateľské údaje: New York Springer US 01.11.2022
    Vydané v Algorithmica (01.11.2022)
    “…, that is, there is a polynomial-time algorithm that outputs an equivalent instance of size k O ( 1 ) [Fomin, Lokshtanov, Misra, Saurabh…”
    Získať plný text
    Journal Article
  17. 17

    On the hardness of inclusion-wise minimal separators enumeration Autor Brosse, Caroline, Defrain, Oscar, Kurita, Kazuhiro, Limouzy, Vincent, Uno, Takeaki, Wasa, Kunihiro

    ISSN: 0020-0190, 1872-6119
    Vydavateľské údaje: Elsevier B.V 01.03.2024
    Vydané v Information processing letters (01.03.2024)
    “…Enumeration problems are often encountered as key subroutines in the exact computation of graph parameters such as chromatic number, treewidth, or treedepth…”
    Získať plný text
    Journal Article
  18. 18

    High-Speed Variable Polynomial Toeplitz Hash Algorithm Based on FPGA Autor Huang, Si-Cheng, Huang, Shan, Yin, Hua-Lei, Ma, Qing-Li, Yin, Ze-Jie

    ISSN: 1099-4300, 1099-4300
    Vydavateľské údaje: Switzerland MDPI AG 11.04.2023
    Vydané v Entropy (Basel, Switzerland) (11.04.2023)
    “… The Secure Hash Algorithm (SHA), which functions as a cryptographic hash function, is a key technology in digital authentication…”
    Získať plný text
    Journal Article
  19. 19

    An inner approximation method to compute the weight set decomposition of a triobjective mixed-integer problem Autor Halffmann, Pascal, Dietz, Tobias, Przybylski, Anthony, Ruzika, Stefan

    ISSN: 1573-2916, 0925-5001, 1573-2916
    Vydavateľské údaje: New York, NY Springer US 01.08.2020
    Vydané v Journal of global optimization (01.08.2020)
    “… The resulting algorithm runs in output polynomial time, i.e. its running time is polynomial in the encoding length of both the input and output…”
    Získať plný text
    Journal Article
  20. 20

    Input–Output-Improved Reservoir Computing Based on Duffing Resonator Processing Dynamic Temperature Compensation for MEMS Resonant Accelerometer Autor Guo, Xiaowei, Yang, Wuhao, Zheng, Tianyi, Sun, Jie, Xiong, Xingyin, Wang, Zheng, Zou, Xudong

    ISSN: 2072-666X, 2072-666X
    Vydavateľské údaje: Switzerland MDPI AG 08.01.2023
    Vydané v Micromachines (Basel) (08.01.2023)
    “… input–output-improved reservoir computing (IOI-RC) algorithm. It combines the polynomial fitting with the RC on the input data mapping ensuring…”
    Získať plný text
    Journal Article