We combine the work of Garg and K¨onemann, and Fleischer with ideas from dynamic graph algorithms to obtain faster (1 − ε)-approximation schemes for various versions of the mu...
The paper describes a framework in the form of an optimization of a performance index subject to the constraints of a dynamic network, represented in the state space. The performa...
Abstract. The visual localization problem in robotics poses a dynamically changing environment due to the movement of the robot compared to a static image set serving as environmen...
Dynamic programming is introduced to quantize a continuous random variable into a discrete random variable. Quantization is often useful before statistical analysis or reconstruct...
Mingzhou (Joe) Song, Robert M. Haralick, Sté...
: The contribution concerns the design of a generalised functional-link neural network with internal dynamics and its applicability to system identification by means of multi-input...