Sciweavers

1549 search results - page 199 / 310
» On the rules of intermediate logics
Sort
View
PERVASIVE
2006
Springer
13 years 9 months ago
Scalability in a Secure Distributed Proof System
Abstract. A logic-based language is often adopted in systems for pervasive computing, because it provides a convenient way to define rules that change the behavior of the systems d...
Kazuhiro Minami, David Kotz
FPGA
2009
ACM
168views FPGA» more  FPGA 2009»
13 years 6 months ago
Large-scale wire-speed packet classification on FPGAs
Multi-field packet classification is a key enabling function of a variety of network applications, such as firewall processing, Quality of Service differentiation, traffic billing...
Weirong Jiang, Viktor K. Prasanna
HASKELL
2007
ACM
14 years 1 months ago
A type-preserving closure conversion in haskell
The use of typed intermediate languages can significantly increase the reliability of a compiler. By type-checking the code produced at each transformation stage, one can identify...
Louis-Julien Guillemette, Stefan Monnier
MCU
2004
126views Hardware» more  MCU 2004»
13 years 10 months ago
Universality and Cellular Automata
The classification of discrete dynamical systems that are computationally complete has recently drawn attention in light of Wolfram's "Principle of Computational Equivale...
Klaus Sutner
BMCBI
2007
144views more  BMCBI 2007»
13 years 9 months ago
Application of amino acid occurrence for discriminating different folding types of globular proteins
Background: Predicting the three-dimensional structure of a protein from its amino acid sequence is a long-standing goal in computational/molecular biology. The discrimination of ...
Y.-h. Taguchi, M. Michael Gromiha