1279 search results - page 36 / 256 » Approximation Algorithms for Min-Max Generalization Problems |
IPL
2008
13 years 8 months ago
2008
The Positive-Negative Partial Set Cover problem is introduced and its complexity, especially the hardness-of-approximation, is studied. The problem generalizes the Set Cover probl...
GECCO
2010
Springer
13 years 9 months ago
2010
Springer
Evolutionary algorithms (EAs) are increasingly being applied to solve real-parameter optimization problems due to their flexibility in handling complexities such as non-convexity,...
AAAI
2010
13 years 10 months ago
2010
Top-k approximate querying on string collections is an important data analysis tool for many applications, and it has been exhaustively studied. However, the scale of the problem ...
MOC
2000
13 years 8 months ago
2000
The probabilistic approach is used for constructing special layer methods to solve the Cauchy problem for semilinear parabolic equations with small parameter. Despite their probabi...
ICRA
1998
IEEE
14 years 29 days ago
1998
IEEE
: In this paper we present novel algorithms to compute quasi-static and dynamic equilibrium positions and orientations (if any) of 2D polygonal or curved parts placed on general sh...