Linear Algebraic Methods in RESTART Problems in Markovian Systems

Author(s):  
Stephen Thompson ◽  
Lester Lipsky ◽  
Søren Asmussen
SeMA Journal ◽  
2016 ◽  
Vol 73 (3) ◽  
pp. 201-212
Author(s):  
N. Taghizadeh ◽  
A. Ebadian ◽  
M. Najand Foumani ◽  
F. Farahrooz ◽  
A. A. Khajehnasiri

2021 ◽  
Vol 126 (1) ◽  
Author(s):  
Tan Van Vu ◽  
Yoshihiko Hasegawa
Keyword(s):  

1990 ◽  
Vol 38 (1) ◽  
pp. 173-175 ◽  
Author(s):  
Linda Green ◽  
Benjamin Melamed
Keyword(s):  

Resonance ◽  
2008 ◽  
Vol 13 (11) ◽  
pp. 1027-1040
Author(s):  
Shailesh A. Shirali

1987 ◽  
Vol 10 (1) ◽  
pp. 93-114
Author(s):  
J.R.B. Cockett

A basic concern when using decision trees for the solution of taxonomic or similar problems is their efficiency. Often the information that is required to completely optimize a tree is simply not available. This is especially the case when a criterion based on probabilities is used. It is shown how it is often possible, despite the absence of this information, to improve the design of the tree. The approach is based on algebraic methods for manipulating decision trees and the identification of some particularly desirable forms.


Sign in / Sign up

Export Citation Format

Share Document