All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 9 Next

Displaying 161 – 180 of 572

Showing per page

Bias-variance decomposition in Genetic Programming

Taras Kowaliw, René Doursat (2016)

Open Mathematics

We study properties of Linear Genetic Programming (LGP) through several regression and classification benchmarks. In each problem, we decompose the results into bias and variance components, and explore the effect of varying certain key parameters on the overall error and its decomposed contributions. These parameters are the maximum program size, the initial population, and the function set used. We confirm and quantify several insights into the practical usage of GP, most notably that (a) the...

Binomial residues

Eduardo Cattani, Alicia Dickenstein, Bernd Sturmfels (2002)

Annales de l’institut Fourier

A binomial residue is a rational function defined by a hypergeometric integral whose kernel is singular along binomial divisors. Binomial residues provide an integral representation for rational solutions of A -hypergeometric systems of Lawrence type. The space of binomial residues of a given degree, modulo those which are polynomial in some variable, has dimension equal to the Euler characteristic of the matroid associated with A .

Border bases and kernels of homomorphisms and of derivations

Janusz Zieliński (2010)

Open Mathematics

Border bases are an alternative to Gröbner bases. The former have several more desirable properties. In this paper some constructions and operations on border bases are presented. Namely; the case of a restriction of an ideal to a polynomial ring (in a smaller number of variables), the case of the intersection of two ideals, and the case of the kernel of a homomorphism of polynomial rings. These constructions are applied to the ideal of relations and to factorizable derivations.

Branching random walks on binary search trees: convergence of the occupation measure

Eric Fekete (2010)

ESAIM: Probability and Statistics

We consider branching random walks with binary search trees as underlying trees. We show that the occupation measure of the branching random walk, up to some scaling factors, converges weakly to a deterministic measure. The limit depends on the stable law whose domain of attraction contains the law of the increments. The existence of such stable law is our fundamental hypothesis. As a consequence, using a one-to-one correspondence between binary trees and plane trees, we give a description of the...

Calculs d'invariants primitifs de groupes finis

Ines Abdeljaouad (2010)

RAIRO - Theoretical Informatics and Applications

We introduce in this article a new method to calculate all absolute and relatif primitive invariants of finite groups. This method is inspired from K. Girstmair which calculate an absolute primitive invariant of minimal degree. Are presented two algorithms, the first one enable us to calculate all primitive invariants of minimal degree, and the second one calculate all absolute or relative primitive invariants with distincts coefficients. This work take place in Galois Theory and Invariant Theory. ...

Classification of finite rings: theory and algorithm

Mahmood Behboodi, Reza Beyranvand, Amir Hashemi, Hossein Khabazian (2014)

Czechoslovak Mathematical Journal

An interesting topic in the ring theory is the classification of finite rings. Although rings of certain orders have already been classified, a full description of all rings of a given order remains unknown. The purpose of this paper is to classify all finite rings (up to isomorphism) of a given order. In doing so, we introduce a new concept of quasi basis for certain type of modules, which is a useful computational tool for dealing with finite rings. Then, using this concept, we give structure...

Classification results in quasigroup and loop theory via a combination of automated reasoning tools

Volker Sorge, Simon Colton, Roy McCasland, Andreas Meier (2008)

Commentationes Mathematicae Universitatis Carolinae

We present some novel classification results in quasigroup and loop theory. For quasigroups up to size 5 and loops up to size 7, we describe a unique property which determines the isomorphism (and in the case of loops, the isotopism) class for any example. These invariant properties were generated using a variety of automated techniques --- including machine learning and computer algebra --- which we present here. Moreover, each result has been automatically verified, again using a variety of techniques...

Currently displaying 161 – 180 of 572