Sciweavers

4066 search results - page 440 / 814
» Almost Complete Sets
Sort
View
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...
ECRTS
1999
IEEE
15 years 11 months ago
QoS guarantee using probabilistic deadlines
This paper presents a probabilistic approach to guarantee the performance of a real-time system. While traditional real-time system analysis tends to guarantee that each task inst...
Luca Abeni, Giorgio C. Buttazzo
SIGMOD
1999
ACM
136views Database» more  SIGMOD 1999»
15 years 11 months ago
Query Rewriting for Semistructured Data
We address the problem of query rewriting for TSL, a language for querying semistructured data. We develop and present an algorithm that, given a semistructured query q and a set ...
Yannis Papakonstantinou, Vasilis Vassalos
ARTS
1999
Springer
15 years 11 months ago
Process Algebra with Probabilistic Choice
Published results show that various models may be obtained by combining parallel composition with probability and with or without non-determinism. In this paper we treat this probl...
Suzana Andova
ESSLLI
1999
Springer
15 years 11 months ago
Weak Equivalence in Propositional Calculus
Abstract. The main purpose of this paper is to present a new algorithm (NEWSAT) for deciding the (un)satisfiability of propositional formulae. It is based on a somehow dual (versu...
Stefan Andrei