We present a new test generation procedure for sequential circuits using newly traversed state and newly detected fault information obtained between successive iterations of vecto...
Ashish Giani, Shuo Sheng, Michael S. Hsiao, Vishwa...
Most of complete search algorithms over Constraint Satisfaction Problems (csp) are based on Standard Backtracking. Two main enhancements of this basic scheme have been proposed : r...
This study is a comparison of three routing protocols proposed for wireless mobile ad-hoc networks. The protocols are: Destination Sequenced Distance Vector (DSDV), Ad-hoc On dema...
Per Johansson, Tony Larsson, Nicklas Hedman, Barto...
Aggregation in traditional database systems is performed in batch mode: a query is submitted, the system processes a large volume of data over a long period of time, and, eventual...
Joseph M. Hellerstein, Peter J. Haas, Helen J. Wan...
Abstract. Combinatorial search methods often exhibit a large variability in performance. We study the cost pro les of combinatorial search procedures. Our study reveals some intrig...