8 search results - page 2 / 2 » A Case for Compressing Traces with BDDs |
PUK
2003
13 years 6 months ago
2003
This paper exploits the spatial representation of state space problem graphs to preprocess and enhance heuristic search engines. It combines classical AI exploration with computati...
RSP
2006
IEEE
13 years 11 months ago
2006
IEEE
This paper presents the design and the performance evaluation of a coarse-grain dynamically reconfigurable platform for network applications. The platform consists of two MicroBla...
CONEXT
2007
ACM
13 years 8 months ago
2007
ACM
Deterministic finite automata (DFAs) are widely used to perform regular expression matching in linear time. Several techniques have been proposed to compress DFAs in order to redu...