In combinatorial optimization, a popular approach to NP-hard problems is the design of approximation algorithms. These algorithms typically run in polynomial time and are guarante...
We describe a new boosting algorithm that is the first such algorithm to be both smooth and adaptive. These two features make possible performance improvements for many learning ...
A nadir point is constructed by the worst objective values of the solutions of the entire Pareto-optimal set. Along with the ideal point, the nadir point provides the range of obje...
—IP network mobility is emerging as a major paradigm for providing continuous Internet access while a set of users are on the move in a transportation system. The intense interes...
Xin Hu, Erran L. Li, Zhuoqing Morley Mao, Yang Ric...
— This article addresses the problem of generating timed trajectories and temporally coordinated movements for two wheeled vehicles, when relatively low-level, noisy sensorial in...