We describe two algorithms for static path-planning, with the aim of deriving the trajectory that always maximises the distance of the path from the nearest obstacle. The bubble a...
This paper describes the derivation of a program for the propagation of information over a network, with acknowledgement (feedback) when the computation is complete. The derivatio...
In this paper, we consider cracks with Dirichlet boundary conditions. We first derive an asymptotic expansion of the boundary perturbations that are due to the presence of a smal...
—Multicarrier transmission techniques (i.e., orthogonal frequency division multiplexing (OFDM) and multi-carrier code division multiple access (MC-CDMA)) are the promising candid...
In this paper, we present a Branch and Bound algorithm called QuickBB for computing the treewidth of an undirected graph. This algorithm performs a search in the space of perfect ...