๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The on-line first-fit algorithm for radio frequency assignment problems

โœ Scribed by Yin-Te Tsai; Yaw-Ling Lin; F.R. Hsu

Publisher
Elsevier Science
Year
2002
Tongue
English
Weight
193 KB
Volume
84
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On-line algorithms for the channel assig
On-line algorithms for the channel assignment problem in cellular networks
โœ Pilu Crescenzi; Giorgio Gambosi; Paolo Penna ๐Ÿ“‚ Article ๐Ÿ“… 2004 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 364 KB

We consider the on-line channel assignment problem in the case of cellular networks and we formalize this problem as an on-line load balancing problem for temporary tasks with restricted assignment. For the latter problem, we provide a general solution (denoted as the cluster algorithm) and we chara

A Greedy On-Line Algorithm for thek-Trac
A Greedy On-Line Algorithm for thek-Track Assignment Problem
โœ U Faigle; W Kern; W.M Nawijn ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 107 KB

Given a collection I I of n jobs that are represented by intervals, we seek a maximal feasible assignment of the jobs to k machines such that not more than ลฝ . c M intervals overlap pairwise on any machine M and that a job is only assigned to a machine if it fits into one of several prescribed time

New On-Line Algorithms for the Page Repl
New On-Line Algorithms for the Page Replication Problem
โœ Susanne Albers; Hisashi Koga ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 210 KB

We present improved competitive on-line algorithms for the page replication problem and concentrate on important network topologies for which algorithms with a constant competitive ratio can be given. We develop an optimal randomized on-line replication algorithm for trees and uniform networks; its