Sciweavers

575 search results - page 90 / 115
» Wichita State University
Sort
View
JIFS
2002
60views more  JIFS 2002»
13 years 7 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...
ENTCS
2008
146views more  ENTCS 2008»
13 years 7 months ago
Probabilistic Abstract Interpretation of Imperative Programs using Truncated Normal Distributions
istic Abstract Interpretation of Imperative Programs using Truncated Normal Distributions Michael J. A. Smith1 ,2 Laboratory for Foundations of Computer Science University of Edinb...
Michael J. A. Smith
SIAMCOMP
2002
98views more  SIAMCOMP 2002»
13 years 7 months ago
Self-Stabilizing Symmetry Breaking in Constant Space
abstract Alain Mayer Yoram Ofeky Rafail Ostrovskyz Moti Yungx We investigate the problem of self-stabilizing round-robin token management scheme on an anonymous bidirectional ring...
Alain J. Mayer, Rafail Ostrovsky, Yoram Ofek, Moti...
COMPGEOM
1992
ACM
13 years 12 months ago
Piercing Convex Sets
A family of sets has the (p, q) property if among any p members of the family some q have a nonempty intersection. It is shown that for every p q d + 1 there is a c = c(p, q, d)...
Noga Alon, Daniel J. Kleitman
ACSD
2007
IEEE
93views Hardware» more  ACSD 2007»
13 years 9 months ago
SAT-based Unbounded Model Checking of Timed Automata
We present an improvement of the SAT-based Unbounded Model Checking (UMC) algorithm. UMC, a symbolic approach introduced in [7], uses propositional formulas in conjunctive normal ...
Wojciech Penczek, Maciej Szreter