Výsledky vyhledávání - "computational and structural complexity"

  1. 1

    Splitting NP-Complete Sets Autor Glaßer, Christian, Pavan, A., Selman, Alan L., Zhang, Liyu

    ISSN: 0097-5397, 1095-7111
    Vydáno: Philadelphia, PA Society for Industrial and Applied Mathematics 01.01.2008
    Vydáno v SIAM journal on computing (01.01.2008)
    “…We show that a set is m-autoreducible if and only if it is m-mitotic. This solves a long-standing open question in a surprising way. As a consequence of this…”
    Získat plný text
    Journal Article
  2. 2

    Approximation Algorithms for 3D Orthogonal Knapsack Autor Diedrich, Florian, Harren, Rolf, Jansen, Klaus, Thöle, Ralf, Thomas, Henning

    ISSN: 1000-9000, 1860-4749
    Vydáno: Boston Springer US 01.09.2008
    “…We study non-overlapping axis-parallel packings of 3D boxes with profits into a dedicated bigger box where rotation is either forbidden or permitted, and we…”
    Získat plný text
    Journal Article
  3. 3

    Extended skew partition problem Autor Dantas, Simone, de Figueiredo, Celina M.H., Gravier, Sylvain, Klein, Sulamita

    ISSN: 0012-365X, 1872-681X
    Vydáno: Elsevier B.V 06.10.2006
    Vydáno v Discrete mathematics (06.10.2006)
    “…A skew partition as defined by Chvátal is a partition of the vertex set of a graph into four nonempty parts A 1 , A 2 , B 1 , B 2 such that there are all…”
    Získat plný text
    Journal Article
  4. 4

    The Boolean functions computed by random Boolean formulas or how to grow the right function Autor Brodsky, Alex, Pippenger, Nicholas

    ISSN: 1042-9832, 1098-2418
    Vydáno: Hoboken Wiley Subscription Services, Inc., A Wiley Company 01.12.2005
    Vydáno v Random structures & algorithms (01.12.2005)
    “…We characterize growth processes (probabilistic amplification) by their initial conditions to derive conditions under which results such as Valiant's J…”
    Získat plný text
    Journal Article
  5. 5

    On the ultimate complexity of factorials Autor Cheng, Qi

    ISSN: 0304-3975, 1879-2294
    Vydáno: Amsterdam Elsevier B.V 20.10.2004
    Vydáno v Theoretical computer science (20.10.2004)
    “…It has long been observed that certain factorization algorithms provide a way to write the product of many different integers succinctly. In this paper, we…”
    Získat plný text
    Journal Article
  6. 6

    Deadlock prevention by acyclic orientations Autor Bermond, Jean-Claude, Ianni, Miriam Di, Flammini, Michele, Pérennès, Stéphane

    ISSN: 0166-218X, 1872-6771
    Vydáno: Elsevier B.V 15.06.2003
    Vydáno v Discrete Applied Mathematics (15.06.2003)
    “…Deadlock prevention for routing messages has a central role in communication networks, since it directly influences the correctness of parallel and distributed…”
    Získat plný text
    Journal Article
  7. 7

    Why almost all satisfiable $k$-CNF formulas are easy Autor Coja-Oghlan, Amin, Krivelevich, Michael, Vilenchik, Dan

    ISSN: 1365-8050, 1462-7264, 1365-8050
    Vydáno: DMTCS 01.01.2007
    “…Finding a satisfying assignment for a $k$-CNF formula $(k \geq 3)$, assuming such exists, is a notoriously hard problem. In this work we consider the uniform…”
    Získat plný text
    Journal Article Konferenční příspěvek
  8. 8

    Nonerasing, Counting, and Majority over the Linear Time Hierarchy Autor Durand, Arnaud, More, Malika

    ISSN: 0890-5401, 1090-2651
    Vydáno: San Diego, CA Elsevier Inc 01.05.2002
    Vydáno v Information and computation (01.05.2002)
    “…In this paper, we investigate several extensions of the linear time hierarchy (denoted by LTH). We first prove that it is not necessary to erase the oracle…”
    Získat plný text
    Journal Article
  9. 9

    Path-Constrained Relaxed Schedulability Analysis Autor Andrei, S., Chakraborty, S.

    Vydáno: IEEE 01.09.2007
    “…The schedulability analysis problem for many realistic task models is known to be hard (NP or coNP). As this severely restricts the application of these task…”
    Získat plný text
    Konferenční příspěvek
  10. 10

    Challenges, optimization strategies, and future horizons of advanced deep learning approaches for brain lesion segmentation Autor Zaman, Asim, Yassin, Mazen M., Mehmud, Irfan, Cao, Anbo, Lu, Jiaxi, Hassan, Haseeb, Kang, Yan

    ISSN: 1046-2023, 1095-9130, 1095-9130
    Vydáno: United States Elsevier Inc 01.07.2025
    Vydáno v Methods (San Diego, Calif.) (01.07.2025)
    “…•Comprehensive overview of deep learning advances for brain tumor and stroke segmentation (2021–2024).•Techniques addressing class imbalance and multi-modality…”
    Získat plný text
    Journal Article
  11. 11

    Mutual Information Neural-Estimation-Driven Constellation Shaping Design and Performance Analysis Autor Ji, Xiuli, Wang, Qian, Qian, Liping, Kam, Pooi-Yuen

    ISSN: 1099-4300, 1099-4300
    Vydáno: Switzerland MDPI AG 21.04.2025
    Vydáno v Entropy (Basel, Switzerland) (21.04.2025)
    “…The choice of constellations largely affects the performance of both wireless and optical communications. To address increasing capacity requirements,…”
    Získat plný text
    Journal Article
  12. 12

    Robust disturbance rejection control of grid-connected fuel cell converters with grid support ability under unbalanced faults Autor Sabir, Adeel, Ibrir, Salim

    ISSN: 1868-3967, 1868-3975
    Vydáno: Berlin/Heidelberg Springer Berlin Heidelberg 01.08.2020
    Vydáno v Energy systems (Berlin. Periodical) (01.08.2020)
    “…This work proposes a high-performance, robust and low-complexity control strategy for grid-connected fuel cell converters that operate under several…”
    Získat plný text
    Journal Article
  13. 13

    Robust Distributed Formation Control for Heterogeneous UAVs-UGVs Systems: An Adaptive Asymptotic Funnel Control Approach Autor Yan, Yancheng, Liang, Hongjing, Cheng, Yuhua, Li, Tieshan

    ISSN: 0018-9545, 1939-9359
    Vydáno: New York IEEE 01.10.2025
    “…This paper is concerned with the distributed formation control problem of heterogeneous uncrewed aerial vehicles-uncrewed ground vehicles (UAVs-UGVs) systems,…”
    Získat plný text
    Journal Article
  14. 14

    Design of a Maximally Permissive Liveness-enforcing Supervisor with Reduced Complexity for Automated Manufacturing Systems Autor Wang, ShouGuang, Zhou, MengChu, Wu, WenHui

    ISSN: 1561-8625, 1934-6093
    Vydáno: Hoboken Blackwell Publishing Ltd 01.01.2015
    Vydáno v Asian journal of control (01.01.2015)
    “…This paper deals with the problems of computational and structural complexity in designing maximally permissive liveness…”
    Získat plný text
    Journal Article
  15. 15

    Multi-chromosomal CGP-evolved RNN for signal reconstruction Autor Khan, Nadia Masood, Khan, Gul Muhammad

    ISSN: 0941-0643, 1433-3058
    Vydáno: London Springer London 01.10.2021
    Vydáno v Neural computing & applications (01.10.2021)
    “… of computational and structural complexity, and accurate reconstruction of the corrupted signal. Signal reconstruction modelling is done through prediction of missing samples…”
    Získat plný text
    Journal Article
  16. 16

    Complexity reduction in enforcing disjunctive generalized mutual exclusion constraints Autor Abdous, Farzad, Dideban, Abbas

    ISSN: 0924-6703, 1573-7594
    Vydáno: New York Springer US 01.09.2025
    Vydáno v Discrete event dynamic systems (01.09.2025)
    “…This paper deals with the complex problem of designing an optimal supervisor in safe Petri nets (PNs). Reducing the structural complexity of the supervisory…”
    Získat plný text
    Journal Article
  17. 17

    Simplification of a complex signal transduction model using invariants and flow equivalent servers Autor Cordero, Francesca, Horváth, András, Manini, Daniele, Napione, Lucia, De Pierro, Massimiliano, Pavan, Simona, Picco, Andrea, Veglio, Andrea, Sereno, Matteo, Bussolino, Federico, Balbo, Gianfranco

    ISSN: 0304-3975, 1879-2294
    Vydáno: Oxford Elsevier B.V 07.10.2011
    Vydáno v Theoretical computer science (07.10.2011)
    “… To overcome these problems, we suggest approaches to simplify the detailed representation that result in models with a lower computational and structural complexity, while still capturing the overall…”
    Získat plný text
    Journal Article
  18. 18

    Extraction of elementary siphons in a class of generalized Petri nets using graph theory Autor Hou, YiFan, Li, ZhiWu, Zhao, Mi, Liu, Ding

    ISSN: 0264-4401, 1758-7077
    Vydáno: Bradford Emerald Group Publishing Limited 01.01.2014
    Vydáno v Engineering computations (01.01.2014)
    “…Purpose – Siphon-based deadlock control in a flexible manufacturing system (FMS) suffers from the problems of computational and structural complexity…”
    Získat plný text
    Journal Article
  19. 19

    Global Supervisory Structure for Decentralized Systems of Flexible Manufacturing Systems Using Petri Nets Autor Bashir, Muhammad, Hong, Liang

    ISSN: 2227-9717, 2227-9717
    Vydáno: Basel MDPI AG 01.09.2019
    Vydáno v Processes (01.09.2019)
    “…Decentralized supervisory structure has drawn much attention in recent years to address the computational complexity in designing supervisory structures for…”
    Získat plný text
    Journal Article
  20. 20

    Audio signal processing by neural networks Autor Uncini, Aurelio

    ISSN: 0925-2312, 1872-8286
    Vydáno: Elsevier B.V 01.10.2003
    Vydáno v Neurocomputing (Amsterdam) (01.10.2003)
    “… The computational and structural complexity of neural networks (NNs) represent in fact, the main drawbacks that can hinder many practical NNs multimedia applications…”
    Získat plný text
    Journal Article