Sciweavers

676 search results - page 3 / 136
» Fixed-Parameter Approximation: Conceptual Framework and Appr...
Sort
View
AIPS
2007
13 years 10 months ago
Cost-Sharing Approximations for h+
Relaxations based on (either complete or partial) ignoring delete effects of the actions provide the basis for some seminal classical planning heuristics. However, the palette of ...
Vitaly Mirkis, Carmel Domshlak
POLICY
2005
Springer
14 years 1 months ago
Approximating Service Utility from Policies and Value Function Patterns
Service-oriented computing provides the right means for building flexible systems that allow dynamic configuration and on-the-fly composition. In order to realize this vision, ...
Steffen Lamparter, Daniel Oberle, Andreas Eberhart
TIT
2002
89views more  TIT 2002»
13 years 7 months ago
Comparison of worst case errors in linear and neural network approximation
Sets of multivariable functions are described for which worst case errors in linear approximation are larger than those in approximation by neural networks. A theoretical framework...
Vera Kurková, Marcello Sanguineti
STOC
2012
ACM
209views Algorithms» more  STOC 2012»
11 years 10 months ago
Nearly optimal solutions for the chow parameters problem and low-weight approximation of halfspaces
The Chow parameters of a Boolean function f : {−1, 1}n → {−1, 1} are its n + 1 degree-0 and degree-1 Fourier coefficients. It has been known since 1961 [Cho61, Tan61] that ...
Anindya De, Ilias Diakonikolas, Vitaly Feldman, Ro...
AAAI
2008
13 years 10 months ago
Approximability of Manipulating Elections
In this paper, we set up a framework to study approximation of manipulation, control, and bribery in elections. We show existence of approximation algorithms (even fully polynomia...
Eric Brelsford, Piotr Faliszewski, Edith Hemaspaan...