9284 search results - page 278 / 1857 » Knowledge State Algorithms |
202
click to vote
AIPS
1996
15 years 8 months ago
1996
Learning from experimentation allows a system to acquire planning domain knowledge by correcting its knowledge when an action execution fails. Experiments are designed and planned...
191
click to vote
CORR
2012
Springer
14 years 2 months ago
2012
Springer
position paper. Historically two types of NLP have been investigated: fully automated processing of language by machines (NLP) and autonomous processing of natural language by peop...
182
click to vote
ICML
2004
IEEE
16 years 8 months ago
2004
IEEE
In this paper we focus on the adaptation of boosting to grammatical inference. We aim at improving the performances of state merging algorithms in the presence of noisy data by us...
191
click to vote
ALT
2005
Springer
16 years 4 months ago
2005
Springer
Efficient learnability using the state merging algorithm is known for a subclass of probabilistic automata termed µ-distinguishable. In this paper, we prove that state merging alg...
179
click to vote
ICDCS
1996
IEEE
15 years 11 months ago
1996
IEEE
We propose a new algorithm for recovering asynchronously from failures in a distributed computation. Our algorithm is based on two novel concepts - a fault-tolerant vector clock t...