Výsledky vyhľadávania - "computational complexity"

Quantum Computing Algorithms and Computational Complexity

“…This reprint is mainly concerned with quantum algorithms, their mathematics from behind and the complexity issues arising from them. It comprises seven papers:…”
Získať plný text

The Computational Complexity of ReLU Network Training Parameterized by Data Dimensionality Autor Froese, Vincent, Hertrich, Christoph, Niedermeier, Rolf

“…Understanding the computational complexity of training simple neural networks with rectified linear units (ReLUs…”
Získať plný text

Adaptive temporal compression for reduction of computational complexity in human behavior recognition Autor Huang, Haixin, Wang, Yuyao, Cai, Mingqi, Wang, Ruipeng, Wen, Feng, Hu, Xiaojie

“… convolution, which enables the extraction of spatio-temporal features. Specifically, the use of 3D convolution in human behavior recognition has been the subject of growing interest…”
Získať plný text

A robust interpolated model predictive control based on recurrent neural networks for a nonholonomic differential-drive mobile robot with quasi-LPV representation: computational complexity and conservatism Autor Hadian, Mohsen, Zhang, W. J., Etesami, Danial

“…This paper presents an improved Model Predictive Control (MPC) for path tracking of a nonholonomic mobile robot with a differential drive. Nonlinear dynamics…”
Získať plný text

Computational complexity of stochastic programming problems Autor Dyer, Martin, Stougie, Leen

“… During the last four decades a vast quantity of literature on the subject has appeared. Developments in the theory of computational complexity allow us to establish…”
Získať plný text

Computational complexity of swarm-based algorithms: a detailed analysis Autor María-Luisa Pérez-Delgado, Jesús-Ángel Román-Gallego

“… are. On the other hand, the literature on swarm-based algorithms does not usually include the analysis of computational complexity of the algorithms…”
Získať plný text

On the computational complexity of the patrol boat scheduling problem with complete coverage Autor Surendonk, Timothy J., Chircop, Paul A.

“…Our study is primarily concerned with analyzing the computational complexity of the patrol boat scheduling problem with complete coverage (PBSPCC…”
Získať plný text

Computational complexity of heat exchanger network synthesis Autor Furman, Kevin C., Sahinidis, Nikolaos V.

“… While significant progress has been made towards solving the problem, its computational complexity is not known, i.e…”
Získať plný text

Improving the Computational Complexity of the COOL Screening Tool Autor Ghalwash, Mohamed

“… However, one of the fundamental questions of screening is when to screen subjects who might be at a higher risk of au-toimmune disorder…”
Získať plný text

Optimized Bi-Objective EEG Channel Selection and Cross-Subject Generalization With Brain–Computer Interfaces Autor Handiru, Vikram Shenoy, Prasad, Vinod A.

“…Electroencephalography (EEG) signal processing to decode motor imagery (MI) involves high-dimensional features, which increases the computational complexity…”
Získať plný text

Design of Constant Modulus Discrete Phase Radar Waveforms Subject to Multi-Spectral Constraints Autor Yang, Jing, Aubry, Augusto, De Maio, Antonio, Yu, Xianxiang, Cui, Guolong

“… some relevant signal features. To tackle the resulting NP-hard optimization problem, an iterative procedure characterized by a polynomial computational complexity, is introduced leveraging the coordinate descent method…”
Získať plný text

Noise-Robust Heart Rate Estimation Algorithm from Photoplethysmography Signal with Low Computational Complexity Autor Shin, JaeWook, Cho, Jaegeol

“… The proposed algorithm has not only robustness for motion noise but also low computational complexity…”
Získať plný text

Linear robust adaptive model predictive control: Computational complexity and conservatism Autor Kohler, Johannes, Andina, Elisa, Soloperto, Raffaele, Muller, Matthias A., Allgower, Frank

“… 2 stability of the closed loop. The overall algorithm has a fixed (user specified) computational complexity…”
Získať plný text

Divide and recombine (D&R) data science projects for deep analysis of big data and high computational complexity Autor Tung, Wen-wen, Barthur, Ashrith, Bowers, Matthew C., Song, Yuying, Gerth, John, Cleveland, William S.

“… Next, big data are addressed, which create computational challenges due to the data size, as does the computational complexity of many analytic methods…”
Získať plný text

Max-Min Fairness in IRS-Aided Multi-Cell MISO Systems With Joint Transmit and Reflective Beamforming Autor Xie, Hailiang, Xu, Jie, Liu, Ya-Feng

“…) at the users, subject to the individual maximum transmit power constraints at the BSs and the reflection constraints at the IRS…”
Získať plný text

Computational complexity of domination integrity in graphs Autor Sundareswaran, R, Swaminathan, V

“…s: Integrity, Domination Integrity AMS Subject Classification: 05C07, 05C12, 05C35, 05C90…”
Získať plný text

Reconfigurable Intelligent Surface Assisted MIMO Symbiotic Radio Networks Autor Zhang, Qianqian, Liang, Ying-Chang, Poor, H. Vincent

“… We are interested in the joint design of active transmit beamformer at the PTx and passive reflecting beamformer at the STx to minimize the total transmit power at the PTx, subject to the signal-to-noise-ratio (SNR…”
Získať plný text

Facilitating URLLC vis-à-vis UAV-enabled relaying for MEC Systems in 6G Networks Autor Ranjha, Ali, Naboulsi, Diala, Emary, Mohamed El, Gagnon, Francois

“… In this paper, we consider UAV-enabled relaying for MEC systems for uplink transmissions in 6G networks, and we aim to optimize mission completion time subject to the constraints of resource…”
Získať plný text

Electronic Voting: 10th International Joint Conference, E-Vote-ID 2025, Nancy, France, October 1–3, 2025, Proceedings

“…This open access book constitutes the proceedings of the 10th International Joint Conference on Electronic Voting, E-Vote-ID 2024, held in Nancy, France,…”
Získať plný text

Complexity of single machine scheduling subject to nonnegative inventory constraints Autor Briskorn, Dirk, Choi, Byung-Cheon, Lee, Kangbok, Leung, Joseph, Pinedo, Michael

“… and determine their computational complexity. Since the general versions of our problems turn out to be strongly NP-hard, we consider special cases by assuming that different jobs have certain parameter values in common…”
Získať plný text