In this paper, tabu search for SAT is investigated from an experimental point of view. To this end, TSAT, a basic tabu search algorithm for SAT, is introduced and compared with Se...
A large number of problems that occur in knowledge-representation, learning, VLSI-design, and other areas of artificial intelligence, are essentially satisfiability problems. The ...
While an exact stationarization of a process with a given spectrum magnitude can be obtained via a complete randomization of the spectrum phase (“surrogates” technique), we pr...
Availability prediction in a telecommunication system plays a crucial role in its management, either by alerting the operator to potential failures or by proactively initiating pr...
Randomized incremental constructions are widely used in computational geometry, but they perform very badly on large data because of their inherently random memory access patterns...