The 0 1 MultidimensionalKnapsack Problem (0 1 MKP) is a NP-complete problem. Its resolution for large scale instances requires a prohibitive processing time. In this paper we prop...
In a hybrid peer-to-peer (P2P) system, flooding and DHT are both employed for content locating. The decision to use flooding or DHT largely depends on the population of desired da...
Xiaoqiu Shi, Jinsong Han, Yunhao Liu, Lionel M. Ni
Inspired by Darwinian evolution, a genetic algorithm (GA) approach is one of the popular heuristic methods for solving hard problems, such as the Job Shop Scheduling Problem (JSSP...
Dataraces in multithreaded programs often indicate severe bugs and can cause unexpected behaviors when different thread interleavings are executed. Because dataraces are a cause f...
We examine the problem of large scale nearest neighbor search in high dimensional spaces and propose a new approach based on the close relationship between nearest neighbor search...