On Defining and Computing ``Good'' Conservation Laws

If the number of points to test, denoted N , is large enough e.g., 1000 or larger, there exists a faster method, using the fact that the set SI is generally empty: we can look for

Abstract — In this paper, a reduced basis method is introduced to deal with a stochastic problem in a numerical dosimetry application in which the field

In order to extend this existence result to more general data than generalized Riemann problems, we then give a finite volume numerical scheme, the convergence of which to an

Examples include decision tree learning, association rule learning, artificial neural networks, deep learning, inductive logic programming, support vector machines,

Nos résultats sont en partie en accord avec la modélisation de la santé mentale des étudiants allemands, ainsi on trouve que le stress est corrélé positivement

lésions hamartomateuses responsables des différentes manifestations cliniques de la sclérose tubéreuse de Bourneville. La rapamycine est un immunosuppresseur qui peut être

Making controlled hand-pollination (CHP) is costly, time-consuming and complex. The visits conducted in many countries by the COGENT Secretariat highlighted that existing

It amounts to 13.6 kloc, that can be decomposed as 5.1 kloc for the proof of the Cholesky decomposition algorithm (borrowed from (Roux 2016)), 3.0 kloc for the refinement of