Results 111 to 120 of about 16,929 (167)

A Tutorial Review of Bayesian Optimization with Gaussian Processes to Accelerate Stationary Point Searches. [PDF]

ACS Phys Chem Au
Goswami R.
europepmc   +1 more source

Quantum-enhanced generative artificial intelligence: a critical review of classical limitations, complexity barriers, and hybrid quantum-classical architectures. [PDF]

Front Artif Intell
Singh D, J O, G S S.
europepmc   +1 more source

Beyond Fixed Thresholds: Optimizing Summaries of Wearable Device Data via Piecewise Linearization of Quantile Functions. [PDF]

Stat Med
Park J, Kok N, Gaynanova I.
europepmc   +1 more source

Bridging linguistic reasoning and biophysical reality toward peptide engineering via instruction-tuned language modeling. [PDF]

Bioinformatics
Yang K, Wu T, Zhang W, Li P.
europepmc   +1 more source

Prototype-Based Classifiers and Vector Quantization on a Quantum Computer-Implementing Integer Arithmetic Oracles for Nearest Prototype Search. [PDF]

Entropy (Basel)
Engelsberger A, Pšeničkova M, Villmann T.   +2 more
europepmc   +1 more source

Ergodicity and regime recoverability in finite Markov-modulated random walks. [PDF]

Sci Rep
Pambukyan A, Saudagar AKJ, Kumar S.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Oracle

Interactions, 2002
Oracle is the market leader in database sales and the world's second largest software maker. In addition, Oracle creates industry award-winning, Web-based corporate applications, business intelligence tools, server management tools, and development tools.
Jeremy Ashley, Kristin Desmond
openaire   +2 more sources

Generic oracles and oracle classes

28th Annual Symposium on Foundations of Computer Science (sfcs 1987), 1987
In this paper, we examine various complexity issues relative to an oracle for a generic set in order to determine which are the more "natural" conjectures for these issues. Generic oracle results should be viewed as parallels to random oracle results, as in [BG]; the two are in many ways related, but, as we shall exhibit, not equivalent.
Manuel Blum, Russell Impagliazzo
openaire   +1 more source

Decision Oracles are Equivalent to Matching Oracles

1999
One of the key directions in complexity theory which has also filtered through to cryptographic research, is the effort to classify related but seemingly distinct notions. Separation or reduction arguments are the basic means for this classification.
Helena Handschuh, Yiannis Tsiounis, Moti Yung   +2 more
openaire   +2 more sources

Oracles and quantifiers

2006
We describe a general way of building logics with Lindstrom quantifiers, which capture regular complexity classes on ordered structures with polysize reductions. We then extend this method so as to accommodate complexity classes based on oracle Turing machines.
Johann A. Makowsky, Y. B. Pnueli
openaire   +2 more sources