We present a parallel algorithm for finding a maximum weight matching in general bipartite graphs with an adjustable time complexity of O(n ) using O(nmax(2,4+)) processing
We propose a novel approach to experience collection for autonomous service robots performing complex activities. This approach enables robots to data for many learning problems at...
— Job-shop scheduling is one of the most difficult production scheduling problems in industry. This paper proposes an adaptive neural network and local search hybrid approach fo...
In this work we present a novel control design methodology for under-actuated mechanical systems. As part of the design process we use the reachability analysis tool d/dt [ABDM99,D...
Eugene Asarin, Sorav Bansal, Bernard Espiau, Thao ...
The Lagrangian multiplier based rate-distortion optimization has been proved to be an effective way in hybrid video coding. In this paper, an advanced Lagrange multiplier selectio...
Xiang Li, Norbert Oertel, Andreas Hutter, Andr&eac...