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

Computational complexity of the recoverable robust shortest path problem with discrete recourse

Autoři: Marcel Jackiewicz Adam Kasperski Paweł Zieliński

Zdroj: Discrete Applied Mathematics. 370:103-110

Témata: FOS: Computer and information sciences, Computer Science - Computational Complexity, Computational Complexity (cs.CC)

Přístupová URL adresa: http://arxiv.org/abs/2403.20000

Linear Equations with Min and Max Operators: Computational Complexity

Autoři: Chatterjee, Krishnendu Luo, Ruichen Saona, Raimundo a další

Zdroj: Proceedings of the AAAI Conference on Artificial Intelligence. 39:11150-11157

Témata: FOS: Computer and information sciences, Computer Science - Computational Complexity, Artificial Intelligence (cs.AI), Computer Science - Artificial Intelligence, Optimization and Control (math.OC), FOS: Mathematics, Computational Complexity (cs.CC), Mathematics - Optimization and Control

Přístupová URL adresa: http://arxiv.org/abs/2412.12228

Computational complexity in algebraic combinatorics

Autoři: Panova, Greta

Zdroj: Current Developments in Mathematics. 2024:241-280

Témata: FOS: Computer and information sciences, Computer Science - Computational Complexity, FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO), Computational Complexity (cs.CC), Representation Theory (math.RT), Mathematics - Representation Theory

Přístupová URL adresa: http://arxiv.org/abs/2306.17511

The Input-Mapping-Based Online Learning Sliding Mode Control Strategy With Low Computational Complexity

Autoři: Yaru Yu Aoyun Ma Dewei Li a další

Zdroj: IEEE Transactions on Automation Science and Engineering. 22:7670-7678

Témata: Optimization, Sliding mode control, Low computational complexity, Uncertainty, Computational modeling, Input-mapping technique, System performance, Computational complexity, Sliding mode control (SMC), MIMO communication, Convex combined sliding mode surface, Convergence, Robustness, Switches

Exploring the Computational Complexity of Uniform Random Sampling and SAT Counting with Phase Transitions

Autoři: Olivier Zeyen Maxime Cordy Gilles Perrouin a další

Přispěvatelé: Olivier Zeyen Maxime Cordy Gilles Perrouin a další

Zdroj: Zeyen, O, Cordy, M, Perrouin, G & Acher, M 2025, Exploring the Computational Complexity of Uniform Random Sampling and SAT Counting with Phase Transitions. in M R Luaces, T V Rodeiro, S Greiner, J Galindo Duarte, T Yue, K Yoshimura, L Semini, M Cordy, M Azanza, J Kruger, G Perrouin, S Fortz, I Groher, D-J Munoz, K Schmid, F Perez, J Galasso-Carbonnel, J M Horcas & K Feichtinger (eds), SPLC 2025 : 29th ACM International Systems and Software Product Line Conference-Proceedings. SPLC 2025: 29th ACM International Systems and Software Product Line Conference-Proceedings, vol. A, ACM Press, New York, NY, USA, pp. 149–160. https://doi.org/10.1145/3744915.3748473

Témata: Controlled Experiments, Uniform Random Sampling, Scalability, SAT, Model Counting

Popis souboru: application/pdf

Přístupová URL adresa: https://pure.unamur.be/ws/files/112977734/3744915.3748473-2.pdf

Computational Complexity of the Hylland–Zeckhauser Mechanism for One-Sided Matching Markets

Autoři: Vazirani, Vijay V Yannakakis, Mihalis

Zdroj: SIAM Journal on Computing. 54(2)

Témata: Theory Of Computation, Applied Mathematics, Information and Computing Sciences, Numerical and Computational Mathematics, Mathematical Sciences, computational complexity, Hylland-Zeckhauser mechanism, one-sided matching markets, Brouwer's fixed point theorem, PPAD, FIXP, dichotomous utilities, Pure Mathematics, Computation Theory and Mathematics, Computation Theory & Mathematics, Theory of computation, Applied mathematics, Numerical and computational mathematics

Popis souboru: application/pdf

Přístupová URL adresa: https://escholarship.org/uc/item/7sx6g52x
https://escholarship.org/content/qt7sx6g52x/qt7sx6g52x.pdf

Reducing computational complexity in nonlinear model input design via sparse estimation

Autoři: Parsa, Javad Rojas, Cristian R. Hjalmarsson, Håkan

Zdroj: Automatica. 182

Témata: Input design, Nonlinear model, Sparse estimation, System identification

Popis souboru: print

Přístupová URL adresa: https://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-369600
https://doi.org/10.1016/j.automatica.2025.112557

Assembly theory and its relationship with computational complexity

Autoři: Kempes, Christopher P. Lachmann, Michael Iannaccone, Andrew a další

Zdroj: npj Complexity. 2

