Sciweavers

1284 search results - page 228 / 257
» Data Structures for Mergeable Trees
Sort
View
ICFEM
2009
Springer
14 years 7 months ago
Graded-CTL: Satisfiability and Symbolic Model Checking
In this paper we continue the study of a strict extension of the Computation Tree Logic, called graded-CTL, recently introduced by the same authors. This new logic augments the sta...
Alessandro Ferrante, Margherita Napoli, Mimmo Pare...
CADE
2011
Springer
13 years 9 months ago
Experimenting with Deduction Modulo
Deduction modulo is a generic framework to describe proofs in a theory better than using raw axioms. This is done by presenting the theory through rules rewriting terms and proposi...
Guillaume Burel
ICDE
2009
IEEE
177views Database» more  ICDE 2009»
15 years 11 months ago
Light-Weight, Runtime Verification of Query Sources
Modern database systems increasingly make use of networked storage. This storage can be in the form of SAN's or in the form of shared-nothing nodes in a cluster. One type of a...
Tingjian Ge, Stanley B. Zdonik
CASES
2006
ACM
15 years 3 months ago
Adaptive object code compression
Previous object code compression schemes have employed static and semiadaptive compression algorithms to reduce the size of instruction memory in embedded systems. The suggestion ...
John Gilbert, David M. Abrahamson
BMCBI
2008
200views more  BMCBI 2008»
14 years 10 months ago
Defining functional distances over Gene Ontology
Background: A fundamental problem when trying to define the functional relationships between proteins is the difficulty in quantifying functional similarities, even when well-stru...
Angela del Pozo, Florencio Pazos, Alfonso Valencia