: We study general state-space Markov chains that depend on a parameter, say, . Sufficient conditions are established for the stationary performance of such a Markov chain to be di...
This paper concerns the problem of fully automated panoramic image stitching. Though the 1D problem (single axis of rotation) is well studied, 2D or multi-row stitching is more di...
For every real p > 0 and simple graph G, set f (p, G) = uV (G) dp (u) , and let (r, p, n) be the maximum of f (p, G) taken over all Kr+1-free graphs G of order n. We prove tha...
This paper presents operators searching large neighborhoods in order to solve the vehicle routing problem. They make use of the pruning and propagation techniques of constraint pr...
Louis-Martin Rousseau, Michel Gendreau, Gilles Pes...
Runge-Kutta (RK) pairs furnish approximations of the solution of an initial value problem at discrete points in the interval of integration. Many techniques for enriching these met...