Sciweavers

6110 search results - page 134 / 1222
» Approximate Computing
Sort
View
FOCS
2008
IEEE
15 years 6 months ago
Approximation Algorithms for Single-minded Envy-free Profit-maximization Problems with Limited Supply
We present the first polynomial-time approximation algorithms for single-minded envy-free profit-maximization problems [13] with limited supply. Our algorithms return a pricing sc...
Maurice Cheung, Chaitanya Swamy
CAD
2006
Springer
15 years 6 months ago
Cone spline approximation via fat conic spline fitting
Fat conic section and fat conic spline are defined. With well established properties of fat conic splines, the problem of approximating a ruled surface by a tangent smooth cone sp...
Xunnian Yang, Weiping Yang
IJCGA
2002
73views more  IJCGA 2002»
15 years 6 months ago
A Simple Factor-2/3 Approximation Algorithm for Two-Circle Point Labeling
Given a set P of n points in the plane, the two-circle point-labeling problem consists of placing 2n uniform, non-intersecting, maximum-size open circles such that each point touc...
Alexander Wolff, Michael Thon, Yin-Feng Xu
CEC
2005
IEEE
16 years 1 days ago
XCS with computed prediction for the learning of Boolean functions
Computed prediction represents a major shift in learning classifier system research. XCS with computed prediction, based on linear approximators, has been applied so far to functi...
Pier Luca Lanzi, Daniele Loiacono, Stewart W. Wils...
STOC
2012
ACM
221views Algorithms» more  STOC 2012»
13 years 8 months ago
From query complexity to computational complexity
We consider submodular optimization problems, and provide a general way of translating oracle inapproximability results arising from the symmetry gap technique to computational co...
Shahar Dobzinski, Jan Vondrák