Sciweavers

1941 search results - page 63 / 389
» On the Hardness of Approximate Reasoning
Sort
View
PPAM
2007
Springer
15 years 6 months ago
A Parallel Approximation Algorithm for the Weighted Maximum Matching Problem
Abstract. We consider the problem of computing a weighted edge matching in a large graph using a parallel algorithm. This problem has application in several areas of combinatorial ...
Fredrik Manne, Rob H. Bisseling
DATE
2009
IEEE
107views Hardware» more  DATE 2009»
15 years 3 months ago
Sequential logic rectifications with approximate SPFDs
In the digital VLSI cycle, logic transformations are often required to modify the design to meet different synthesis and optimization goals. Logic transformations on sequential ci...
Yu-Shen Yang, Subarna Sinha, Andreas G. Veneris, R...
CSMR
2010
IEEE
14 years 6 months ago
Under and Over Approximation of State Models Recovered for Ajax Applications
Abstract--In contrast to conventional multi-page Web applications, an Ajax application is developed as a single-page application in which content and structure are changed at runti...
Alessandro Marchetto, Paolo Tonella, Filippo Ricca
JUCS
2010
100views more  JUCS 2010»
14 years 10 months ago
Spatial Reasoning with Integrated Qualitative-Metric Fuzzy Constraint Networks
Abstract: Qualitative Spatial Reasoning can be greatly improved if metric information can be represented and reasoning can be performed on it; moreover, modelling vagueness and unc...
Marco Falda
ICIW
2008
IEEE
15 years 6 months ago
XML Semantic Filtering via Ontology Reasoning
In this paper, we present an extension of PHIL, a declarative language for filtering information from XML data. The proposed approach allows us to extract relevant data as well a...
Michele Baggi, Moreno Falaschi, Demis Ballis