Sciweavers

10608 search results - page 7 / 2122
» Complexity of O'Hara's Algorithm
Sort
View
TWC
2008
107views more  TWC 2008»
13 years 7 months ago
A low complexity user scheduling algorithm for uplink multiuser MIMO systems
A low complexity user scheduling algorithm based on a novel adaptive Markov chain Monte Carlo (AMCMC) method is proposed to achieve the maximal sum capacity in an uplink multiple-i...
Yangyang Zhang, Chunlin Ji, Yi Liu, Wasim Q. Malik...
CAL
2008
13 years 7 months ago
A Parallel Deadlock Detection Algorithm with O(1) Overall Run-time Complexity
This article proposes a novel parallel, hardware-oriented deadlock detection algorithm for multiprocessor system-on-chips. The proposed algorithm takes full advantage of hardware ...
Jaehwan John Lee, Xiang Xiao
JACM
2000
119views more  JACM 2000»
13 years 7 months ago
A minimum spanning tree algorithm with Inverse-Ackermann type complexity
A deterministic algorithm for computing a minimum spanning tree of a connected graph is presented. Its running time is O(m (m, n)), where is the classical functional inverse of Ack...
Bernard Chazelle
CCR
2006
122views more  CCR 2006»
13 years 7 months ago
Low complexity, stable scheduling algorithms for networks of input queued switches with no or very low speed-up
The delay and throughput characteristics of a packet switch depend mainly on the queueing scheme and the scheduling algorithm deployed at the switch. Early research on scheduling ...
Claus Bauer
HPCC
2007
Springer
14 years 1 months ago
Towards a Complexity Model for Design and Analysis of PGAS-Based Algorithms
Many new Partitioned Global Address Space (PGAS) programming languages have recently emerged and are becoming ubiquitously available on nearly all modern parallel architectures. PG...
Mohamed Bakhouya, Jaafar Gaber, Tarek A. El-Ghazaw...