In this paper, we present the first average-case analysis proving an expected polynomial running time for an exact algorithm for the 0/1 knapsack problem. In particular, we prove,...
Solving complex, real-world problems with genetic programming (GP) can require extensive computing resources. However, the highly parallel nature of GP facilitates using a large n...
—We study the problem of optimizing the symbol error probability (SEP) performance of cluster-based cooperative wireless sensor networks (WSNs). It is shown in the literature tha...
Mohammad Abdizadeh, Hadi Jamali Rad, Bahman Abolha...
— A lot of plumbings such as gas pipes and water pipes exist in public utilities, factories, power plants and so on. It is difficult for humans to inspect them directly because t...
—This paper studies the problem of outlier detection on uncertain data. We start with a comprehensive model considering both uncertain objects and their instances. An uncertain o...