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...
Cryptarithmetic problem is an interesting constraint satisfaction problem for which different algorithms have been given. But none of them can solve the problem intelligently using...
Abu Sayef Md. Ishaque, Md. Bahlul Haider, Muhammad...
A path from s to t on a polyhedral terrain is descending if the height of a point p never increases while we move p along the path from s to t. No efficient algorithm is known to ...
Mustaq Ahmed, Sandip Das, Sachin Lodha, Anna Lubiw...
This paper presents a predictable and grouped genetic algorithm (PGGA) for job scheduling. The novelty of the PGGA is twofold: (1) a job workload estimati...
The routing algorithms for multimedia communication should use for routing more than one QoS parameter. This is because new services such as video on demand and remote meeting sys...
Akio Koyama, Leonard Barolli, Kazunori Matsumoto, ...