Sciweavers

6 search results - page 1 / 2
» Implementing and testing the tabu cycle and conditional prob...
Sort
View
COR
2006
64views more  COR 2006»
13 years 4 months ago
Implementing and testing the tabu cycle and conditional probability methods
-- The purpose of this paper is to describe the implementation and testing of the tabu cycle method and two variants of the conditional probability method. These methods were origi...
Manuel Laguna
CONCUR
2006
Springer
13 years 8 months ago
A Livelock Freedom Analysis for Infinite State Asynchronous Reactive Systems
We describe an incomplete but sound and efficient livelock freedom test for infinite state asynchronous reactive systems. The method s a system into a set of simple control flow cy...
Stefan Leue, Alin Stefanescu, Wei Wei
BMCBI
2008
106views more  BMCBI 2008»
13 years 4 months ago
Ontology Design Patterns for bio-ontologies: a case study on the Cell Cycle Ontology
Background: Bio-ontologies are key elements of knowledge management in bioinformatics. Rich and rigorous bio-ontologies should represent biological knowledge with high fidelity an...
Mikel Egaña Aranguren, Erick Antezana, Mart...
SIGSOFT
2005
ACM
14 years 5 months ago
Arithmetic program paths
We present Arithmetic Program Paths, a novel, efficient way to compress program control-flow traces that reduces program bit traces to less than a fifth of their original size whi...
Manos Renieris, Shashank Ramaprasad, Steven P. Rei...
CHES
2011
Springer
276views Cryptology» more  CHES 2011»
12 years 4 months ago
FPGA-Based True Random Number Generation Using Circuit Metastability with Adaptive Feedback Control
Abstract. The paper presents a novel and efficient method to generate true random numbers on FPGAs by inducing metastability in bi-stable circuit elements, e.g. flip-flops. Meta...
Mehrdad Majzoobi, Farinaz Koushanfar, Srinivas Dev...