465 search results - page 28 / 93 » On the Hardness of Range Assignment Problems |
136
Voted
IWCMC
2006
ACM
15 years 8 months ago
2006
ACM
Designing and planning of the switching, signaling and support network is a fairly complex process in cellular mobile network. In this paper, the problem of assigning cells to swi...
124
click to vote
RTAS
2005
IEEE
15 years 7 months ago
2005
IEEE
We consider the problem of energy minimization for periodic preemptive hard real-time tasks that are scheduled on an identical multiprocessor platform with dynamic voltage scaling...
120
click to vote
AAAI
1998
15 years 3 months ago
1998
Scheduling of multiple parallel machinesin the face of sequence dependent setups and downstream considerations is a hard problem. No single efficient algorithm is guaranteedto pro...
135
click to vote
GECCO
2010
Springer
15 years 6 months ago
2010
Springer
Adaptive Operator Selection (AOS) turns the impacts of the applications of variation operators into Operator Selection through a Credit Assignment mechanism. However, most Credit ...
145
click to vote
FOCS
2008
IEEE
15 years 3 months ago
2008
IEEE
In the mobile facility location problem, which is a variant of the classical Uncapacitated Facility Location and kMedian problems, each facility and client is assigned to a start ...