Sciweavers

166 search results - page 4 / 34
» Comparison of two approaches to approximated reasoning
Sort
View
EWCBR
2004
Springer
14 years 1 months ago
Maintaining Case-Based Reasoning Systems: A Machine Learning Approach
Over the years, many successful applications of case-based reasoning (CBR) systems have been developed in different areas. The performance of CBR systems depends on several factor...
Niloofar Arshadi, Igor Jurisica
AAAI
2007
13 years 10 months ago
An Experimental Comparison of Constraint Logic Programming and Answer Set Programming
Answer Set Programming (ASP) and Constraint Logic Programming over finite domains (CLP(FD)) are two declarative programming paradigms that have been extensively used to encode ap...
Agostino Dovier, Andrea Formisano, Enrico Pontelli
ICCBR
2007
Springer
14 years 1 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
SCIA
2009
Springer
305views Image Analysis» more  SCIA 2009»
14 years 2 months ago
A Convex Approach to Low Rank Matrix Approximation with Missing Data
Many computer vision problems can be formulated as low rank bilinear minimization problems. One reason for the success of these problems is that they can be efficiently solved usin...
Carl Olsson, Magnus Oskarsson
ENTCS
2007
97views more  ENTCS 2007»
13 years 7 months ago
A Head-to-Head Comparison of de Bruijn Indices and Names
Often debates about pros and cons of various techniques for formalising lambda-calculi rely on subjective arguments, such as de Bruijn indices are hard to read for humans or nomin...
Stefan Berghofer, Christian Urban