Sciweavers

315 search results - page 52 / 63
» Reactive Turing Machines
Sort
View
IPPS
1998
IEEE
15 years 6 months ago
A Molecular Quasi-Random Model of Computations Applied to Evaluate Collective Intelligence
The paper presents how the Random PROLOG Processor (RPP), a bio-inspired model of computations, can be used for formalization and analysis of a phenomenon - the Collective Intelli...
Tadeusz Szuba
ISTCS
1993
Springer
15 years 6 months ago
Analog Computation Via Neural Networks
We pursue a particular approach to analog computation, based on dynamical systems of the type used in neural networks research. Our systems have a xed structure, invariant in time...
Hava T. Siegelmann, Eduardo D. Sontag
STOC
1989
ACM
96views Algorithms» more  STOC 1989»
15 years 5 months ago
Optimal Size Integer Division Circuits
Division is a fundamental problem for arithmetic and algebraic computation. This paper describes Boolean circuits of bounded fan-in for integer division  nding reciprocals that...
John H. Reif, Stephen R. Tate
131
Voted
CIAC
2010
Springer
259views Algorithms» more  CIAC 2010»
15 years 5 months ago
On Strategy Improvement Algorithms for Simple Stochastic Games
The study of simple stochastic games (SSGs) was initiated by Condon for analyzing the computational power of randomized space-bounded alternating Turing machines. The game is play...
Rahul Tripathi, Elena Valkanova, V. S. Anil Kumar
116
Voted
ESCIENCE
2006
IEEE
15 years 5 months ago
Designing Workflow Components for e-Science
In this paper we present a general domain for the analysis of workflows and workflow components based on the notion of a collection of Turing machines sharing a set of tapes. We s...
Frank Terpstra, Pieter W. Adriaans