Sciweavers

688 search results - page 18 / 138
» Computational Methods for Verification of Stochastic Hybrid ...
Sort
View
CORR
2010
Springer
103views Education» more  CORR 2010»
13 years 7 months ago
Probabilistic regular graphs
Deterministic graph grammars generate regular graphs, that form a structural extension of configuration graphs of pushdown systems. In this paper, we study a probabilistic extensio...
Nathalie Bertrand, Christophe Morvan
EOR
2007
102views more  EOR 2007»
13 years 7 months ago
Sub-stochastic matrix analysis for bounds computation - Theoretical results
Performance evaluation of complex systems is a critical issue and bounds computation provides confidence about service quality, reliability, etc. of such systems. The stochastic ...
Serge Haddad, Patrice Moreaux
DAC
1996
ACM
13 years 11 months ago
State Reduction Using Reversible Rules
We reduce the state explosion problem in automatic verification of finite-state systems by automatically collapsing subgraphs of the aph into abstract states. The key idea of the ...
C. Norris Ip, David L. Dill
ICPR
2006
IEEE
14 years 8 months ago
A Verification Method for Viewpoint Invariant Sign Language Recognition
Viewpoint variance is one of the inevitable problems in vision based sign language recognition. However, most researchers avoid this problem by assuming a special view, especially...
Qi Wang, Xilin Chen, Chunli Wang, Wen Gao
LION
2009
Springer
210views Optimization» more  LION 2009»
14 years 2 months ago
Beam-ACO Based on Stochastic Sampling: A Case Study on the TSP with Time Windows
Beam-ACO algorithms are hybrid methods that combine the metaheuristic ant colony optimization with beam search. They heavily rely on accurate and computationally inexpensive boundi...
Manuel López-Ibáñez, Christia...