Sciweavers

592 search results - page 60 / 119
» Can Component Service-Based Systems Be Proved Correct
Sort
View
ENTCS
2006
176views more  ENTCS 2006»
13 years 7 months ago
Automatic Formal Synthesis of Hardware from Higher Order Logic
A compiler that automatically translates recursive function definitions in higher order logic to clocked synchronous hardware is described. Compilation is by mechanised proof in t...
Mike Gordon, Juliano Iyoda, Scott Owens, Konrad Sl...
ICDCN
2011
Springer
12 years 11 months ago
Mining Frequent Subgraphs to Extract Communication Patterns in Data-Centres
In this paper, we propose to use graph-mining techniques to understand the communication pattern within a data-centre. We model the communication observed within a data-centre as a...
Maitreya Natu, Vaishali P. Sadaphal, Sangameshwar ...
FUIN
2006
66views more  FUIN 2006»
13 years 7 months ago
Observation of String-Rewriting Systems
In most models of computation, a device performs some type of process, and only some final output is regarded as the result. In adding an observer to such a device, one can obtain ...
Matteo Cavaliere, Peter Leupold
AMC
2006
104views more  AMC 2006»
13 years 7 months ago
Three counterexamples refuting Kieu's plan for "quantum adiabatic hypercomputation"; and some uncomputable quantum mechanical ta
-- Tien D. Kieu, in 10 papers posted to the quant-ph section of the xxx.lanl.gov preprint archive [some of which were also published in printed journals such as Proc. Royal Soc. A ...
Warren D. Smith
TNN
2010
174views Management» more  TNN 2010»
13 years 2 months ago
Equivalences between neural-autoregressive time series models and fuzzy systems
Soft computing (SC) emerged as an integrating framework for a number of techniques that could complement one another quite well (artificial neural networks, fuzzy systems, evolutio...
José Luis Aznarte, José Manuel Ben&i...