Sciweavers

3047 search results - page 324 / 610
» On the Meaning of Logical Completeness
Sort
View
189
Voted
VLDB
2001
ACM
131views Database» more  VLDB 2001»
15 years 12 months ago
Change-Centric Management of Versions in an XML Warehouse
: We present a change-centric method to manage versions in a Web WareHouse of XML data. The starting points is a sequence of snapshots of XML documents we obtain from the web. By r...
Amélie Marian, Serge Abiteboul, Gregory Cob...
DFT
1999
IEEE
125views VLSI» more  DFT 1999»
15 years 11 months ago
Algorithms for Efficient Runtime Fault Recovery on Diverse FPGA Architectures
The inherent redundancy and in-the-field reconfiguration capabilities of field programmable gate arrays (FPGAs) provide alternatives to integrated circuit redundancy-based fault r...
John Lach, William H. Mangione-Smith, Miodrag Potk...
FLOPS
1999
Springer
15 years 11 months ago
Typed Higher-Order Narrowing without Higher-Order Strategies
We describe a new approach to higher-order narrowing computations in a class of systems suitable for functional logic programming. Our approach is based on a translation of these s...
Sergio Antoy, Andrew P. Tolmach
TYPES
1998
Springer
15 years 11 months ago
Metatheory of Verification Calculi in LEGO - To what Extent Does Syntax Matter?
Investigating soundness and completeness of verification calculi for imperative programming languages is a challenging task. Incorrect results have been published in the past. We t...
Thomas Kleymann
VLSID
1997
IEEE
112views VLSI» more  VLSID 1997»
15 years 11 months ago
Adder and Comparator Synthesis with Exclusive-OR Transform of Inputs
An exclusive-OR transform of input variables significantly reduces the size of the PLA implementation for adder and comparator circuits. For n bit adder circuits, the size of PLA ...
James Jacob, P. Srinivas Sivakumar, Vishwani D. Ag...