Sciweavers

16596 search results - page 14 / 3320
» Generalized Assignment Problems
Sort
View
AAIM
2007
Springer
120views Algorithms» more  AAIM 2007»
15 years 1 months ago
Online OVSF Code Assignment with Resource Augmentation
Abstract. Orthogonal Variable Spreading Factor (OVSF) code assignment is a fundamental problem in Wideband Code-Division MultipleAccess (W-CDMA) systems, which play an important ro...
Francis Y. L. Chin, Yong Zhang, Hong Zhu
SAC
2005
ACM
15 years 3 months ago
Limited assignments: a new cutoff strategy for incomplete depth-first search
In this paper, we propose an extension of three incomplete depthfirst search techniques, namely depth-bounded backtrack search, credit search, and iterative broadening, towards pr...
Roman Barták, Hana Rudová
GECCO
2007
Springer
150views Optimization» more  GECCO 2007»
15 years 3 months ago
Credit assignment in adaptive memetic algorithms
Adaptive Memetic Algorithms couple an evolutionary algorithm with a number of local search heuristics for improving the evolving solutions. They are part of a broad family of meta...
J. E. Smith
CIKM
2008
Springer
14 years 11 months ago
Multi-aspect expertise matching for review assignment
Review assignment is a common task that many people such as conference organizers, journal editors, and grant administrators would have to do routinely. As a computational problem...
Maryam Karimzadehgan, ChengXiang Zhai, Geneva G. B...
AMMA
2009
Springer
15 years 4 months ago
Fair Package Assignment
We consider the problem of fair allocation in the package assignment model, where a set of indivisible items, held by single seller, must be efficiently allocated to agents with q...
Sébastien Lahaie, David C. Parkes