This paper discusses a new solution to university course timetabling problems. The problems that belong to the NP-hard class are very difficult to solve using conventional optimiza...
We show that 4-universal hashing can be implemented efficiently using tabulated 4-universal hashing for characters, gaining a factor of 5 in speed over the fastest existing method...
This presentation covers several sections of the paper by Berkman, Parnas and Sgall for the Advanced Topics in Network Security seminar. Ben-Gurion University of the Negev, fall 2...
Reliable risk measurement is a key problem for financial institutions and regulatory authorities. The current industry standard Value-at-Risk has several deficiencies. Improved ri...
In the context of mobile communication, an efficient algorithm for the base-station placement problem is developed in this paper. The objective is to place a given number of base-...
Gautam K. Das, Sandip Das, Subhas C. Nandy, Bhaban...