Sciweavers

25 search results - page 5 / 5
» Can Dataflow Subsume von Neumann Computing
Sort
View
JAC
2008
13 years 7 months ago
Rule 110: universality and catenations
Cellular automata are a simple model of parallel computation. Many people wonder about the computing power of such a model. Following an idea of S. Wolfram [16], M. Cook [3] has pr...
Gaétan Richard
PLSA
1994
13 years 9 months ago
Language and Architecture Paradigms as Object Classes
Computer language paradigms offer linguistic abstractions and proof theories for expressing program implementations. Similarly, system architectures offer the hardware abstractions...
Diomidis Spinellis, Sophia Drossopoulou, Susan Eis...
BMCBI
2010
149views more  BMCBI 2010»
13 years 5 months ago
S3DB core: a framework for RDF generation and management in bioinformatics infrastructures
Background: Biomedical research is set to greatly benefit from the use of semantic web technologies in the design of computational infrastructure. However, beyond well defined res...
Jonas S. Almeida, Helena F. Deus, Wolfgang Maass
DATE
2008
IEEE
163views Hardware» more  DATE 2008»
13 years 12 months ago
Design flow for embedded FPGAs based on a flexible architecture template
Modern digital signal processing applications have an increasing demand for computational power while needing to preserve low power dissipation and high flexibility. For many appl...
B. Neumann, Thorsten von Sydow, Holger Blume, Tobi...
AC
1998
Springer
13 years 5 months ago
Cellular Automata Models of Self-Replicating Systems
Abstract: Since von Neumann's seminal work around 1950, computer scientists and others have studied the algorithms needed to support self-replicating systems. Much of this wor...
James A. Reggia, Hui-Hsien Chou, Jason D. Lohn