and the various references mentioned therein. in addition, recall that basic learning guarantees, such as universal consistency, can be established for kernel-based learning algorithms if universal kernels are used, see e.g. [ 39 ]. moreover, universal kernels are very closely related to character...
Various approaches to high-dimensional integration have been proposed in the literature. One of the most common strategies consists of Monte Carlo-type sampling, e.g., with Markov chain Monte Carlo (MCMC) methods [55]. Metropolis–Hastings MCMC algorithms, for instance, are versatile and simple ...
The argumentation is constructive and suggests algorithms. In general the solution structure is highly determined by the properties of the two graphs. We ... K Gatermann,B Huber - 《Journal of Symbolic Computation》 被引量: 138发表: 2002年 A Comparative Analysis of Online Discussion Participation...
Constructive algebraic integration theory without choice", in Mathematics, Algorithms and Proofs The theory is constructive in the sense of Bishop, however we avoid the axiom of countable, or dependent, choice. Thus our results can be interpreted in any topos. Since we avoid impredicative methods ...
From this perspective, distributed algorithms such as for leader election, consensus or mutual exclusion do not strictly solve their task but merely reduce one synchronization problem to another. This talk revisits the logical justification of the synchronous abstraction claiming that correctness arguments...
In PKI as an example, hard security is realized by asymmetric algorithms like RSA (Rivest-Shamir-Adleman algorithm) or ECDSA (Elliptic Curve Digital Signature Algorithm), used for certificate signing, while trust in certain Certificate Authority is a soft security. In slicing environment, there is...
Zvonkin, A.K., Levin, L.A.: The complexity of finite objects and the basing of the concepts of information and randomness on the theory of algorithms. Uspehi Mat. Nauk 25(6(156)), 85–127 (1970) MathSciNet MATH Google Scholar Download references ...
6.1 Comparison of branch-and-bound algorithms In the first part of the performance analysis, we compare our constructive BnB (CBB) with all available exact solution pro- cedures from the literature for partially renewable resources. In the second part, we derive a schedule-generation scheme from...
This section describes the computational results obtained by the algorithms presented above on a large collection of benchmark instances with different sizes, topologies and weight functions. All algorithms have been coded in C99, and compiled with GNU GCC 8.3.0. They have been run on a Linux se...
At the beginning of the 1930's, this concept was made more precise, and the first results of the theory of algorithms were obtained. On the basis of these results, Novikov proved the undecidability of the word problem for groups. The chapter introduces two important operations over constructive...