Results 241 to 250 of about 386,495 (263)
Some of the next articles are maybe not open access.

Algorithmic Approach for Formal Fourier Series

Mathematics in Computer Science, 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Koepf, Wolfram, Chiadjeu, Etienne Nana
openaire   +2 more sources

Evolutionary Algorithm MOP Approaches

2002
Both researchers and practitioners certainly have a strong interest in knowing the state-of-the-art of a discipline in which they are interested to work. For researchers, this is the normal procedure to trigger original contributions. For practitioners, this knowledge of the area allows them to choose the most appropriate algorithm(s) for their ...
Carlos A. Coello Coello   +2 more
openaire   +1 more source

EXPECTED MAXIMIZATION ALGORITHM: PROJECTION DEPTH APPROACH

Far East Journal of Theoretical Statistics, 2019
Summary: This paper presents a novel computational procedure of an expected maximization (EM) algorithm for multidimensional Gaussian finite mixture models. The main idea behind this approach is replacing the sample mean and covariance by projection depth-based location and scatter in maximization steps of the EM algorithm.
Muthukrishnan, R.   +2 more
openaire   +2 more sources

Algorithmic Problems. Global Approach

2020
In this chapter, we study algorithmic problems related to the global approach to the investigation of decision trees: problems of computation of the minimum complexity of deterministic, nondeterministic, and strongly nondeterministic decision trees, problems of construction of decision trees with the minimum complexity, and the problem of solvability ...
openaire   +1 more source

Asymptotic Efficiency of Estimators: Algorithmic Approach

Theory of Probability & Its Applications, 1992
See the review Zbl 0733.62029.
openaire   +2 more sources

Algorithmic Problems. Local Approach

2020
In this chapter, we study algorithmic problems related to the local approach to the investigation of decision trees: problems of computation of the minimum complexity of deterministic, nondeterministic, and strongly nondeterministic decision trees, problems of construction of decision trees with the minimum complexity, and the problem of solvability of
openaire   +1 more source

Panniculitides, an algorithmic approach.

Giornale italiano di dermatologia e venereologia : organo ufficiale, Societa italiana di dermatologia e sifilografia, 2013
The issue of inflammatory diseases of subcutis and its mimicries is generally considered a difficult field of dermatopathology. Yet, in my experience, with appropriate biopsies and good clinicopathological correlation, a specific diagnosis of panniculitides can usually be made.
openaire   +1 more source

A Connectionist Approach to Algorithmic Composition

Computer Music Journal, 1989
With the advent of von Neumann-style computers, widespread exploration of new methods of music composition became possible. For the first time, complex sequences of carefully specified symbolic operations could be performed in a rapid fashion. Composers could develop algorithms embodying the compositional rules they were interested in and then use a ...
openaire   +1 more source

Distributed algorithms

2014
The new edition of a guide to distributed algorithms that emphasizes examples and exercises rather than the intricacies of mathematical models. This book offers students and researchers a guide to distributed algorithms that emphasizes examples and exercises rather than the intricacies of mathematical models. It avoids mathematical argumentation, often
openaire   +2 more sources

Home - About - Disclaimer - Privacy