The subset sum problem (SSP) (given n numbers and a target bound B, find a subset of the numbers summing to B), is one of the classical NP-hard problems. The hardness of SSP vari...
We develop a novel user-centric modeling technology, which can dynamically describe and update a person's expertise profile. In an enterprise environment, the technology can e...
Xiaodan Song, Belle L. Tseng, Ching-Yung Lin, Ming...
We present a mathematical and computational feasibility study of the variational convex decomposition of 2D vector fields into coherent structures and additively superposed flow ...
Dynamic market situation and changing customer requirements generate more demands for the product development. Product releases should be developed and managed in short iterations ...
This paper investigates, for the first time in the literature, the approximation of min-max (regret) versions of classical problems like shortest path, minimum spanning tree, and ...
Hassene Aissi, Cristina Bazgan, Daniel Vanderpoote...