597 search results - page 2 / 120 » Dominating Distributions and Learnability |
ICML
1999
IEEE
14 years 10 months ago
1999
IEEE
E cient learning of DFA is a challenging research problem in grammatical inference. Both exact and approximate (in the PAC sense) identi ability of DFA from examples is known to b...
AI
2010
Springer
13 years 10 months ago
2010
Springer
We investigate the problem of eliciting CP-nets in the well-known model of exact learning with equivalence and membership queries. The goal is to identify a preference ordering wi...
COLT
1995
Springer
14 years 1 months ago
1995
Springer
We propose and analyze a distribution learning algorithm for a subclass of Acyclic Probabilistic Finite Automata (APFA). This subclass is characterized by a certain distinguishabi...
ICML
1996
IEEE
14 years 10 months ago
1996
IEEE
Within Valiant'smodel of learning as formalized by Kearns, we show that computable total predicates for two formallyuncomputable problems the classical Halting Problem, and t...
GECCO
2006
Springer
14 years 1 months ago
2006
Springer
1 Learnable Evolution Model (LEM) is a form of non-Darwinian evolutionary computation that employs machine learning to guide evolutionary processes. Its main novelty are new type o...