Sciweavers

55 search results - page 2 / 11
» Two Revision Methods Based on Constraints: Application to a ...
Sort
View
ICML
2009
IEEE
14 years 6 months ago
Constraint relaxation in approximate linear programs
Approximate Linear Programming (ALP) is a reinforcement learning technique with nice theoretical properties, but it often performs poorly in practice. We identify some reasons for...
Marek Petrik, Shlomo Zilberstein
ICCBR
2003
Springer
13 years 10 months ago
Soft Interchangeability for Case Adaptation
In [1] we propose interchangeability based algorithms as methods for solving the case adaptation for the domain of problems which can be expressed as Constraint Satisfaction Proble...
Nicoleta Neagu, Boi Faltings
JCP
2006
91views more  JCP 2006»
13 years 5 months ago
The Matching Predicate and a Filtering Scheme Based on Matroids
Finding a maximum cardinality matching in a graph is a problem appearing in numerous settings. The problem asks for a set of edges of maximum cardinality, such that no two edges of...
Dimitris Magos, Ioannis Mourtos, Leonidas S. Pitso...
EMSOFT
2010
Springer
13 years 3 months ago
Model-based implementation of real-time applications
Correct and efficient implementation of general real-time applications remains by far an open problem. A key issue is meeting timing constraints whose satisfaction depends on feat...
Tesnim Abdellatif, Jacques Combaz, Joseph Sifakis
ICIP
1994
IEEE
13 years 9 months ago
Total Variation Based Image Restoration with Free Local Constraints
The two main plagues of image restoration are oscillations and smoothing. Traditional image restoration techniques prevent parasitic oscillations by resorting to smooth regulariza...
Leonid I. Rudin, Stanley Osher