Results 31 to 40 of about 108,570 (147)
Parallel sparse interpolation using small primes
To interpolate a supersparse polynomial with integer coefficients, two alternative approaches are the Prony-based "big prime" technique, which acts over a single large finite field, or the more recently-proposed "small primes" technique, which reduces ...
Khochtali, Mohamed +2 more
core +1 more source
Computer Algebra in R Bridges a Gap Between Symbolic Mathematics and Data in the Teaching of Statistics and Data Science [PDF]
The capability of R to do symbolic mathematics is enhanced by the reticulate and caracas packages. The workhorse behind these packages is the Python computer algebra library SymPy. Via reticulate, the SymPy library can be accessed from within R. This, however, requires some knowledge of SymPy, Python and reticulate.
Andersen, Mikkel Meyer; id_orcid 0000-0002-0234-0266 +1 more
openaire +1 more source
The Turing Machine is the paradigmatic case of computing machines, but there are others, such as Artificial Neural Networks, Table Computing, Relational-Indeterminate Computing and diverse forms of analogical computing, each of which based on a ...
Pineda, Luis A.
core
Solving Sparse Integer Linear Systems [PDF]
We propose a new algorithm to solve sparse linear systems of equations over the integers. This algorithm is based on a $p$-adic lifting technique combined with the use of block matrices with structured blocks.
Eberly, Wayne +4 more
core +4 more sources
Decidability and Universality in Symbolic Dynamical Systems
Many different definitions of computational universality for various types of dynamical systems have flourished since Turing's work. We propose a general definition of universality that applies to arbitrary discrete time symbolic dynamical systems ...
Blondel, Vincent +2 more
core +1 more source
Recently, symbolic computations and soft computing have played an increasingly important role in various domains of applied sciences [...]
Rafał Brociek, Ryszard Walentyński
openaire +1 more source
Agent-Based Models and Simulations in Economics and Social Sciences: from conceptual exploration to distinct ways of experimenting [PDF]
Now that complex Agent-Based Models and computer simulations spread over economics and social sciences - as in most sciences of complex systems -, epistemological puzzles (re)emerge. We introduce new epistemological tools so
Phan, Denis, Varenne, Franck
core +1 more source
New Acceleration of Nearly Optimal Univariate Polynomial Root-findERS
Univariate polynomial root-finding has been studied for four millennia and is still the subject of intensive research. Hundreds of efficient algorithms for this task have been proposed. Two of them are nearly optimal.
Pan, Victor Y.
core
Automatic differentiation in machine learning: a survey [PDF]
Derivatives, mostly in the form of gradients and Hessians, are ubiquitous in machine learning. Automatic differentiation (AD), also called algorithmic differentiation or simply "autodiff", is a family of techniques similar to but more general than ...
Baydin, Atilim Gunes +3 more
core +1 more source
What is Computational Intelligence and where is it going? [PDF]
What is Computational Intelligence (CI) and what are its relations with Artificial Intelligence (AI)? A brief survey of the scope of CI journals and books with ``computational intelligence'' in their title shows that at present it is an umbrella for ...
Duch, Wlodzislaw
core

