Sciweavers

3758 search results - page 290 / 752
» A Complete Subsumption Algorithm
Sort
View
ICDCS
2003
IEEE
15 years 12 months ago
Enhancing The Fault-Tolerance of Nonmasking Programs
In this paper, we focus on automated techniques to enhance the fault-tolerance of a nonmasking fault-tolerant program to masking. A masking program continually satisfies its spec...
Sandeep S. Kulkarni, Ali Ebnenasir
AIPS
2003
15 years 8 months ago
Decision-Theoretic Group Elevator Scheduling
We present an efficient algorithm for exact calculation and minimization of expected waiting times of all passengers using a bank of elevators. The dynamics of the system are rep...
Daniel Nikovski, Matthew Brand
KAIS
2008
114views more  KAIS 2008»
15 years 6 months ago
A new concise representation of frequent itemsets using generators and a positive border
A complete set of frequent itemsets can get undesirably large due to redundancy when the minimum support threshold is low or when the database is dense. Several concise representat...
Guimei Liu, Jinyan Li, Limsoon Wong
TIP
1998
240views more  TIP 1998»
15 years 6 months ago
DCT-based motion estimation
—We propose novel discrete cosine transform (DCT) pseudophase techniques to estimate shift/delay between two onedimensional (1-D) signals directly from their DCT coefficients by...
Ut-Va Koc, K. J. Ray Liu
IJCAI
1997
15 years 8 months ago
Mini-Buckets: A General Scheme for Generating Approximations in Automated Reasoning
The class of algorithms for approximating reasoning tasks presented in this paper is based on approximating the general bucket elimination framework. The algorithms have adjustabl...
Rina Dechter