Sciweavers

2920 search results - page 281 / 584
» Finite information logic
Sort
View
ISCIS
2005
Springer
16 years 7 days ago
Generalizing Redundancy Elimination in Checking Sequences
Abstract. Based on a distinguishing sequence for a Finite State Machine (FSM), an efficient checking sequence may be produced from the elements of a set Eα of α –sequences and ...
K. Tuncay Tekle, Hasan Ural, M. Cihan Yalcin, H&uu...
ITCC
2003
IEEE
16 years 20 hour ago
Fast Prefix Code Processing
As large main memory becomes more and more available at reasonable prices, processing speed of large data sets becomes more important than reducing main memory usage of internal d...
Renato Pajarola
DSD
2002
IEEE
93views Hardware» more  DSD 2002»
15 years 11 months ago
Fault Latencies of Concurrent Checking FSMs
In this paper we introduce concepts of a potential fault latency and a real fault latency for Finite State Machines (FSMs). The potential latency defines a minimal value of the po...
Roman Goot, Ilya Levin, Sergei Ostanin
ICRA
2002
IEEE
152views Robotics» more  ICRA 2002»
15 years 11 months ago
Needle Insertion Modelling and Simulation
Abstract—A methodology for estimating the force distribution that occurs along a needle shaft during insertion is described. To validate the approach, an experimental system for ...
Simon P. DiMaio, S. E. Salcudean
ICS
1989
Tsinghua U.
15 years 10 months ago
Convergence rate and termination of asynchronous iterative algorithms
We consider iterative algorithms of the form z := f(z), executed by a parallel or distributed computing system. We focus on asynchronous implementations whereby each processor ite...
Dimitri P. Bertsekas, John N. Tsitsiklis