output
19952026
most citedPublic transport networks: empirical analysis and modeling

302 citations

Showing 2019 · cs.SCShow all

5 papers · 2 filters

cs.SC2019★ 7 cited

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…

cs.SC2019★ 9 cited

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…

cs.SC2019★ 18 cited

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…

cs.SC2019★ 23 cited

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…

cs.SC2019★ 30 cited

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…