Sciweavers

1142 search results - page 69 / 229
» Approximability of Clausal Constraints
Sort
View
ICTAI
2006
IEEE
16 years 12 days ago
Polynomial Regression with Automated Degree: A Function Approximator for Autonomous Agents
In order for an autonomous agent to behave robustly in a variety of environments, it must have the ability to learn approximations to many different functions. The function approx...
Daniel Stronger, Peter Stone
STOC
2009
ACM
172views Algorithms» more  STOC 2009»
16 years 7 months ago
Linear time approximation schemes for the Gale-Berlekamp game and related minimization problems
We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...
Marek Karpinski, Warren Schudy
ESA
2005
Springer
145views Algorithms» more  ESA 2005»
15 years 12 months ago
Approximation Schemes for Minimum 2-Connected Spanning Subgraphs in Weighted Planar Graphs
Abstract. We present new approximation schemes for various classical problems of finding the minimum-weight spanning subgraph in edge-weighted undirected planar graphs that are re...
André Berger, Artur Czumaj, Michelangelo Gr...
DAC
2005
ACM
16 years 7 months ago
Approximate VCCs: a new characterization of multimedia workloads for system-level MpSoC design
System-level design methods specifically targeted towards multimedia applications have recently received a lot of attention. Multimedia workloads are known to have a high degree o...
Yanhong Liu, Samarjit Chakraborty, Wei Tsang Ooi
NIPS
2004
15 years 7 months ago
Expectation Consistent Free Energies for Approximate Inference
We propose a novel a framework for deriving approximations for intractable probabilistic models. This framework is based on a free energy (negative log marginal likelihood) and ca...
Manfred Opper, Ole Winther