We give an O(n lg n)-time algorithm for counting the number of inversions in a permutation on n elements. This improves a long-standing previous bound of O(n lg n/ lg lg n) that ...
Modeling the behavior of imperfect agents from a small number of observations is a difficult, but important task. In the singleagent decision-theoretic setting, inverse optimal co...
—The problem of active shielding of some domains from the effect of the sources distributed in other domains is considered. The problem can be formulated either in a bounded dom...
This paper is devoted to the identification of the unknown smooth coefficient c entering the hyperbolic equation c(x)2 t u-u = 0 in a bounded smooth domain in Rd from partial (on ...
Christian Daveau, Diane Manuel Douady, Abdessatar ...