Sciweavers

206 search results - page 16 / 42
» Probabilistic Analysis of Large Finite State Machines
Sort
View
SC
2004
ACM
15 years 5 months ago
Ultrascalable Implicit Finite Element Analyses in Solid Mechanics with over a Half a Billion Degrees of Freedom
The solution of elliptic diffusion operators is the computational bottleneck in many simulations in a wide range of engineering and scientific disciplines. We present a truly sca...
Mark F. Adams, Harun H. Bayraktar, Tony M. Keaveny...
AUTOMATICA
2008
134views more  AUTOMATICA 2008»
14 years 11 months ago
Probabilistic reachability and safety for controlled discrete time stochastic hybrid systems
In this work, probabilistic reachability over a finite horizon is investigated for a class of discrete time stochastic hybrid systems with control inputs. A suitable embedding of ...
Alessandro Abate, Maria Prandini, John Lygeros, Sh...
JIFS
2002
60views more  JIFS 2002»
14 years 11 months ago
Turing's analysis of computation and artificial neural networks
A novel way to simulate Turing Machines (TMs) by Artificial Neural Networks (ANNs) is proposed. We claim that the proposed simulation is in agreement with the correct interpretatio...
Wilson Rosa de Oliveira, Marcílio Carlos Pe...
SIGMETRICS
2002
ACM
107views Hardware» more  SIGMETRICS 2002»
14 years 11 months ago
Passage time distributions in large Markov chains
Probability distributions of response times are important in the design and analysis of transaction processing systems and computercommunication systems. We present a general tech...
Peter G. Harrison, William J. Knottenbelt
ICDAR
2007
IEEE
15 years 6 months ago
Hybrid Mathematical Symbol Recognition Using Support Vector Machines
Recognition of mathematical symbols is a challenging task, with a large set with many similar symbols. We present a support vector machine based hybrid recognition system that use...
Birendra Keshari, Stephen M. Watt