Výsledky vyhledávání - "computational and structural complexity"
-
1
Splitting NP-Complete Sets
ISSN: 0097-5397, 1095-7111Vydáno: Philadelphia, PA Society for Industrial and Applied Mathematics 01.01.2008Vydá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
Approximation Algorithms for 3D Orthogonal Knapsack
ISSN: 1000-9000, 1860-4749Vydáno: Boston Springer US 01.09.2008Vydáno v Journal of computer science and technology (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
Extended skew partition problem
ISSN: 0012-365X, 1872-681XVydáno: Elsevier B.V 06.10.2006Vydá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
The Boolean functions computed by random Boolean formulas or how to grow the right function
ISSN: 1042-9832, 1098-2418Vydáno: Hoboken Wiley Subscription Services, Inc., A Wiley Company 01.12.2005Vydá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
On the ultimate complexity of factorials
ISSN: 0304-3975, 1879-2294Vydáno: Amsterdam Elsevier B.V 20.10.2004Vydá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
Deadlock prevention by acyclic orientations
ISSN: 0166-218X, 1872-6771Vydáno: Elsevier B.V 15.06.2003Vydá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
Why almost all satisfiable $k$-CNF formulas are easy
ISSN: 1365-8050, 1462-7264, 1365-8050Vydáno: DMTCS 01.01.2007Vydáno v Discrete mathematics and theoretical computer science (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
Nonerasing, Counting, and Majority over the Linear Time Hierarchy
ISSN: 0890-5401, 1090-2651Vydáno: San Diego, CA Elsevier Inc 01.05.2002Vydá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
Path-Constrained Relaxed Schedulability Analysis
Vydáno: IEEE 01.09.2007Vydáno v Ninth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC 2007) (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
Challenges, optimization strategies, and future horizons of advanced deep learning approaches for brain lesion segmentation
ISSN: 1046-2023, 1095-9130, 1095-9130Vydáno: United States Elsevier Inc 01.07.2025Vydá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
Mutual Information Neural-Estimation-Driven Constellation Shaping Design and Performance Analysis
ISSN: 1099-4300, 1099-4300Vydáno: Switzerland MDPI AG 21.04.2025Vydá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
Robust disturbance rejection control of grid-connected fuel cell converters with grid support ability under unbalanced faults
ISSN: 1868-3967, 1868-3975Vydáno: Berlin/Heidelberg Springer Berlin Heidelberg 01.08.2020Vydá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
Robust Distributed Formation Control for Heterogeneous UAVs-UGVs Systems: An Adaptive Asymptotic Funnel Control Approach
ISSN: 0018-9545, 1939-9359Vydáno: New York IEEE 01.10.2025Vydáno v IEEE transactions on vehicular technology (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
Design of a Maximally Permissive Liveness-enforcing Supervisor with Reduced Complexity for Automated Manufacturing Systems
ISSN: 1561-8625, 1934-6093Vydáno: Hoboken Blackwell Publishing Ltd 01.01.2015Vydá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
Multi-chromosomal CGP-evolved RNN for signal reconstruction
ISSN: 0941-0643, 1433-3058Vydáno: London Springer London 01.10.2021Vydá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
Complexity reduction in enforcing disjunctive generalized mutual exclusion constraints
ISSN: 0924-6703, 1573-7594Vydáno: New York Springer US 01.09.2025Vydá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
Simplification of a complex signal transduction model using invariants and flow equivalent servers
ISSN: 0304-3975, 1879-2294Vydáno: Oxford Elsevier B.V 07.10.2011Vydá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
Extraction of elementary siphons in a class of generalized Petri nets using graph theory
ISSN: 0264-4401, 1758-7077Vydáno: Bradford Emerald Group Publishing Limited 01.01.2014Vydá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
Global Supervisory Structure for Decentralized Systems of Flexible Manufacturing Systems Using Petri Nets
ISSN: 2227-9717, 2227-9717Vydáno: Basel MDPI AG 01.09.2019Vydá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
Audio signal processing by neural networks
ISSN: 0925-2312, 1872-8286Vydáno: Elsevier B.V 01.10.2003Vydá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