Results 41 to 50 of about 1,745,964 (294)
Kolmogorov Complexity and Combinatorial Methods in Communication Complexity
Theoretical Computer Science, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Marc Kaplan, Sophie Laplante
openaire +4 more sources
Throughput maximization for underlay CR multicarrier NOMA network with cooperative communication
ETRI Journal, 2020 The non‐orthogonal multiple access (NOMA) technique offers throughput improvement to meet the demands of the future generation of wireless communication networks.
Thirunavukkarasu Manimekalai +2 more
doaj +1 more source
Algebraic and Combinatorial Tools for State Complexity : Application to the Star-Xor Problem [PDF]
Electronic Proceedings in Theoretical Computer Science, 2019 We investigate the state complexity of the star of symmetrical differences using modifiers and monsters. A monster is an automaton in which every function from states to states is represented by at least one letter.
Pascal Caron +2 more
doaj +1 more source
Frontiers in Robotics and AI, 2022 The fabrication and control of robot hands with biologically inspired structure remains challenging due to its cost and complexity. In this paper we explore how widely available FDM printers can be used to fabricate complex hand structures by leveraging ...
Carlo Bosio +3 more
doaj +1 more source
Journal of Marine Science and EngineeringCollision avoidance algorithms play a crucial role in ensuring the safety and effectiveness of autonomous ships, which require comprehensive testing in realistic multi-ship encounter scenarios.
Lijia Chen +6 more
doaj +1 more source
Characteristics of Complexity: Clique Number of a Polytope Graph and Rectangle Covering Number
Моделирование и анализ информационных систем, 2014 In the 1980s V.A. Bondarenko found that the clique number of the graph of a polytope in many cases corresponds to the actual complexity of the optimization problem on the vertices of the polytope.
A. N. Maksimenko
doaj +1 more source
Black-box complexities of combinatorial problems [PDF]
Proceedings of the 13th annual conference on Genetic and evolutionary computation, 2011 Black-box complexity is a complexity theoretic measure for how difficult a problem is to be optimized by a general purpose optimization algorithm. It is thus one of the few means trying to understand which problems are tractable for genetic algorithms and other randomized search heuristics.
Benjamin Doerr +3 more
openaire +7 more sources
, 2021 This article seeks to contribute to theorising the institutional structure of international society by exploring synergies between complex systems thinking and the English School theory of International Relations (IR).
Schmidt, Dennis R.
core +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background Adolescents with high‐risk cancer face complex developmental, psychosocial, and ethical challenges that extend beyond disease‐directed treatment. Although international recommendations exist for communication, psychosocial care, pediatric palliative care, survivorship, and shared decision‐making, these have largely evolved within ...
Johanna M. C. Blom +15 more
wiley +1 more source
Differentiable learning of sparse lossless Fourier filters [PDF]
AIP AdvancesPurpose. The Fourier transform-bounded Kolmogorov complexity proposed in the study by Terry-Jack [J. Software Eng. Appl. 15(10), 359 (2022)], as well as in that by Terry-Jack and O’Keefe [Physica D 453, 133824 (2023)], relies on finding the minimal ...
Mohammed Terry-Jack, Simon O’Keefe
doaj +1 more source