Sciweavers

6110 search results - page 173 / 1222
» Approximate Computing
Sort
View
CSR
2007
Springer
16 years 19 days ago
Ruling Out Polynomial-Time Approximation Schemes for Hard Constraint Satisfaction Problems
The maximum constraint satisfaction problem (Max CSP) is the following computational problem: an instance is a finite collection of constraints on a set of variables, and the goal...
Peter Jonsson, Andrei A. Krokhin, Fredrik Kuivinen
IWVF
2001
Springer
15 years 11 months ago
Minimum-Length Polygons in Approximation Sausages
The paper introduces a new approximation scheme for planar digital curves. This scheme defines an approximating sausage ‘around’ the given digital curve, and calculates a mini...
Tetsuo Asano, Yasuyuki Kawamura, Reinhard Klette, ...
AAAI
1990
15 years 7 months ago
Approximation Reformulations
Although computers are widely used to simulate complex physical systems, crafting the underlying models that enable computer analysis remains difficult. When a model is created fo...
Daniel S. Weld
QUESTA
1998
93views more  QUESTA 1998»
15 years 6 months ago
An approximation method for complete solutions of Markov-modulated fluid models
This paper presents an approximation method for numerically solving general Markov modulated fluid models which are widely used in modelling communications and computer systems. ...
David D. McDonald, Kun Qian
ACL
2010
15 years 4 months ago
Extraction and Approximation of Numerical Attributes from the Web
We present a novel framework for automated extraction and approximation of numerical object attributes such as height and weight from the Web. Given an object-attribute pair, we d...
Dmitry Davidov, Ari Rappoport