503 search results - page 67 / 101 » Probabilistic Weighted Automata |
147
click to vote
FLAIRS
2008
15 years 5 months ago
2008
Combining probability and first-order logic has been the subject of intensive research during the last ten years. The most well-known formalisms combining probability and some sub...
111
click to vote
LATA
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. An important portion of the current research in Description Logics is devoted to the expansion of the reasoning services and the developement of algorithms that can adequ...
122
click to vote
CAI
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. We generalize a learning algorithm originally devised for deterministic all-accepting weighted tree automata (wta) to the setting of arbitrary deterministic wta. The lear...
112
click to vote
ECAI
2004
Springer
15 years 8 months ago
2004
Springer
In description logics, concrete domains are used to model concrete properties such as weight, name, or age, having concrete values such as integers or strings, with built-in predic...
130
click to vote
DSD
2005
IEEE
15 years 4 months ago
2005
IEEE
Several methods improving the fault coverage in mixed-mode BIST are presented in this paper. The test is divided into two phases: the pseudo-random and deterministic. Maximum of f...