Login / Signup

Stability of termination and sufficient-completeness under pushouts via amalgamation.

Daniel GainaMasaki NakamuraKazuhiro OgataKokichi Futatsugi
Published in: Theor. Comput. Sci. (2020)
Keyphrases
  • stability analysis
  • search algorithm
  • preprocessing
  • lower bound
  • term rewriting
  • data sets
  • neural network
  • machine learning
  • database systems
  • evolutionary algorithm
  • data quality