1158 search results - page 124 / 232 » Approximation Algorithms for the Fixed-Topology Phylogenetic... |
162
click to vote
ANOR
2004
15 years 6 months ago
2004
We present an iterative cutting plane method for minimizing staffing costs in a service system subject to satisfying acceptable service level requirements over multiple time perio...
164
click to vote
GECCO
2005
Springer
15 years 11 months ago
2005
Springer
This paper describes a scalable algorithm for solving multiobjective decomposable problems by combining the hierarchical Bayesian optimization algorithm (hBOA) with the nondominat...
154
click to vote
INFOCOM
2008
IEEE
16 years 18 days ago
2008
IEEE
— The relay node placement problem for wireless sensor networks is concerned with placing a minimum number of relay nodes into a wireless sensor network to meet certain connectiv...
150
click to vote
ICTCS
2003
Springer
15 years 11 months ago
2003
Springer
In this paper, we study the problem of cost constrained fixed job scheduling (CCFJS). In this problem, there are a number of processors, each of which belongs to one of several cla...
169
click to vote
ACTA
2008
15 years 6 months ago
2008
We study the two-dimensional version of the bin packing problem with conflicts. We are given a set of (two-dimensional) squares V = {1, 2, . . . , n} with sides s1, s2 . . . , sn ...