Continuous Spatial Assignment of Moving Users
Consider a set of servers and a set of users, where each server has a coverage region (i.e., an area of service) and a capacity (i.e., a maximum number of users it can serve). Our task is to assign every user to one server subject to the coverage and capacity constraints. To offer the highest qualit...
Saved in:
Main Authors: | LEONG, Hou U, MOURATIDIS, Kyriakos, MAMOULIS, Nikos |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2010
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/2450 https://ink.library.smu.edu.sg/context/sis_research/article/3449/viewcontent/Continuous_Spatial_Assignment_of_Moving_Users.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
General stochastic user equilibrium traffic assignment problem with link capacity constraints
by: Meng, Q., et al.
Published: (2014) -
Joint Search by Social and Spatial Proximity [Extended Abstract]
by: MOURATIDIS, Kyriakos, et al.
Published: (2016) -
A unified framework for isotropic meshing based on narrow-band Euclidean distance transformation
by: Leung, Yuen-Shan, et al.
Published: (2018) -
Joint search by social and spatial proximity
by: MOURATIDIS, Kyriakos, et al.
Published: (2015) -
A Fair Assignment Algorithm for Multiple Preference Queries
by: U, Leong Hou, et al.
Published: (2009)