61 citations · 693 across the 58 of their papers we have counts for
5 papers · 1 filter
Improved cross-validation for classifiers that make algorithmic choices to minimise runtime without compromising output correctness
Dorian Florescu, Matthew England
Our topic is the use of machine learning to improve software by making choices which do not compromise the correctness of the output, but do affect the time taken to produce such o…
Algorithmically generating new algebraic features of polynomial systems for machine learning
Dorian Florescu, Matthew England
There are a variety of choices to be made in both computer algebra systems (CASs) and satisfiability modulo theory (SMT) solvers which can impact performance without affecting math…
Comparing machine learning models to choose the variable ordering for cylindrical algebraic decomposition
Matthew England, Dorian Florescu
There has been recent interest in the use of machine learning (ML) approaches within mathematical software to make choices that impact on the computing performance without affectin…
Cylindrical Algebraic Decomposition with Equational Constraints
Matthew England, Russell Bradford, James H. Davenport
Cylindrical Algebraic Decomposition (CAD) has long been one of the most important algorithms within Symbolic Computation, as a tool to perform quantifier elimination in first order…
Identifying the Parametric Occurrence of Multiple Steady States for some Biological Networks
R. Bradford, J. H. Davenport, M. England +8
We consider a problem from biological network analysis of determining regions in a parameter space over which there are multiple steady states for positive real values of variables…