8540 search results - page 247 / 1708 » The Dynamic Servers Problem |
117
Voted
CPAIOR
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. An optimization problem arising in the design of optical fibre networks is discussed. A network contains client nodes, each installed on one or more SONET rings. A const...
112
click to vote
ESA
2010
Springer
15 years 4 months ago
2010
Springer
We study a wide generalization of two classical problems, the Huffman Tree and Alphabetic Tree Problem. We assume that the cost caused by the ith leaf is fi(di), where di is its d...
159
Voted
ICALP
2009
Springer
16 years 3 months ago
2009
Springer
The algebraic framework introduced in [Koutis, Proc. of the 35th ICALP 2008] reduces several combinatorial problems in parameterized complexity to the problem of detecting multili...
120
Voted
SPAA
2003
ACM
15 years 8 months ago
2003
ACM
In the classical load balancing or multiprocessor scheduling problem, we are given a sequence of jobs of varying sizes and are asked to assign each job to one of the m empty proce...
143
Voted
GECCO
2006
Springer
15 years 7 months ago
2006
Springer
In this paper, we address the problem of finding gene regulatory networks from experimental DNA microarray data. We focus on the evaluation of the performance of different evoluti...