Sciweavers

2005 search results - page 230 / 401
» Decisive Markov Chains
Sort
View
FGCS
2006
83views more  FGCS 2006»
15 years 1 months ago
Memory-efficient Kronecker algorithms with applications to the modelling of parallel systems
We present a new algorithm for computing the solution of large Markov chain models whose generators can be represented in the form of a generalized tensor algebra, such as network...
Anne Benoit, Brigitte Plateau, William J. Stewart
142
Voted
IANDC
2006
117views more  IANDC 2006»
15 years 1 months ago
Statistical probabilistic model checking with a focus on time-bounded properties
Probabilistic verification of continuous-time stochastic processes has received increasing attention in the model-checking community in the past five years, with a clear focus on ...
Håkan L. S. Younes, Reid G. Simmons
IOR
2008
62views more  IOR 2008»
15 years 1 months ago
Improved Bounds for the Symmetric Rendezvous Value on the Line
A notorious open problem in the field of rendezvous search is to decide the rendezvous value of the symmetric rendezvous search problem on the line, when the initial distance apar...
Qiaoming Han, Donglei Du, Juan Vera, Luis F. Zulua...
JCP
2006
111views more  JCP 2006»
15 years 1 months ago
Mining Developing Trends of Dynamic Spatiotemporal Data Streams
This paper1 presents an efficient modeling technique for data streams in a dynamic spatiotemporal environment and its suitability for mining developing trends. The streaming data a...
Yu Meng, Margaret H. Dunham
DKE
2007
95views more  DKE 2007»
15 years 1 months ago
Strategies for improving the modeling and interpretability of Bayesian networks
One of the main factors for the knowledge discovery success is related to the comprehensibility of the patterns discovered by applying data mining techniques. Amongst which we can...
Ádamo L. de Santana, Carlos Renato Lisboa F...