Results 31 to 40 of about 5,765,386 (368)
From average case complexity to improper learning complexity [PDF]
, 2014 The basic problem in the PAC model of computational learning theory is to determine which hypothesis classes are efficiently learnable. There is presently a dearth of results showing hardness of learning problems. Moreover, the existing lower bounds fall
Berthet Q. +3 more
core +1 more source
Ecology and Society, 2016 We examined the settlement structure from the Kel Tadrart Tuareg, a small pastoral society from southwest Libya. Our objective was to apply spatial analysis to establish the statistical significance of specific patterns in the settlement layout.
Stefano Biagetti +2 more
doaj +1 more source
Fixed-TimeBackstepping Control of Quadrotor Trajectory Tracking Based On Neural Network
IEEE Access, 2020 This paper aims at the trajectory tracking of a quadrotor. A novel fixed-time backstepping control design scheme is proposed for the quadrotor based on adaptive neural control approach.
Mingyu Wang, Bing Chen, Chong Lin
doaj +1 more source
Algorithms and Bounds for Very Strong Rainbow Coloring
, 2018 A well-studied coloring problem is to assign colors to the edges of a graph $G$ so that, for every pair of vertices, all edges of at least one shortest path between them receive different colors.
Algorithms and Complexity +8 more
core +1 more source
Separating decision tree complexity from subcube partition complexity [PDF]
, 2015 The subcube partition model of computation is at least as powerful as decision trees but no separation between these models was known. We show that there exists a function whose deterministic subcube partition complexity is asymptotically smaller than ...
Kothari, Robin +2 more
core +2 more sources
Oriented Getzler-Kapranov complexes and framed curves [PDF]
arXiv, 2022 In the present paper, we introduce and study oriented Getzler-Kapranov complexes. These complexes are generalizations of S. Merkulov's oriented graph complex. We investigate their relation to the cohomology of moduli spaces of complex and tropical curves, ribbon graph complexes, and motivic structures in string topology.
arxiv
The Complexity of Complex Patients [PDF]
Journal of General Internal Medicine, 2015 A s the population of the United States ages, and more and more people live with multiple chronic conditions, the issue of complex patients is receiving increasing attention. Physicians have recognized that disease-centric approaches to clinical management have serious limitations for patients with multiple co-occurring medical conditions.
openaire +3 more sources
Complexity, 2018 In this paper, we show an unintended effect of the program Ser Pilo Paga (SPP) that was a flagship program of the Colombian government between 2014 and 2018.
Pablo Medina +7 more
doaj +1 more source
Automatic design of mechanical metamaterial actuators
Nature Communications, 2020 Efficient strategies to optimize metamaterial design for specific applications are urgently needed despite the rapid progress in this area. Here the authors propose a computational method combining an optimization algorithm with discrete element ...
Silvia Bonfanti +4 more
doaj +1 more source
On the Complexity of Automatic Complexity [PDF]
Theory of Computing Systems, 2017 Generalizing the notion of automatic complexity of individual strings due to Shallit and Wang, we define the automatic complexity $A(E)$ of an equivalence relation $E$ on a finite set $S$ of strings. We prove that the problem of determining whether $A(E)$ equals the number $|E|$ of equivalence classes of $E$ is $\mathsf{NP}$-complete.
openaire +3 more sources