This paper discusses a series of recombination operators for the timetabling problem. These operators act upon a direct representation of the timetable and maintain the property of...
There are a lot of approaches for solving planning problems. Many of these approaches are based on `brute force` search methods and do not care about structures of plans previousl...
In this paper, an efficient algorithm is presented for solving the 2-D optimization problem which is associated with computing the robustness measures of a number of linear time-in...
We offer cryptanalysis of a key exchange scheme due to Stickel [11], which was inspired by the well-known Diffie-Hellman protocol. We show that Stickel's choice of platform (t...
A promising way to accelerate similarity search is semantic hashing which designs compact binary codes for a large number of documents so that semantically similar documents are ma...