Sciweavers

2584 search results - page 20 / 517
» On the Forward Checking Algorithm
Sort
View
ALENEX
2011
416views Algorithms» more  ALENEX 2011»
12 years 11 months ago
Exact Pattern Matching with Feed-Forward Bloom Filters
This paper presents an algorithm for exact pattern matching based on a new type of Bloom filter that we call a feed-forward Bloom filter. Besides filtering the input corpus, a ...
Iulian Moraru, David G. Andersen
ICSE
2004
IEEE-ACM
14 years 8 months ago
Efficient Forward Computation of Dynamic Slices Using Reduced Ordered Binary Decision Diagrams
Dynamic slicing algorithms can greatly reduce the debugging effort by focusing the attention of the user on a relevant subset of program statements. Recently algorithms for forwar...
Xiangyu Zhang, Rajiv Gupta, Youtao Zhang
ICES
2000
Springer
91views Hardware» more  ICES 2000»
13 years 11 months ago
Dynamic Optimisation of Non-linear Feed Forward Circuits
Abstract. An evolutionary algorithm is used to evolve a digital circuit which computes a simple hash function mapping a 16-bit address space into an 8-bit one. The target technolog...
Ernesto Damiani, Valentino Liberali, Andrea Tettam...
ICC
2007
IEEE
144views Communications» more  ICC 2007»
14 years 2 months ago
Binary Repetition Codes and SPC Product Codes for Coded and Cooperative Diversity Systems
— A three stage network protocol that can achieve coded and cooperative diversity to improve network coverage is investigated. In Stage 1, a cyclic redundancy check code is used ...
Pavel Loskot, Norman C. Beaulieu
CHARME
2005
Springer
176views Hardware» more  CHARME 2005»
14 years 1 months ago
An Analysis of SAT-Based Model Checking Techniques in an Industrial Environment
Abstract. Model checking is a formal technique for automatically verifying that a finite-state model satisfies a temporal property. In model checking, generally Binary Decision D...
Nina Amla, Xiaoqun Du, Andreas Kuehlmann, Robert P...