Sciweavers

5757 search results - page 1005 / 1152
» Dynamic Policy Programming
Sort
View
STACS
2005
Springer
14 years 2 months ago
Solving Medium-Density Subset Sum Problems in Expected Polynomial Time
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...
Abraham Flaxman, Bartosz Przydatek
UM
2005
Springer
14 years 2 months ago
ExpertiseNet: Relational and Evolutionary Expert Modeling
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...
VLSM
2005
Springer
14 years 2 months ago
A Study of Non-smooth Convex Flow Decomposition
We present a mathematical and computational feasibility study of the variational convex decomposition of 2D vector fields into coherent structures and additively superposed flow ...
Jing Yuan, Christoph Schnörr, Gabriele Steidl...
XPU
2005
Springer
14 years 2 months ago
An Approach for Assessing Suitability of Agile Solutions: A Case Study
Dynamic market situation and changing customer requirements generate more demands for the product development. Product releases should be developed and managed in short iterations ...
Minna Pikkarainen, Ulla Passoja
ESA
2005
Springer
135views Algorithms» more  ESA 2005»
14 years 2 months ago
Approximation Complexity of min-max (Regret) Versions of Shortest Path, Spanning Tree, and Knapsack
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...
« Prev « First page 1005 / 1152 Last » Next »