Sciweavers

227 search results - page 14 / 46
» Formal verification of systems with an unlimited number of c...
Sort
View
AI
1998
Springer
14 years 19 days ago
A Trainable Bracketer for Noun Modifiers
Noun phrases carry much of the information in a text. Systems that attempt to acquire knowledge from text must first decompose complex noun phrases to get access to that informatio...
Ken Barker
JOC
2011
104views more  JOC 2011»
12 years 11 months ago
On the Security of Oscillator-Based Random Number Generators
Physical random number generators (a.k.a. TRNGs) appear to be critical components of many cryptographic systems. Yet, such building blocks are still too seldom provided with a form...
Mathieu Baudet, David Lubicz, Julien Micolod, Andr...
AICCSA
2001
IEEE
83views Hardware» more  AICCSA 2001»
14 years 1 days ago
A Measure for Component Interaction Test Coverage
A trend in software development is to assemble a system from a number of components. These may be either available commercially off-the-shelf, or by the use of network-based resou...
Alan W. Williams, Robert L. Probert
BMCBI
2007
114views more  BMCBI 2007»
13 years 8 months ago
Mining and state-space modeling and verification of sub-networks from large-scale biomolecular networks
Background: Biomolecular networks dynamically respond to stimuli and implement cellular function. Understanding these dynamic changes is the key challenge for cell biologists. As ...
Xiaohua Hu, Fang-Xiang Wu
ICCS
2007
Springer
14 years 2 months ago
Towards a Complex Automata Framework for Multi-scale Modeling: Formalism and the Scale Separation Map
Complex Automata were recently proposed as a paradigm to model multi-scale complex systems. The concept is formalized and the scale separation map is further investigated in relati...
Alfons G. Hoekstra, Eric Lorenz, Jean-Luc Falcone,...