The Maximum Common Subgraph (MCS) problem appears in many guises and in a wide variety of applications. The usual goal is to take as inputs two graphs, of order m and n, respectiv...
W. Henry Suters, Faisal N. Abu-Khzam, Yun Zhang, C...
In order to reduce the cost, the time-to-market and to make the most pertinent choices, it becomes essential to allow designers to evaluate, very soon in the design phase, a given...
The authors have developed a performance test, CPTOP2 (Cognitive Performance Test of Productivity), which consists of four task tests to evaluate cognitive abilities of office work...
We introduce TiMDPpoly, an algorithm designed to solve planning problems with durative actions, under probabilistic uncertainty, in a non-stationary, continuous-time context. Miss...
The reuse of past coefficient vectors of the NLMS for reducing the steady-state MSD in a low signal-to-noise ratio (SNR) was proposed recently. Its convergence analysis has not b...