Sciweavers

305 search results - page 18 / 61
» Using Answer Sets to Solve Belief Change Problems
Sort
View
ICEC
1996
81views more  ICEC 1996»
15 years 1 months ago
A Self-Adaptive Approach to Representation Shifts in Cultural Algorithms
Abstract - The paper describes how a formal model of selfadaptation [Angeline, 1995] can be expressed in terms of Cultural Algorithms. A particular form of self-adaptation concerns...
Robert G. Reynolds, Chan-Jin Chung
IPL
2007
71views more  IPL 2007»
14 years 11 months ago
Relaxations of semiring constraint satisfaction problems
Abstract. The Semiring Constraint Satisfaction Problem (SCSP) framework is a popular approach for the representation of partial constraint satisfaction problems. In this framework ...
Louise Leenen, Thomas Andreas Meyer, Aditya Ghose
ISSAC
2004
Springer
135views Mathematics» more  ISSAC 2004»
15 years 5 months ago
Absolute polynomial factorization in two variables and the knapsack problem
A recent algorithmic procedure for computing the absolute factorization of a polynomial P(X, Y ), after a linear change of coordinates, is via a factorization modulo X3 . This was...
Guillaume Chèze
CVPR
2005
IEEE
16 years 1 months ago
Restoration and Recognition in a Loop
In this paper we present a novel learning based method for restoring and recognizing images of digits that have been blurred using an unknown kernel. The novelty of our work is an...
Mithun Das Gupta, ShyamSundar Rajaram, Nemanja Pet...
CORR
2012
Springer
170views Education» more  CORR 2012»
13 years 7 months ago
What Cannot be Learned with Bethe Approximations
We address the problem of learning the parameters in graphical models when inference is intractable. A common strategy in this case is to replace the partition function with its B...
Uri Heinemann, Amir Globerson