2698 search results - page 291 / 540 » Approximation Algorithms for the Weighted Independent Set Pr... |
162
click to vote
ICML
2005
IEEE
16 years 7 months ago
2005
IEEE
This paper presents a search algorithm for finding functions that are highly correlated with an arbitrary set of data. The functions found by the search can be used to approximate...
195
click to vote
CCCG
2003
15 years 8 months ago
2003
Morphing algorithms aim to construct visually pleasing interpolations (morphs) between 2D or 3D shapes. One of the desirable properties of a morph is avoiding selfintersections of...
186
click to vote
ESA
2000
Springer
15 years 10 months ago
2000
Springer
The resource constrained shortest path problem (CSP) asks for the computation of a least cost path obeying a set of resource constraints. The problem is NP-complete. We give theore...
221
click to vote
FOGA
2011
14 years 10 months ago
2011
It was recently proven that sets of points maximizing the hypervolume indicator do not give a good multiplicative approximation of the Pareto front. We introduce a new “logarith...
148
click to vote
SIAMJO
2010
15 years 1 months ago
2010
In this paper we propose a new exchange method for solving convex semi-infinite programming (CSIP) problems. We introduce a new dropping-rule in the proposed exchange algorithm, wh...