Sciweavers

315 search results - page 45 / 63
» Reactive Turing Machines
Sort
View
DAM
1998
88views more  DAM 1998»
13 years 8 months ago
Neither Reading Few Bits Twice Nor Reading Illegally Helps Much
We first consider so-called (1,+s)-branching programs in which along every consistent path at most s variables are tested more than once. We prove that any such program computing...
Stasys Jukna, Alexander A. Razborov
ML
2007
ACM
122views Machine Learning» more  ML 2007»
13 years 8 months ago
Status report: hot pickles, and how to serve them
The need for flexible forms of serialisation arises under many circumstances, e.g. for doing high-level inter-process communication or to achieve persistence. Many languages, inc...
Andreas Rossberg, Guido Tack, Leif Kornstaedt
CONNECTION
2004
94views more  CONNECTION 2004»
13 years 8 months ago
Evolving internal memory for T-maze tasks in noisy environments
In autonomous agent systems, internal memory can be an important element to overcome the limitations of purely reactive agent behaviour. This paper presents an analysis of memory r...
DaeEun Kim
FLAIRS
2007
13 years 10 months ago
Probabilistic Interactive Installations
We present a description of two small audio/visual immersive installations. The main framework is an interactive structure that enables multiple participants to generate jazz impr...
Constance G. Baltera, Sara B. Smith, Judy A. Frank...
DNA
2005
Springer
154views Bioinformatics» more  DNA 2005»
14 years 2 months ago
Design of Autonomous DNA Cellular Automata
Recent experimental progress in DNA lattice construction, DNA robotics, and DNA computing provides the basis for designing DNA cellular computing devices, i.e. autonomous nano-mech...
Peng Yin, Sudheer Sahu, Andrew J. Turberfield, Joh...