8540 search results - page 188 / 1708 » The Dynamic Servers Problem |
135
click to vote
IWPEC
2004
Springer
15 years 8 months ago
2004
Springer
We propose to look at the computational complexity of 2-dimensional geometric optimization problems on a finite point set with respect to the number of inner points (that is, poi...
129
click to vote
KR
2004
Springer
15 years 8 months ago
2004
Springer
We consider complex scheduling problems that can be captured as optimization under hard and soft constraints. The objective of such an optimization problem is to satisfy as many h...
159
click to vote
CP
1998
Springer
15 years 7 months ago
1998
Springer
We use a local search method we term Large Neighbourhood Search (LNS) for solving vehicle routing problems. LNS meshes well with constraint programming technology and is analogous...
160
click to vote
GECCO
2006
Springer
15 years 6 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 mathemat...
137
click to vote
IPPS
2007
IEEE
15 years 9 months ago
2007
IEEE
Solving optimally large instances of combinatorial optimization problems requires a huge amount of computational resources. In this paper, we propose an adaptation of the parallel...