Sciweavers

241 search results - page 31 / 49
» Learning Classes of Probabilistic Automata
Sort
View
IJAR
2007
96views more  IJAR 2007»
13 years 7 months ago
Complexity measurement of fundamental pseudo-independent models
Pseudo-independent (PI) models are a special class of probabilistic domain model (PDM) where a set of marginally independent domain variables shows collective dependency, a specia...
J. Lee, Y. Xiang
IANDC
2011
119views more  IANDC 2011»
13 years 2 months ago
Quantitative Kleene coalgebras
We present a systematic way to generate (1) languages of (generalised) regular expressions, and (2) sound and complete axiomatizations thereof, for a wide variety of quantitative ...
Alexandra Silva, Filippo Bonchi, Marcello M. Bonsa...
SIGPRO
2008
136views more  SIGPRO 2008»
13 years 7 months ago
Estimation of slowly varying parameters in nonlinear systems via symbolic dynamic filtering
This paper introduces a novel method for real-time estimation of slowly varying parameters in nonlinear dynamical systems. The core concept is built upon the principles of symboli...
Venkatesh Rajagopalan, Subhadeep Chakraborty, Asok...
CEC
2007
IEEE
14 years 1 months ago
Bayesian inference in estimation of distribution algorithms
— Metaheuristics such as Estimation of Distribution Algorithms and the Cross-Entropy method use probabilistic modelling and inference to generate candidate solutions in optimizat...
Marcus Gallagher, Ian Wood, Jonathan M. Keith, Geo...
ICANN
2001
Springer
13 years 12 months ago
Sparse Kernel Regressors
Sparse kernel regressors have become popular by applying the support vector method to regression problems. Although this approach has been shown to exhibit excellent generalization...
Volker Roth