Témata: FOS: Computer and information sciences, Computer Science - Computational Complexity, Computational Complexity (cs.CC)

Přístupová URL adresa: http://arxiv.org/abs/2406.12176

Computational Complexity of Minimal Trap Spaces in Boolean Networks

Autoři: Kyungduk Moon Kangbok Lee Loïc Paulevé

Zdroj: SIAM Journal on Discrete Mathematics. 38:2691-2708

Témata: 0301 basic medicine, FOS: Computer and information sciences, Computer Science - Computational Complexity, 0303 health sciences, 03 medical and health sciences, Discrete Mathematics (cs.DM), FOS: Mathematics, Dynamical Systems (math.DS), 68Q17, 68R07, 94C11, 37M22, 37N25, Mathematics - Dynamical Systems, Computational Complexity (cs.CC), Computer Science - Discrete Mathematics

Přístupová URL adresa: http://arxiv.org/abs/2212.12756

Standardized Computational Complexity Evaluation for Battery State-of-Charge Estimation Algorithms

Autoři: von Liebenstein, Atjen Donkers, M.C.F. (Tijs) Kollmeyer, P.J.

Zdroj: 2025 IEEE/AIAA Transportation Electrification Conference and Electric Aircraft Technologies Symposium (ITEC+EATS). :1-6

Přístupová URL adresa: https://research.tue.nl/en/publications/a1a24562-b7ac-4cf9-9e2c-066887638d17
https://doi.org/10.1109/ITEC63604.2025.11098050

Is This Plan Necessarily Redundant? On the Computational Complexity of Unobserved Domain Learning

Autoři: Pascal Bachor P. Maurice Dekker Gregor Behnke

Zdroj: Proceedings of the International Conference on Automated Planning and Scheduling. 35:11-20

The Computational Complexity of Measurable Functions and Sets

Autoři: null Dr. Raj Kumar

Zdroj: International Journal of Scientific Research in Science, Engineering and Technology. 12:469-499

On the Computational Complexity of Spiking Neural Membrane Systems with Colored Spikes.

Autoři: Grillo, Antonio Zandron, Claudio

Zdroj: International Journal of Neural Systems. Nov2025, Vol. 35 Issue 11, p1-18. 18p.

Témata: *COMPUTATIONAL complexity, *BIOLOGICAL models, *PROBLEM solving, *OPEN-ended questions, *NEURONS

A Physical Analogy-Based Disproof of P = NP: Integrating Thermodynamic Asymmetry into Computational Complexity

Autoři: MD. SHAIKHUL HADIS, NAZAT

Témata: Irreversibility, Computational Complexity, Foundations of Computation and Physical Logic, Physics, Entropy, Polynomial time, FOS: Mathematics, Turing Machine, Thermodynamics, Mathematics, P vs NP

When and Why is Persuasion Hard? A Computational Complexity Result

Autoři: Wojtowicz, Zachary

Zdroj: Proceedings of the AAAI/ACM Conference on AI, Ethics, and Society. 7:1591-1594

Témata: FOS: Computer and information sciences, FOS: Economics and business, Computational Complexity, General Economics (econ.GN), Economics, Computers and Society (cs.CY), Computational Complexity (cs.CC), General Economics, Computers and Society

Přístupová URL adresa: http://arxiv.org/abs/2408.07923

Computational Complexity of One-Dimensional Origami with Constraints on Thickness at Creases

Autoři: Junnosuke HOSHIDO Tonan KAMATA Tsutomu ANSAI a další

Zdroj: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences. :1084-1091

Fuzzy-Augmented Neural Network for Reducing Computational Complexity: A Demonstration in Microclimate Prediction for Smart Agriculture

Autoři: Cristian Bua Francesco Fiorini Davide Adami a další

Zdroj: IEEE Internet of Things Journal. 12:36648-36661

Optimizing Control in Smart Electric Heavy Vehicles using Adaptive Q-Learning with Computational Complexity Analysis

Autoři: A. Lawrence Sahaya Sundar K. Vijayakumar J. Dani Abraham

Zdroj: 2025 5th International Conference on Soft Computing for Security Applications (ICSCSA). :1244-1248

Fast Causal Discovery by Approximate Kernel-based Generalized Score Functions with Linear Computational Complexity

Autoři: Yixin Ren Haocheng Zhang Yewei Xia a další

Zdroj: Proceedings of the 31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining V.1. :1197-1208

Témata: FOS: Computer and information sciences, Computer Science - Machine Learning, Statistics - Machine Learning, Machine Learning (stat.ML), Machine Learning (cs.LG)

Přístupová URL adresa: http://arxiv.org/abs/2412.17717

Computational Complexity Analysis of AOA Estimation Algorithms with CRA Antenna

Autoři: Tae-yun Kim Suk-seung Hwang

Zdroj: 2025 Sixteenth International Conference on Ubiquitous and Future Networks (ICUFN). :606-610