1279 search results - page 49 / 256 » Approximation Algorithms for Min-Max Generalization Problems |
STOC
2009
ACM
14 years 9 months ago
2009
ACM
We consider the stochastic Steiner forest problem: suppose we were given a collection of Steiner forest instances, and were guaranteed that a random one of these instances would a...
EUSFLAT
2009
13 years 6 months ago
2009
Fuzzy Logic Systems are widely recognized to be successful at modelling uncertainty in a large variety of applications. While recently interval type-2 fuzzy logic has been credited...
CORR
2007
Springer
13 years 8 months ago
2007
Springer
Orienteering is the following optimization problem: given an edge-weighted graph (directed or undirected), two nodes s, t and a time limit T, find an s-t walk of total length at ...
SIAMJO
2011
13 years 3 months ago
2011
Abstract. We propose a unifying framework for polyhedral approximation in convex optimization. It subsumes classical methods, such as cutting plane and simplicial decomposition, bu...
ICDE
2002
IEEE
14 years 10 months ago
2002
IEEE
Obtaining fast and good quality approximations to data distributions is a problem of central interest to database management. A variety of popular database applications including,...