266 search results - page 21 / 54 » A greedy genetic algorithm for the quadratic assignment prob... |
AUSAI
2003
Springer
14 years 25 days ago
2003
Springer
Abstract. The RGCP (Robust Graph Coloring problem) is a new variant of the traditional graph coloring problem. It has numerous practical applications in real world like timetabling...
ICIAP
2001
Springer
14 years 7 months ago
2001
Springer
Deformable models are by their formulation able to solve surface extraction problem from noisy volumetric image data encountered commonly in medical image analysis. However, this ...
STACS
2004
Springer
14 years 28 days ago
2004
Springer
OrthogonalVariableSpreadingFactor(OVSF)codesareusedinUMTStosharetheradiospectrum among several connections of possibly different bandwidth requirements. The combinatorial core of t...
EVOW
2004
Springer
14 years 29 days ago
2004
Springer
This paper introduces a new social metaheuristic for the Max-Cut problem applied to a weighted undirected graph. This problem consists in finding a partition of the nodes into two ...
COR
2006
13 years 7 months ago
2006
In this paper we tackle the task assignment problem (TSAP) in heterogeneous computer systems. The TSAP consists of assigning a given distributed computer program formed by a numbe...