An O(N/sup M/(M+1/)) distributed algorithm for the k-out of-M resources allocation problem

2002 ◽  
Author(s):  
R. Baldoni
Keyword(s):  
Distributed Algorithm ◽  
Allocation Problem ◽  
Resources Allocation

Lexicographic multi-period resources allocation problem with weighted substitutable resources

2016 ◽  
Vol 25 (2) ◽  
pp. 252
Author(s):  
Mohamed Essalah Salah ◽  
Slah Ben Youssef ◽  
Abdelwaheb Rebai
Keyword(s):  
Allocation Problem ◽  
Resources Allocation

A Medical Resources Allocation Problem

2009 ◽  
Vol 53 (3-4) ◽  
pp. 341-348 ◽  
Author(s):  
Luciana Neamţiu
Keyword(s):  
Allocation Problem ◽  
Resources Allocation ◽  
Medical Resources

scholarly journals 1-local 33/24-competitive Algorithm for Multicoloring Hexagonal Graphs

2013 ◽  
Vol Vol. 15 no. 3 (Graph Theory) ◽  
Author(s):  
Rafal Witkowski ◽  
Janez Žerovnik
Keyword(s):  
Graph Theory ◽  
Distributed Algorithm ◽  
Allocation Problem ◽  
Frequency Allocation ◽  
Cellular Telephone ◽  
Coverage Area ◽  
Competitive Algorithm ◽  
Phone Calls ◽  
International Audience ◽  
Hexagonal Graph

Graph Theory International audience In the frequency allocation problem, we are given a cellular telephone network whose geographical coverage area is divided into cells, where phone calls are serviced by assigned frequencies, so that none of the pairs of calls emanating from the same or neighboring cells is assigned the same frequency. The problem is to use the frequencies efficiently, i.e. minimize the span of frequencies used. The frequency allocation problem can be regarded as a multicoloring problem on a weighted hexagonal graph, where each vertex knows its position in the graph. We present a 1-local 33/24-competitive distributed algorithm for multicoloring a hexagonal graph, thereby improving the previous 1-local 7/5-competitive algorithm.

STD Mapping Model Designing Based on Layered Mapping Theory

2013 ◽  
Vol 313-314 ◽  
pp. 1012-1016
Author(s):  
Yu Liang Chen ◽  
Xiang Ling ◽  
Jia Li
Keyword(s):  
Test System ◽  
Allocation Problem ◽  
Resources Allocation ◽  
Structure Model ◽  
Mapping Model ◽  
Control Signals ◽  
Realization Process ◽  
And Control ◽  
Mapping Theory

IEEE Std 1641-2010 puts TPL, TSF, BSC and SML four layer STD structure model, which provides the capability to describe and control signals, but does not give the layer between the mapping relation and its specific realization process. Based on a in-depth understanding of those layers, we provide signals request and connection mapping model and its arithmetic based on layered mapping theory. It settles signals to instrument resources allocation problem and signal-oriented driver designing in auto test system.

On the resources allocation problem

1992 ◽  
Vol 30 (12) ◽  
pp. 2773-2795 ◽  
Author(s):  
G. CHRYSSOLOURIS ◽  
K. DICKE ◽  
M. LEE
Keyword(s):  
Allocation Problem ◽  
Resources Allocation
Sign in / Sign up

Export Citation Format

Share Document