Sciweavers

52 search results - page 10 / 11
» Efficient Minimal Perfect Hash Language Models
Sort
View
ASE
2005
137views more  ASE 2005»
13 years 6 months ago
Rewriting-Based Techniques for Runtime Verification
Techniques for efficiently evaluating future time Linear Temporal Logic (abbreviated LTL) formulae on finite execution traces are presented. While the standard models of LTL are i...
Grigore Rosu, Klaus Havelund
CASES
2010
ACM
13 years 4 months ago
Improved procedure placement for set associative caches
The performance of most embedded systems is critically dependent on the memory hierarchy performance. In particular, higher cache hit rate can provide significant performance boos...
Yun Liang, Tulika Mitra
AIPS
2009
13 years 7 months ago
Flexible Execution of Plans with Choice
Dynamic plan execution strategies allow an autonomous agent to respond to uncertainties while improving robustness and reducing the need for an overly conservative plan. Executive...
Patrick R. Conrad, Julie A. Shah, Brian C. William...
BMCBI
2010
178views more  BMCBI 2010»
13 years 6 months ago
Applications of a formal approach to decipher discrete genetic networks
Background: A growing demand for tools to assist the building and analysis of biological networks exists in systems biology. We argue that the use of a formal approach is relevant...
Fabien Corblin, Eric Fanchon, Laurent Trilling
CONCURRENCY
2002
99views more  CONCURRENCY 2002»
13 years 6 months ago
A distributed computing environment for interdisciplinary applications
Practical applications are generally interdisciplinary in nature. The technology is well matured for addressing individual discipline applications and not for interdisciplinary ap...
Jerry A. Clarke, Raju R. Namburu