To solve real-world discrete optimization problems approximately metaheuristics such as simulated annealing and other local search methods are commonly used. For large instances o...
We study Hamming versions of two classical clustering problems. The Hamming radius p-clustering problem (HRC) for a set S of k binary strings, each of length n, is to find p bina...
In order to extract high levels of performance from modern parallel architectures, the effective management of deep memory hierarchies is very important. While architectural advan...
Mahmut T. Kandemir, Alok N. Choudhary, J. Ramanuja...
Abstract. We consider dynamic evaluation of algebraic functions (matrix multiplication, determinant, convolution, Fourier transform, etc.) in the model of Reif and Tate; i.e., if f...
Gudmund Skovbjerg Frandsen, Johan P. Hansen, Peter...
Abstract: The QoS-based Resource Allocation Model (QRAM) proposed in [20] presented an analytical approach for satisfying multiple quality-of-service dimensions in a resource-const...
Ragunathan Rajkumar, Chen Lee, John P. Lehoczky, D...