Pages that link to "Item:Q2009221"
From MaRDI portal
The following pages link to Using machine learning to improve cylindrical algebraic decomposition (Q2009221):
Displayed 10 items.
- Deciding the consistency of non-linear real arithmetic constraints with a conflict driven search using cylindrical algebraic coverings (Q1996869) (← links)
- New heuristic to choose a cylindrical algebraic decomposition variable ordering motivated by complexity analysis (Q2109991) (← links)
- Deep learning Gauss-Manin connections (Q2113261) (← links)
- Identifying the parametric occurrence of multiple steady states for some biological networks (Q2284952) (← links)
- Cylindrical algebraic decomposition with equational constraints (Q2307622) (← links)
- Improved Cross-Validation for Classifiers that Make Algorithmic Choices to Minimise Runtime Without Compromising Output Correctness (Q5014692) (← links)
- Variable Ordering Selection for Cylindrical Algebraic Decomposition with Artificial Neural Networks (Q5041065) (← links)
- A Machine Learning Based Software Pipeline to Pick the Variable Ordering for Algorithms with Polynomial Inputs (Q5041068) (← links)
- An augmented MetiTarski dataset for real quantifier elimination using machine learning (Q6118846) (← links)
- Explainable AI insights for symbolic computation: a case study on selecting the variable ordering for cylindrical algebraic decomposition (Q6149145) (← links)