Stand-alone ranking systems based on highly optimized inverted file structures are generally considered `the' solution for building search engines. Observing various developm...
This paper describes a practical application of a novel terminal attractor algorithm to the construction of Perfect Hash Functions (PHF) for a prede ned set of keys. The proposed ...
In recent years there has been a flurry of works on learning Bayesian networks from data. One of the hard problems in this area is how to effectively learn the structure of a beli...
The search problem, ACCESSIBILITY, asks whether a finite sequence of events can be found such that, starting with a specific initial event, a particular state can be reached. This...
We study the effect of three new reduction strategies for conventional reachability analysis, as used in automated protocol validation algorithms. The first two strategies are imp...
Gerard J. Holzmann, Patrice Godefroid, Didier Piro...