Results 311 to 320 of about 5,239,116 (369)
82.5 GHz Photonic W-Band IM/DD PS-PAM4 Wireless Transmission over 300 m Based on Balanced and Lightweight DNN Equalizer Cascaded with Clustering Algorithm. [PDF]
Sensors (Basel)Ge J +14 more
europepmc +1 more source
A dynamic image encryption scheme through 2-D cellular automata and chaotic logistic map. [PDF]
Sci RepAbdul Y +4 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Linear robust adaptive model predictive control: Computational complexity and conservatism
IEEE Conference on Decision and Control, 2019In this paper, we present a robust adaptive model predictive control (MPC) scheme for linear systems subject to parametric uncertainty and additive disturbances.
Johannes Köhler +4 more
semanticscholar +1 more source
Computational complexity and evolutionary computation
Proceedings of the 9th annual conference companion on Genetic and evolutionary computation, 2007Evolutionary algorithms and other nature-inspired search heuristics like ant colony optimization have been shown to be very successful when dealing with real-world applications or problems from combinatorial optimization. In recent years, analyses has shown that these general randomized search heuristics can be analyzed like "ordinary" randomized ...
Thomas Jansen, Frank Neumann
openaire +2 more sources
Computational sample complexity
Proceedings of the tenth annual conference on Computational learning theory - COLT '97, 1997Summary: In a variety of PAC learning models, a trade-off between time and information seems to exist: with unlimited time, a small amount of information suffices, but with time restrictions, more information sometimes seems to be required. In addition, it has long been known that there are concept classes that can be learned in the absence of ...
Scott E. Decatur +2 more
openaire +4 more sources
Computational Complexity of the Interleaving Distance
International Symposium on Computational Geometry, 2017The interleaving distance is arguably the most prominent distance measure in topological data analysis. In this paper, we provide bounds on the computational complexity of determining the interleaving distance in several settings.
Håvard Bakke Bjerkevik, M. B. Botnan
semanticscholar +1 more source
SIGACT News Complexity Theory Column 124 Meta-Mathematics of Computational Complexity Theory
Sigact NewsWe survey results on the formalization and independence of mathematical statements related to major open problems in computational complexity theory.
Igor C. Oliveira
semanticscholar +1 more source
On the Computational Complexity of Conservative Computing
2003In a seminal paper published in 1982, Fredkin and Toffoli have introduced conservative logic, a mathematical model that allows one to describe computations which reflect some properties of microdynamical laws of Physics, such as reversibility and conservation of the internal energy of the physical system used to perform the computations. In particular,
MAURI, GIANCARLO +1 more
openaire +2 more sources
Computational Complexity and Knowledge Complexity
SIAM Journal on Computing, 1998Summary: We study the computational complexity of languages which have interactive proofs of logarithmic knowledge complexity. We show that all such languages can be recognized in \({\mathcal {BPP}}^{\mathcal {NP}}\). Prior to this work, for languages with greater-than-zero knowledge complexity only trivial computational complexity bounds were known ...
Oded Goldreich +2 more
openaire +2 more sources
Complexity in Dynamics and Computation [PDF]
Acta Applicandae Mathematica, 2000 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources