Sciweavers

1941 search results - page 45 / 389
» On the Hardness of Approximate Reasoning
Sort
View
RSFDGRC
2005
Springer
126views Data Mining» more  RSFDGRC 2005»
15 years 5 months ago
Rough Sets and Higher Order Vagueness
Abstract. We present a rough set approach to vague concept approximation within the adaptive learning framework. In particular, the role of extensions of approximation spaces in se...
Andrzej Skowron, Roman W. Swiniarski
IPPS
2003
IEEE
15 years 5 months ago
Reasoning about Deadlines in Concurrent Real-Time Programs
We propose a method for the timing analysis of concurrent real-time programs with hard deadlines. We divide the analysis into a machine-independent and a machinedependent task. Th...
Sibylle Peuker, Ian J. Hayes
CORR
2010
Springer
67views Education» more  CORR 2010»
14 years 12 months ago
Similarity-based Reasoning in Qualified Logic Programming
Similarity-based Logic Programming (briefly, SLP) has been proposed to enhance the LP paradigm with a kind of approximate reasoning which supports flexible information retrieval a...
Rafael Caballero, Mario Rodríguez-Artalejo,...
CG
2006
Springer
14 years 12 months ago
Shape reasoning and understanding
s: clustering, denoising, sharp feature, shape abstraction, reverse engineering In this paper we describe a hierarchical face clustering algorithm for triangle meshes based on fit...
Bianca Falcidieno, Remco C. Veltkamp
ICCBR
2007
Springer
15 years 6 months ago
An Analysis of Case-Based Value Function Approximation by Approximating State Transition Graphs
We identify two fundamental points of utilizing CBR for an adaptive agent that tries to learn on the basis of trial and error without a model of its environment. The first link co...
Thomas Gabel, Martin Riedmiller