4843 search results - page 339 / 969 » The Shortcut Problem - Complexity and Approximation |
142
click to vote
CCE
2004
15 years 4 months ago
2004
Significant advances have been made in the last two decades for the effective solution of mixed integer non-linear programming (MINLP) problems, mainly by exploiting the special s...
134
click to vote
NA
2007
15 years 3 months ago
2007
Runge-Kutta (RK) pairs furnish approximations of the solution of an initial value problem at discrete points in the interval of integration. Many techniques for enriching these met...
CVPR
1998
IEEE
16 years 6 months ago
1998
IEEE
Previous research has shown that aggregated predictors improve the performance of non-parametric function approximation techniques. This paper presents the results of applying agg...
113
click to vote
AAIM
2007
Springer
15 years 10 months ago
2007
Springer
The Generalized Maximum Dispersion problem asks for a partition of a given graph into p vertex-disjoint sets, each of them having at most k vertices. The goal is to maximize the to...
143
click to vote
SIGECOM
2003
ACM
15 years 9 months ago
2003
ACM
Strategyproof cost-sharing mechanisms, lying in the core, that recover 1/a fraction of the cost, are presented for the set cover and facility location games: a=O(log n) for the fo...