Sciweavers

759 search results - page 64 / 152
» What Can Be Implemented Anonymously
Sort
View
JALC
2006
95views more  JALC 2006»
13 years 10 months ago
On the Decidability of Model-Checking for P Systems
Membrane computing is a branch of molecular computing that aims to develop models and paradigms that are biologically motivated. It identifies an unconventional computing model, n...
Zhe Dang, Oscar H. Ibarra, Cheng Li, Gaoyan Xie
SIGARCH
2008
152views more  SIGARCH 2008»
13 years 10 months ago
OpenDF: a dataflow toolset for reconfigurable hardware and multicore systems
This paper presents the OpenDF framework and recalls that dataflow programming was once invented to address the problem of parallel computing. We discuss the problems with an impe...
Shuvra S. Bhattacharyya, Gordon J. Brebner, Jö...
TAP
2008
Springer
144views Hardware» more  TAP 2008»
13 years 10 months ago
Integrating Verification and Testing of Object-Oriented Software
Formal methods can only gain widespread use in industrial software development if they are integrated into software development techniques, tools, and languages used in practice. A...
Christian Engel, Christoph Gladisch, Vladimir Kleb...
JAR
2007
132views more  JAR 2007»
13 years 10 months ago
Visualizing SAT Instances and Runs of the DPLL Algorithm
SAT-solvers have turned into essential tools in many areas of applied logic like, for example, hardware verification or satisfiability checking modulo theories (SMT). And althoug...
Carsten Sinz
JIFS
2002
60views more  JIFS 2002»
13 years 9 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...