Sciweavers

2354 search results - page 169 / 471
» Assignment Problems
Sort
View
CORR
2011
Springer
180views Education» more  CORR 2011»
14 years 9 months ago
Lower Bound for Envy-Free and Truthful Makespan Approximation on Related Machines
We study problems of scheduling jobs on related machines so as to minimize the makespan in the setting where machines are strategic agents. In this problem, each job j has a lengt...
Lisa Fleischer, Zhenghui Wang
RECOMB
2005
Springer
16 years 5 months ago
Reversals of Fortune
Abstract. The objective function of the genome rearrangement problems allows the integration of other genome-level problems so that they may be solved simultaneously. Three example...
David Sankoff, Chunfang Zheng, Aleksander Lenert
WDAG
2007
Springer
100views Algorithms» more  WDAG 2007»
15 years 11 months ago
Scalable Load-Distance Balancing
We introduce the problem of load-distance balancing in assigning users of a delay-sensitive networked application to servers. We model the service delay experienced by a user as a ...
Edward Bortnikov, Israel Cidon, Idit Keidar
IPPS
2003
IEEE
15 years 10 months ago
Allocating Servers in Infostations for On-Demand Communications
Given a set of service requests, each char acterize d by a temporal interval and a category, an integer k, and an integer hc for each categoryc, the Server A llocation with Bounde...
Alan A. Bertossi, Maria Cristina Pinotti, Romeo Ri...
INFOCOM
1997
IEEE
15 years 9 months ago
Channel Carrying: A Novel Handoff Scheme for Mobile Cellular Networks
— We present a new scheme that addresses the call handoff problem in mobile cellular networks. Efficiently solving the handoff problem is important for guaranteeing quality of s...
Junyi Li, Ness B. Shroff, Edwin K. P. Chong