Sciweavers

189 search results - page 7 / 38
» An optimal generalization of the centerpoint theorem, and it...
Sort
View
IJCAI
1997
13 years 9 months ago
Mini-Buckets: A General Scheme for Generating Approximations in Automated Reasoning
The class of algorithms for approximating reasoning tasks presented in this paper is based on approximating the general bucket elimination framework. The algorithms have adjustabl...
Rina Dechter
IJAR
2008
140views more  IJAR 2008»
13 years 7 months ago
Financial risk measurement with imprecise probabilities
Although financial risk measurement is a largely investigated research area, its relationship with imprecise probabilities has been mostly overlooked. However, risk measures can b...
Paolo Vicig
IANDC
2000
64views more  IANDC 2000»
13 years 7 months ago
Bisimilarity of Open Terms
The standard way of lifting a binary relation, R, from closed terms of an algebra to open terms is to de ne its closed-instance extension, Rci, which holds for a given pair of ope...
Arend Rensink
IJCNN
2000
IEEE
14 years 8 days ago
Continuous Optimization of Hyper-Parameters
Many machine learning algorithms can be formulated as the minimization of a training criterion which involves (1) \training errors" on each training example and (2) some hype...
Yoshua Bengio
GECCO
2008
Springer
158views Optimization» more  GECCO 2008»
13 years 9 months ago
Convergence analysis of quantum-inspired genetic algorithms with the population of a single individual
In this paper, the Quantum-inspired Genetic Algorithms with the population of a single individual are formalized by a Markov chain model using a single and the stored best individ...
Mehrshad Khosraviani, Saadat Pour-Mozafari, Mohamm...